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 games arcade sells tokens worth 4 points and 7 points…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A games arcade sells tokens worth 4 points and 7 points…

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 games arcade sells tokens worth 444 points and 777 points. A prize can be bought only with an exact total.

  1. List every total from 111 to 252525 points that cannot be made with these tokens. Which is the largest?
  1. Prove by strong induction that every total of 181818 points or more can be made. State how many base cases you need, and why.
  1. How many totals cannot be made at all?
  1. Check your answer to (a) with the rule ab−a−bab - a - bab−a−b for two values with no common factor.

Write each base case as a sum of tokens.

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). The totals that can be made up to 252525 are 4,7,8,11,12,14,15,16,18,19,20,21,22,23,24,254, 7, 8, 11, 12, 14, 15, 16, 18, 19, 20, 21, 22, 23, 24, 254,7,8,11,12,14,15,16,18,19,20,21,22,23,24,25. The ones that cannot are 1,2,3,5,6,9,10,13,171, 2, 3, 5, 6, 9, 10, 13, 171,2,3,5,6,9,10,13,17. The largest is 171717.

Step 2. Base cases. The step goes back 444 places, so we need four in a row: 18=4+7+718 = 4 + 7 + 718=4+7+7, 19=4+4+4+719 = 4 + 4 + 4 + 719=4+4+4+7, 20=4×520 = 4 \times 520=4×5, 21=7×321 = 7 \times 321=7×3.

Step 3. The step. Let k+1≥22k + 1 \ge 22k+1≥22 and assume every total from 181818 to kkk can be made. Then k−3≥18k - 3 \ge 18k−3≥18 can be made. Add one token of 444 points.

Step 4. Conclusion. By strong induction, every total of 181818 or more can be made.

Step 5. Part (c). The totals that cannot be made are the nine listed in Step 1.

Step 6. Part (d). 4×7−4−7=174 \times 7 - 4 - 7 = 174×7−4−7=17, as found. The count also matches (4−1)(7−1)2=9\dfrac{(4 - 1)(7 - 1)}{2} = 92(4−1)(7−1)​=9.

Answer: the largest total that cannot be made is 171717 points, and 999 totals cannot be made.

Log in to save this for later
← All Problems
← A student wants to prove that 1 + 1/2³ + 1/3³ + … + 1/n³ < 3/2; for every n ≥ 1…The Fibonacci numbers are 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … (here we list each value once… →
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 →

Strong induction: assume P(n0),…,P(k)P(n_0), \dots, P(k)P(n0​),…,P(k) and prove P(k+1)P(k + 1)P(k+1). A step that goes back rrr places needs rrr base cases. Well-ordering: every non-empty set of positive integers has a least element.