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. /Two quantities grow with a whole number n: 3ⁿ and n³…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

Two quantities grow with a whole number n: 3ⁿ and 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.

Two quantities grow with a whole number nnn: 3n3^n3n and n3n^3n3. For n=1n = 1n=1 and n=2n = 2n=2 the power is bigger, at n=3n = 3n=3 the two are equal, and from then on the power wins.

  1. Find the smallest n0n_0n0​ such that 3n>n33^n > n^33n>n3 for every n≥n0n \ge n_0n≥n0​. Explain why n0n_0n0​ is not 111, although 31>133^1 > 1^331>13.
  1. Prove by induction that 3n>n33^n > n^33n>n3 for every n≥n0n \ge n_0n≥n0​. In the step you will need 3k3≥(k+1)33k^3 \ge (k + 1)^33k3≥(k+1)3. Show that this holds for every k≥n0k \ge n_0k≥n0​ by writing it as (1+1k)3≤3\left(1 + \dfrac{1}{k}\right)^3 \le 3(1+k1​)3≤3.
  1. Work out 3n0−n033^{n_0} - n_0^33n0​−n03​.

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). 31=3>13^1 = 3 > 131=3>1, 32=9>83^2 = 9 > 832=9>8, but 33=27=273^3 = 27 = 2733=27=27, so the strict inequality fails at n=3n = 3n=3. "For every n≥n0n \ge n_0n≥n0​" must include no failure, so n0≥4n_0 \ge 4n0​≥4. At n=4n = 4n=4: 81>6481 > 6481>64. So n0=4n_0 = 4n0​=4.

Step 2. Base case. 34=81>64=433^4 = 81 > 64 = 4^334=81>64=43.

Step 3. Hypothesis. Assume 3k>k33^k > k^33k>k3 for some k≥4k \ge 4k≥4.

Step 4. The step. 3k+1=3×3k>3k33^{k + 1} = 3 \times 3^k > 3k^33k+1=3×3k>3k3. We need 3k3≥(k+1)33k^3 \ge (k + 1)^33k3≥(k+1)3, that is (1+1k)3≤3\left(1 + \dfrac{1}{k}\right)^3 \le 3(1+k1​)3≤3. For k≥4k \ge 4k≥4 the left side is at most (54)3=12564<2<3\left(\dfrac{5}{4}\right)^3 = \dfrac{125}{64} < 2 < 3(45​)3=64125​<2<3. So 3k+1>(k+1)33^{k + 1} > (k + 1)^33k+1>(k+1)3.

Step 5. Conclusion. By induction, 3n>n33^n > n^33n>n3 for every n≥4n \ge 4n≥4.

Step 6. Part (c). 81−64=1781 - 64 = 1781−64=17.

Watch out. The extra fact in the step fails for k=1k = 1k=1, since 23=8>32^3 = 8 > 323=8>3. The base case and the step must fit.

Answer: n0=4n_0 = 4n0​=4, and 34−43=173^4 - 4^3 = 1734−43=17.

Log in to save this for later
← All Problems
← Let f(n) = n⁵ - n for whole numbers n ≥ 1…For a whole number n ≥ 1 let S(n) = 1/(n + 1) + 1/(n + 2) + … + 1/2n,; the sum of n fractions… →
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.