Let and . Then is equal to :
- A
- B
- C
- D
Let and . Then is equal to :
Correct answer:A
Standard Method
Given: and .
Find: .
For each fixed denominator with , we count the admissible numerators such that and . This count is , where is Euler's totient function.
Therefore,
Now compute:
Adding these values,
Therefore, and the correct option is A.
Listing the Reduced Fractions
Given: and .
Find: .
List the valid fractions for each denominator.
For :
For :
For :
For :
For :
For :
For :
For :
For :
Counting all these valid fractions gives
Therefore, , so the correct option is A.
Counting all pairs
Assuming different pairs can produce the same element of after reduction leads to confusion. Since the condition already makes each fraction reduced, each valid pair gives a distinct element.
Starting the count from is wrong here, because the condition
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.