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. /Let f(n) = n⁵ - n for whole numbers n ≥ 1…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

Let f(n) = n⁵ - n for whole numbers n ≥ 1…

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.

Let f(n)=n5−nf(n) = n^5 - nf(n)=n5−n for whole numbers n≥1n \ge 1n≥1.

  1. Work out f(2)f(2)f(2) and f(3)f(3)f(3), and explain why no number larger than their highest common factor can divide every f(n)f(n)f(n).
  1. Prove by induction that 5∣f(n)5 \mid f(n)5∣f(n) for every n≥1n \ge 1n≥1. In the step, expand (k+1)5(k + 1)^5(k+1)5 with the binomial theorem and look at the coefficients 555, 101010, 101010 and 555.
  1. Prove that 6∣f(n)6 \mid f(n)6∣f(n) by writing f(n)=(n3−n)(n2+1)f(n) = (n^3 - n)(n^2 + 1)f(n)=(n3−n)(n2+1) and using a result of this lesson.
  1. State the largest number that divides f(n)f(n)f(n) for every n≥1n \ge 1n≥1, and justify it from (a), (b) and (c).

Name each fact you use about divisors, such as the one that joins 555 and 666 into 303030.

Check your answer

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

Need a reminder? The key ideaShow

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. Part (a). f(2)=32−2=30f(2) = 32 - 2 = 30f(2)=32−2=30 and f(3)=243−3=240f(3) = 243 - 3 = 240f(3)=243−3=240. Their highest common factor is 303030. A number that divides every f(n)f(n)f(n) divides f(2)=30f(2) = 30f(2)=30, so it is at most 303030.

Step 2. Base case for (b). f(1)=0f(1) = 0f(1)=0, and 5∣05 \mid 05∣0.

Step 3. Step for (b). Assume 5∣k5−k5 \mid k^5 - k5∣k5−k. Then

(k+1)5−(k+1)=(k5−k)+5(k4+2k3+2k2+k).\displaystyle (k + 1)^5 - (k + 1) = (k^5 - k) + 5(k^4 + 2k^3 + 2k^2 + k).(k+1)5−(k+1)=(k5−k)+5(k4+2k3+2k2+k).

Both parts are multiples of 555. By induction, 5∣f(n)5 \mid f(n)5∣f(n) for every n≥1n \ge 1n≥1.

Step 4. Part (c). f(n)=n(n4−1)=n(n2−1)(n2+1)=(n3−n)(n2+1)f(n) = n(n^4 - 1) = n(n^2 - 1)(n^2 + 1) = (n^3 - n)(n^2 + 1)f(n)=n(n4−1)=n(n2−1)(n2+1)=(n3−n)(n2+1). The lesson proved 6∣n3−n6 \mid n^3 - n6∣n3−n, so 6∣f(n)6 \mid f(n)6∣f(n).

Step 5. Part (d). 5∣f(n)5 \mid f(n)5∣f(n) and 6∣f(n)6 \mid f(n)6∣f(n), and 555 and 666 share no factor except 111. So 30∣f(n)30 \mid f(n)30∣f(n). With part (a), 303030 is the largest such number.

Answer: 303030.

Log in to save this for later
← All Problems
← A number puzzle says: for every whole number n ≥ 0, the number 11^(n + 2) + 12^(2n + 1) is a…Two quantities grow with a whole number n: 3ⁿ and n³… →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n…Advanced
  2. A designer draws n straight lines across a large sheet, no two parallel and no three through one…Advanced
  3. An L-shaped piece covers three squares: two side by side and one more next to one of them…Advanced
  4. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  5. Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…Advanced
All problems on this topic →
Hide

To prove d∣f(n)d \mid f(n)d∣f(n): check d∣f(n0)d \mid f(n_0)d∣f(n0​), assume d∣f(k)d \mid f(k)d∣f(k), and write f(k+1)=c f(k)+(a clear multiple of d)f(k + 1) = c\,f(k) + (\text{a clear multiple of } d)f(k+1)=cf(k)+(a clear multiple of d). Multiplying f(k)f(k)f(k) by the base of the power and subtracting usually shows the form.