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 student notices that 2⁵ - 2 = 30, 3⁵ - 3 = 240 and 4⁵ - 4 = 1020 are all multiples of 30…
HardMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

A student notices that 2⁵ - 2 = 30, 3⁵ - 3 = 240 and 4⁵ - 4 = 1020 are all multiples of 30…

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 student notices that 25−2=302^5 - 2 = 3025−2=30, 35−3=2403^5 - 3 = 24035−3=240 and 45−4=10204^5 - 4 = 102045−4=1020 are all multiples of 303030. She guesses that 30∣n5−n30 \mid n^5 - n30∣n5−n for every integer nnn.

  1. Prove her guess. Factorise n5−nn^5 - nn5−n first, and treat the primes 222, 333 and 555 one at a time.
  1. Explain why no whole number larger than 303030 divides n5−nn^5 - nn5−n for every integer nnn.

Give the largest whole number that divides n5−nn^5 - nn5−n for all nnn.

Check your answer

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

Need a reminder? The key ideaShowHide

Division algorithm: a=bq+ra = bq + ra=bq+r with 0≤r<b0 \le r < b0≤r<b, and qqq, rrr are unique. If d∣ad \mid ad∣a and d∣bd \mid bd∣b, then d∣ax+byd \mid ax + byd∣ax+by. To prove a fact for every integer, split into cases by the remainder.

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. The claim 30∣n5−n30 \mid n^5 - n30∣n5−n for every integer nnn.

Plan. Factorise, then show that 222, 333 and 555 each divide the product. They share no factor, so their product 303030 divides it.

Step 1. Factorise. n5−n=n(n4−1)=n(n2−1)(n2+1)=(n−1)n(n+1)(n2+1)n^5 - n = n(n^4 - 1) = n(n^2 - 1)(n^2 + 1) = (n - 1)n(n + 1)(n^2 + 1)n5−n=n(n4−1)=n(n2−1)(n2+1)=(n−1)n(n+1)(n2+1).

Step 2. The primes 2 and 3. (n−1)n(n+1)(n - 1)n(n + 1)(n−1)n(n+1) is a product of three consecutive integers. One of them is even and one is a multiple of 333.

Step 3. The prime 5. Write n=5k+rn = 5k + rn=5k+r with r∈{0,1,2,3,4}r \in \{0, 1, 2, 3, 4\}r∈{0,1,2,3,4}.

  • If r=0r = 0r=0, then 5∣n5 \mid n5∣n. If r=1r = 1r=1, then 5∣n−15 \mid n - 15∣n−1. If r=4r = 4r=4, then 5∣n+15 \mid n + 15∣n+1.
  • If r=2r = 2r=2, then n2+1=25k2+20k+5n^2 + 1 = 25k^2 + 20k + 5n2+1=25k2+20k+5, a multiple of 555.
  • If r=3r = 3r=3, then n2+1=25k2+30k+10n^2 + 1 = 25k^2 + 30k + 10n2+1=25k2+30k+10, a multiple of 555.

In every case 555 divides the product.

Step 4. Combine. The primes 222, 333 and 555 all divide n5−nn^5 - nn5−n. By the fundamental theorem their product 303030 divides it too.

Step 5. Nothing larger works. A number that divides n5−nn^5 - nn5−n for every nnn must divide the value at n=2n = 2n=2, which is 25−2=302^5 - 2 = 3025−2=30. So it is at most 303030.

Answer: 30∣n5−n30 \mid n^5 - n30∣n5−n for all integers nnn, and 303030 is the largest such number. Proof complete.

What if? The same method shows 42∣n7−n42 \mid n^7 - n42∣n7−n. Course 2 of the next chapter explains the pattern with Fermat's little theorem.

Log in to save this for later
← All Problems
← Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n…A locker code a is a whole number that leaves remainder 5 when it is divided by 9… →
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 →