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. /Show that n⁵ - n is a multiple of 30 for every integer n…
HardMathematicsHigh School (11–12)Number TheoryproofNumericalOlympiad

Show that n⁵ - n is a multiple of 30 for every integer n…

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.

Show that n5−nn^5 - nn5−n is a multiple of 303030 for every integer nnn. Work with congruences modulo 222, 333 and 555 and try every remainder. Then show that 303030 is the best possible: no larger integer divides n5−nn^5 - nn5−n for every nnn. Give the largest integer that always divides n5−nn^5 - nn5−n, and the value of n5−nn^5 - nn5−n at n=2n = 2n=2.

Check your answer

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

Need a reminder? The key ideaShowHide

a≡b(modm)a \equiv b \pmod ma≡b(modm) means m∣a−bm \mid a - bm∣a−b. Congruences add, subtract, multiply and take powers like equations. A small power congruent to 111 or −1-1−1 cuts a large exponent down:

ak≡1(modm) ⇒ aqk+r≡ar(modm).\displaystyle a^k \equiv 1 \pmod m \ \Rightarrow\ a^{qk + r} \equiv a^r \pmod m.ak≡1(modm) ⇒ aqk+r≡ar(modm).

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. f(n)=n5−nf(n) = n^5 - nf(n)=n5−n for all integers nnn.

Plan. Since 222, 333 and 555 are coprime, it is enough to show that each divides f(n)f(n)f(n).

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

Step 2. Modulo 2 and 3. The product (n−1)n(n+1)(n - 1)n(n + 1)(n−1)n(n+1) of three consecutive integers contains a multiple of 222 and a multiple of 333. So 2∣f(n)2 \mid f(n)2∣f(n) and 3∣f(n)3 \mid f(n)3∣f(n).

Step 3. Modulo 5. If n≡0,1n \equiv 0, 1n≡0,1 or 4(mod5)4 \pmod 54(mod5), one of nnn, n−1n - 1n−1, n+1n + 1n+1 is a multiple of 555. If n≡2n \equiv 2n≡2 or 333, then n2≡4n^2 \equiv 4n2≡4, so n2+1≡0(mod5)n^2 + 1 \equiv 0 \pmod 5n2+1≡0(mod5). Every case gives 5∣f(n)5 \mid f(n)5∣f(n).

Step 4. Combine. 222, 333 and 555 all divide f(n)f(n)f(n) and share no factor, so 30∣f(n)30 \mid f(n)30∣f(n).

Step 5. Best possible. At n=2n = 2n=2 we get 32−2=3032 - 2 = 3032−2=30. Any integer that divides every f(n)f(n)f(n) divides 303030, so no number above 303030 works.

Answer: 303030 always divides n5−nn^5 - nn5−n, the value at n=2n = 2n=2 is 303030, and 303030 is the largest such divisor. Proof complete.

What if? The same method shows that n3−nn^3 - nn3−n is always a multiple of 666, and 6=23−26 = 2^3 - 26=23−2 is best possible.

Log in to save this for later
← All Problems
← A puzzle card asks for two remainders without a calculator…A number theorist wants to prove that no integer of the form 8k + 7 is a sum of three squares of… →
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 →