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. /Prove that the product abc of the three sides of every Pythagorean triple is a multiple of 60…
AdvancedMathematicsHigh School (11–12)Number TheoryproofNumericalOlympiad

Prove that the product abc of the three sides of every Pythagorean triple is a multiple of 60…

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.

Prove that the product abcabcabc of the three sides of every Pythagorean triple is a multiple of 606060. Use squares modulo 333, modulo 555 and the formula for primitive triples (for the factor 444). Then show that 606060 is the largest number with this property. Give that number and the product abcabcabc for the triple (5,12,13)(5, 12, 13)(5,12,13).

Check your answer

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

Need a reminder? The key ideaShowHide

Every primitive triple is m2−n2m^2 - n^2m2−n2, 2mn2mn2mn, m2+n2m^2 + n^2m2+n2 with m>nm > nm>n coprime and of opposite parity. A triple with leg aaa comes from a factor pair

a2=(c−b)(c+b),\displaystyle a^2 = (c - b)(c + b),a2=(c−b)(c+b),

with both factors of the same parity.

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.

Step 1. Reduce to primitive triples. If (a,b,c)=k(a′,b′,c′)(a, b, c) = k(a', b', c')(a,b,c)=k(a′,b′,c′), then abc=k3a′b′c′abc = k^3 a'b'c'abc=k3a′b′c′. So it is enough to show 60∣a′b′c′60 \mid a'b'c'60∣a′b′c′ for primitive triples.

Step 2. The factor 3. Squares are 000 or 111 modulo 333. If 3∤a3 \nmid a3∤a and 3∤b3 \nmid b3∤b, then c2≡1+1=2c^2 \equiv 1 + 1 = 2c2≡1+1=2, impossible. So 333 divides a leg.

Step 3. The factor 4. In a primitive triple the even leg is 2mn2mn2mn with one of m,nm, nm,n even. So 4∣2mn4 \mid 2mn4∣2mn.

Step 4. The factor 5. Squares are 000, 111, 444 modulo 555. If 555 divides neither leg, then a2+b2a^2 + b^2a2+b2 is 1+1=21 + 1 = 21+1=2, 1+4=01 + 4 = 01+4=0 or 4+4=34 + 4 = 34+4=3. Only 000 is a square remainder, so c2≡0c^2 \equiv 0c2≡0 and 5∣c5 \mid c5∣c. Either way 555 divides one side.

Step 5. Together. 333, 444 and 555 are coprime, so 60∣abc60 \mid abc60∣abc.

Step 6. Best possible. For (3,4,5)(3, 4, 5)(3,4,5) the product is 606060. So no larger number always divides abcabcabc.

Step 7. The example. 5×12×13=780=13×605 \times 12 \times 13 = 780 = 13 \times 605×12×13=780=13×60.

Answer: 606060 is the largest such number, and the product for (5,12,13)(5, 12, 13)(5,12,13) is 780780780. Proof complete.

Log in to save this for later
← All Problems
← A carpenter has a straight piece of length 24 cm for one leg of a right triangle…A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 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 →