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 puzzle book asks for the value of T(n) = 1 × 1! …
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A puzzle book asks for the value of T(n) = 1 × 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.

A puzzle book asks for the value of

T(n)=1×1!+2×2!+3×3!+⋯+n×n!,\displaystyle T(n) = 1 \times 1! + 2 \times 2! + 3 \times 3! + \dots + n \times n!,T(n)=1×1!+2×2!+3×3!+⋯+n×n!,

where n!=1×2×⋯×nn! = 1 \times 2 \times \dots \times nn!=1×2×⋯×n.

  1. Work out T(1)T(1)T(1), T(2)T(2)T(2), T(3)T(3)T(3) and T(4)T(4)T(4). Compare each value with a factorial and write a guess for T(n)T(n)T(n).
  1. Prove your guess by induction for every n≥1n \ge 1n≥1.
  1. Find T(7)T(7)T(7).
  1. Explain in one or two sentences why T(n)+1T(n) + 1T(n)+1 is divisible by every whole number from 111 to n+1n + 1n+1.

The puzzle gives no formula, so the guess must come from your table. Write the step with (k+1)!(k + 1)!(k+1)! taken out as a common factor.

Check your answer

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

Need a reminder? The key ideaShowHide

For a sum S(n)=F(n)S(n) = F(n)S(n)=F(n): S(k+1)=S(k)+termk+1=F(k)+termk+1S(k + 1) = S(k) + \text{term}_{k + 1} = F(k) + \text{term}_{k + 1}S(k+1)=S(k)+termk+1​=F(k)+termk+1​ by the hypothesis, and the algebra must give F(k+1)F(k + 1)F(k+1). For a product, multiply by the next factor. Take out common factors early.

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. Small cases. T(1)=1T(1) = 1T(1)=1, T(2)=1+4=5T(2) = 1 + 4 = 5T(2)=1+4=5, T(3)=5+18=23T(3) = 5 + 18 = 23T(3)=5+18=23, T(4)=23+96=119T(4) = 23 + 96 = 119T(4)=23+96=119. Adding 111 gives 2=2!2 = 2!2=2!, 6=3!6 = 3!6=3!, 24=4!24 = 4!24=4!, 120=5!120 = 5!120=5!. We guess T(n)=(n+1)!−1T(n) = (n + 1)! - 1T(n)=(n+1)!−1.

Step 2. Base case. T(1)=1=2!−1T(1) = 1 = 2! - 1T(1)=1=2!−1. True.

Step 3. Hypothesis. Assume T(k)=(k+1)!−1T(k) = (k + 1)! - 1T(k)=(k+1)!−1.

Step 4. The step. T(k+1)=(k+1)!−1+(k+1)(k+1)!=(k+1)! (1+k+1)−1=(k+2)!−1T(k + 1) = (k + 1)! - 1 + (k + 1)(k + 1)! = (k + 1)!\,(1 + k + 1) - 1 = (k + 2)! - 1T(k+1)=(k+1)!−1+(k+1)(k+1)!=(k+1)!(1+k+1)−1=(k+2)!−1. This is the guess with n=k+1n = k + 1n=k+1. By induction it holds for every n≥1n \ge 1n≥1.

Step 5. Part (c). T(7)=8!−1=40320−1=40319T(7) = 8! - 1 = 40320 - 1 = 40319T(7)=8!−1=40320−1=40319.

Step 6. Part (d). T(n)+1=(n+1)!T(n) + 1 = (n + 1)!T(n)+1=(n+1)!, and (n+1)!(n + 1)!(n+1)! is the product 1×2×⋯×(n+1)1 \times 2 \times \dots \times (n + 1)1×2×⋯×(n+1). So each of those numbers divides it.

Check. The program prints T(n)T(n)T(n) next to (n+1)!−1(n + 1)! - 1(n+1)!−1 for n=1n = 1n=1 to 888.

Answer: T(n)=(n+1)!−1T(n) = (n + 1)! - 1T(n)=(n+1)!−1, and T(7)=40319T(7) = 40319T(7)=40319.

Log in to save this for later
← All Problems
← A machine passes a signal through a chain of stages…A clock face has 8 marks, numbered 0 to 7… →
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 →