In the set B, the elements are fractions nm such that, n can take the values from {1,2,...,10} and m has to be less than n and, m and n must be co-primes.
Euler's totient function represents the count of positive integers less than a given integer n that are co-prime to n.
If n is represented as,
n = p1a × p2b × p3c ... where p_1,\ p_2,\ p_3..\ are primes.
Φ(n) = n(1−p11)(1−p21)(1−p31)...
When n is prime, Φ(n)=n−1
n(B)=Φ(10)+ Φ(9) + ... + Φ(2)
We are not including Φ(1), as there are no integers less than 1 that are co-prime to 1.
Φ(10): 10=2×5
Φ(10)=10(1−21)(1−51) = 10(21)(54) = 4
Φ(9): 9=32
Φ(9)=9(1−31) = 6
Φ(8): 8=23
Φ(8)=8(1−21) = 4
Φ(7): 7 is prime
Φ(7)=6
Φ(6): 6=2×3
Φ(6)=6(1−21)(1−31) = 6(21)(32) = 2
Φ(5): 5 is prime
Φ(5)=4
Φ(4): 4=22
Φ(4)=4(1−21) = 2
Φ(3): 3 is prime
Φ(3)=2
Φ(2): 2 is prime
Φ(2)=1
n(B)=Φ(10)+ Φ(9) + ... + Φ(2)= 4 + 6 + 4 + 6 + 2 + 4 + 2 + 2 + 1 = 31
Hence, the correct answer is option B.