HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A music teacher divides a 360-beat cycle into fractions k/360 for k = 1, 2, …, 359…
HardMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

A music teacher divides a 360-beat cycle into fractions k/360 for k = 1, 2, …, 359…

StemPy LabContributed by StemPy Lab

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 360360360-beat cycle into fractions k360\dfrac{k}{360}360k​ for k=1,2,…,359k = 1, 2, \dots, 359k=1,2,…,359. Count the fractions that are already in lowest terms. Then count the kkk from 111 to 360360360 with gcd⁡(k,360)=4\gcd(k, 360) = 4gcd(k,360)=4. For the second count, write k=4jk = 4jk=4j and ask which condition jjj must meet. Give both counts, and φ(360)\varphi(360)φ(360).

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

φ(n)\varphi(n)φ(n) counts 1≤k≤n1 \le k \le n1≤k≤n with gcd⁡(k,n)=1\gcd(k, n) = 1gcd(k,n)=1. If gcd⁡(a,n)=1\gcd(a, n) = 1gcd(a,n)=1, Euler's theorem gives

aφ(n)≡1(modn),φ(n)=n∏p∣n(1−1p).\displaystyle a^{\varphi(n)} \equiv 1 \pmod n, \qquad \varphi(n) = n\prod_{p \mid n}\left(1 - \tfrac{1}{p}\right).aφ(n)≡1(modn),φ(n)=np∣n∏​(1−p1​).

The worked solution

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. 360=23⋅32⋅5360 = 2^3 \cdot 3^2 \cdot 5360=23⋅32⋅5.

Step 1. Lowest terms. k360\dfrac{k}{360}360k​ is in lowest terms exactly when gcd⁡(k,360)=1\gcd(k, 360) = 1gcd(k,360)=1. Since k=360k = 360k=360 gives gcd⁡=360\gcd = 360gcd=360, counting kkk from 111 to 359359359 is the same as φ(360)\varphi(360)φ(360).

Step 2. The totient. φ(360)=360×12×23×45=96\varphi(360) = 360 \times \tfrac12 \times \tfrac23 \times \tfrac45 = 96φ(360)=360×21​×32​×54​=96.

Step 3. Gcd equal to 4. Write k=4jk = 4jk=4j with 1≤j≤901 \le j \le 901≤j≤90. Then gcd⁡(4j,360)=4gcd⁡(j,90)\gcd(4j, 360) = 4\gcd(j, 90)gcd(4j,360)=4gcd(j,90), which is 444 exactly when gcd⁡(j,90)=1\gcd(j, 90) = 1gcd(j,90)=1.

Step 4. Count. φ(90)=90×12×23×45=24\varphi(90) = 90 \times \tfrac12 \times \tfrac23 \times \tfrac45 = 24φ(90)=90×21​×32​×54​=24.

Check. Every kkk has some gcd⁡(k,360)=d\gcd(k, 360) = dgcd(k,360)=d, and there are φ(360/d)\varphi(360/d)φ(360/d) of them. This is the divisor sum again.

Answer: 969696 fractions in lowest terms, 242424 values of kkk with gcd 444, and φ(360)=96\varphi(360) = 96φ(360)=96.

Log in to save this for later
← All Problems
← A quick primality test says: if aⁿ⁻¹ not≡ 1 pmod n for some a coprime to n, then n is composite…Find the last two digits of 13²⁰²⁶, that is, its remainder on division by 100… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →