Let the set of all relations on the set , such that is reflexive and symmetric, and contains exactly 10 elements, be denoted by .
Then the number of elements in is ________.
The underlying set is with .
A relation on is a subset of . The required relations must satisfy two conditions:
1. Reflexive: for every , the ordered pair is in the relation. Therefore the six diagonal pairs are compulsory. So each admissible relation already contains pairs.
2. Symmetric: if is in the relation, then so is .
The problem states that the relation must contain exactly ordered pairs. Since pairs are fixed by reflexivity, we still have to add more ordered pairs.
Because of symmetry, the non-diagonal pairs must be chosen in symmetric blocks: adding automatically forces us to add . Consequently the extra pairs must come in symmetric blocks.
How many off-diagonal symmetric blocks exist? Each block corresponds to an unordered pair with . The number of such unordered pairs in a 6-element set is .
To create the relation we simply pick any of these unordered pairs; each chosen pair contributes its two ordered pairs and thus supplies the needed additional elements.
Hence the number of admissible relations is .
Therefore, the set contains relations.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.