Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let $A=\{1,2,3, \ldots, 10\}$ and $B=\left\{\frac{m}{n}: m, n \in A, m< n\right.$ and $\left.\operatorname{gcd}(m, n)=1\right\}$. Then $n(B)$ is equal to :
Step 1: For each denominator n from 2 through 10, the allowed numerators m are the positive integers below n and coprime to n. Their counts are φ(n).
Step 2: The counts for n=2,3,4,5,6,7,8,9,10 are 1,2,2,4,2,6,4,6,4.
Step 3: Their sum is 31, option B.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.