MCQMediumJEE 2025Sets & Operations

JEE Mathematics 2025 Question with Solution

Let A={1,2,3,,10}A = \{1, 2, 3, \dots, 10\} and B={mn:m,nA,m<n and gcd(m,n)=1}B = \left\{ \frac{m}{n} : m, n \in A, m < n \text{ and } \gcd(m, n) = 1 \right\}. Then n(B)n(B) is equal to :

  • A

    3131

  • B

    3636

  • C

    3737

  • D

    2929

Answer

Correct answer:A

Step-by-step solution

Standard Method

Given: A={1,2,3,,10}A = \{1, 2, 3, \dots, 10\} and B={mn:m,nA,m<n and gcd(m,n)=1}B = \left\{ \frac{m}{n} : m, n \in A, m < n \text{ and } \gcd(m, n) = 1 \right\}.

Find: n(B)n(B).

For each fixed denominator nn with 2n102 \le n \le 10, we count the admissible numerators mm such that 1m<n1 \le m < n and gcd(m,n)=1\gcd(m,n)=1. This count is φ(n)\varphi(n), where φ\varphi is Euler's totient function.

Therefore,

n(B)=n=210φ(n)n(B)=\sum_{n=2}^{10}\varphi(n)

Now compute:

φ(2)=1,φ(3)=2,φ(4)=2,φ(5)=4,φ(6)=2,φ(7)=6,φ(8)=4,φ(9)=6,φ(10)=4\begin{aligned} \varphi(2)&=1, & \varphi(3)&=2, & \varphi(4)&=2, & \varphi(5)&=4,\\ \varphi(6)&=2, & \varphi(7)&=6, & \varphi(8)&=4, & \varphi(9)&=6, & \varphi(10)&=4 \end{aligned}

Adding these values,

n(B)=1+2+2+4+2+6+4+6+4=31n(B)=1+2+2+4+2+6+4+6+4=31

Therefore, n(B)=31n(B)=31 and the correct option is A.

Listing the Reduced Fractions

Given: A={1,2,3,,10}A = \{1, 2, 3, \dots, 10\} and B={mn:m,nA,m<n and gcd(m,n)=1}B = \left\{ \frac{m}{n} : m, n \in A, m < n \text{ and } \gcd(m, n) = 1 \right\}.

Find: n(B)n(B).

List the valid fractions for each denominator.

For n=2n=2: (12)\left(\frac{1}{2}\right)

For n=3n=3: (13,23)\left(\frac{1}{3}, \frac{2}{3}\right)

For n=4n=4: (14,34)\left(\frac{1}{4}, \frac{3}{4}\right)

For n=5n=5: (15,25,35,45)\left(\frac{1}{5}, \frac{2}{5}, \frac{3}{5}, \frac{4}{5}\right)

For n=6n=6: (16,56)\left(\frac{1}{6}, \frac{5}{6}\right)

For n=7n=7: (17,27,37,47,57,67)\left(\frac{1}{7}, \frac{2}{7}, \frac{3}{7}, \frac{4}{7}, \frac{5}{7}, \frac{6}{7}\right)

For n=8n=8: (18,38,58,78)\left(\frac{1}{8}, \frac{3}{8}, \frac{5}{8}, \frac{7}{8}\right)

For n=9n=9: (19,29,49,59,79,89)\left(\frac{1}{9}, \frac{2}{9}, \frac{4}{9}, \frac{5}{9}, \frac{7}{9}, \frac{8}{9}\right)

For n=10n=10: (110,310,710,910)\left(\frac{1}{10}, \frac{3}{10}, \frac{7}{10}, \frac{9}{10}\right)

Counting all these valid fractions gives

1+2+2+4+2+6+4+6+4=311+2+2+4+2+6+4+6+4=31

Therefore, n(B)=31n(B)=31, so the correct option is A.

Common mistakes

  • Counting all pairs mm

  • Assuming different pairs can produce the same element of BB after reduction leads to confusion. Since the condition gcd(m,n)=1\gcd(m,n)=1 already makes each fraction reduced, each valid pair gives a distinct element.

  • Starting the count from n=1n=1 is wrong here, because the condition mm

Practice more Sets & Operations questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions