Concept:
Counting reduced proper fractions:
- Set A: A = {1, 2, 3, …, 10}.
- Set B: B = {m/n : m,n ∈ A, m < n, gcd(m,n)=1}.
- Key idea: For a fixed denominator n, the number of integers
- 1 ≤ m < n with gcd(m,n)=1 equals φ(n).
- Important terms: Euler's totient function φ(n),
- reduced fraction, distinct fractions.
- Therefore: n(B) = Σn=210 φ(n).
Calculation:
A = {1, 2, ….10}
\mathrm{B}\left{\frac{\mathrm{~m}}{\mathrm{n}}=\mathrm{m}, \mathrm{n} \in \mathrm{~A}, \mathrm{~m}<\mathrm{n}, \operatorname{gcd}(\mathrm{~m}, \mathrm{n})=1\right}
n(B)
\mathrm{n}=2 \quad\left{\frac{1}{2}\right}
⇒ φ(2) = 1
\mathrm{n}=3 \quad\left{\frac{1}{3}, \frac{2}{3}\right}
⇒ φ(3) = 2
\mathrm{n}=4 \quad\left{\frac{1}{4}, \frac{3}{4}\right}
⇒ φ(4) = 2
\mathrm{n}=5 \quad\left{\frac{1}{5}, \frac{2}{5}, \frac{3}{5}, \frac{4}{5}\right}
⇒ φ(5) = 4
\mathrm{n}=6 \quad\left{\frac{1}{6}, \frac{5}{6}\right}
⇒ φ(6) = 2
\mathrm{n}=7 \quad\left{\frac{1}{7}, \frac{2}{7}, \frac{3}{7}, \frac{4}{7}, \frac{5}{7}, \frac{6}{7}\right}
⇒ φ(7) = 6
\mathrm{n}=8 \quad\left{\frac{1}{8}, \frac{3}{8}, \frac{5}{8}, \frac{7}{8}\right}
⇒ φ(8) = 4
\mathrm{n}=9 \quad\left{\frac{1}{9}, \frac{2}{9}, \frac{4}{9}, \frac{5}{9}, \frac{7}{9}, \frac{8}{9}\right}
⇒ φ(9) = 6
\mathrm{n}=10 \quad\left{\frac{1}{10}, \frac{3}{10}, \frac{7}{10}, \frac{9}{10}\right}
⇒ φ(10) = 4
Hence n(B) = 31
∴ n(B) = 31.