jee-advanced 2025 Q8

jee-advanced · India · paper1 4 marks Permutations & Arrangements Counting Functions with Constraints
Let the set of all relations $R$ on the set $\{ a , b , c , d , e , f \}$, such that $R$ is reflexive and symmetric, and $R$ contains exactly 10 elements, be denoted by $\mathcal { S }$.
Then the number of elements in $\mathcal { S }$ is $\_\_\_\_$ .
Let the set of all relations $R$ on the set $\{ a , b , c , d , e , f \}$, such that $R$ is reflexive and symmetric, and $R$ contains exactly 10 elements, be denoted by $\mathcal { S }$.

Then the number of elements in $\mathcal { S }$ is $\_\_\_\_$ .