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 asks when the factorial n! = 1 × 2 × … × n overtakes the power 3ⁿ for good…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A puzzle asks when the factorial n! = 1 × 2 × … × n overtakes the power 3ⁿ for good…

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 asks when the factorial n!=1×2×⋯×nn! = 1 \times 2 \times \dots \times nn!=1×2×⋯×n overtakes the power 3n3^n3n for good.

  1. Work out n!n!n! and 3n3^n3n for n=5n = 5n=5, 666 and 777. Find the smallest n0n_0n0​ such that n!>3nn! > 3^nn!>3n for every n≥n0n \ge n_0n≥n0​.
  1. Prove by induction that n!>3nn! > 3^nn!>3n for every n≥n0n \ge n_0n≥n0​.
  1. At n=6n = 6n=6 the two numbers are very close. Find the gap 36−6!3^6 - 6!36−6!.
  1. Which values of kkk does the step in (b) need? Is that a stronger or a weaker condition than k≥n0k \ge n_0k≥n0​?

Write the step as a chain of inequalities, and say at each link why it holds.

Check your answer

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

Need a reminder? The key ideaShowHide

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). 5!=120<2435! = 120 < 2435!=120<243. 6!=720<7296! = 720 < 7296!=720<729. 7!=5040>21877! = 5040 > 21877!=5040>2187. Below n=7n = 7n=7 the inequality fails at n=6n = 6n=6 and earlier, so n0=7n_0 = 7n0​=7.

Step 2. Base case. 7!=5040>2187=377! = 5040 > 2187 = 3^77!=5040>2187=37.

Step 3. The step. Assume k!>3kk! > 3^kk!>3k for some k≥7k \ge 7k≥7. Then

(k+1)!=(k+1)×k!>(k+1)×3k≥3×3k=3k+1.\displaystyle (k + 1)! = (k + 1) \times k! > (k + 1) \times 3^k \ge 3 \times 3^k = 3^{k + 1}.(k+1)!=(k+1)×k!>(k+1)×3k≥3×3k=3k+1.

The first link is the hypothesis. The second uses k+1≥3k + 1 \ge 3k+1≥3.

Step 4. Conclusion. By induction, n!>3nn! > 3^nn!>3n for every n≥7n \ge 7n≥7.

Step 5. Part (c). 729−720=9729 - 720 = 9729−720=9.

Step 6. Part (d). The step needs only k+1≥3k + 1 \ge 3k+1≥3, that is k≥2k \ge 2k≥2. This is weaker than k≥7k \ge 7k≥7. The base case decides where the result starts.

Answer: n0=7n_0 = 7n0​=7, and the gap at n=6n = 6n=6 is 999.

Log in to save this for later
← All Problems
← For a whole number n ≥ 1 let S(n) = 1/(n + 1) + 1/(n + 2) + … + 1/2n,; the sum of n fractions…A student wants to prove that 1 + 1/2³ + 1/3³ + … + 1/n³ < 3/2; for every n ≥ 1… →
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 →

An inequality may hold only from some n0n_0n0​ on: check P(n0)P(n_0)P(n0​), then in the step use k≥n0k \ge n_0k≥n0​. Bernoulli: (1+x)n≥1+nx(1 + x)^n \ge 1 + nx(1+x)n≥1+nx for x≥−1x \ge -1x≥−1. If the step fails, try to prove a stronger statement.