Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A music teacher divides a -beat cycle into fractions for . Count the fractions that are already in lowest terms. Then count the from to with . For the second count, write and ask which condition must meet. Give both counts, and .
counts with . If , Euler's theorem gives
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. .
Step 1. Lowest terms. is in lowest terms exactly when . Since gives , counting from to is the same as .
Step 2. The totient. .
Step 3. Gcd equal to 4. Write with . Then , which is exactly when .
Step 4. Count. .
Check. Every has some , and there are of them. This is the divisor sum again.
Answer: fractions in lowest terms, values of with gcd , and .
Log in to join the discussion.
Loading…