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 pile of n stones sits on a table. A player splits any pile with more than one stone into two…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A pile of n stones sits on a table. A player splits any pile with more than one stone into two…

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 pile of nnn stones sits on a table. A player splits any pile with more than one stone into two smaller piles of sizes aaa and bbb, and scores a×ba \times ba×b points. She repeats this until every pile has one stone. The way she splits is up to her.

  1. Play the game with n=4n = 4n=4 in two different ways and add up the scores. What do you notice?
  1. Prove by strong induction that the total score is always n(n−1)2\dfrac{n(n - 1)}{2}2n(n−1)​, whatever splits are chosen.
  1. What is the total score for a pile of 202020 stones?
  1. Explain the answer by counting pairs of stones: what happens to a pair of stones at the moment they go into different piles?

In (b), the first split produces two piles, and each pile is smaller than nnn.

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). Split 444 into 2+22 + 22+2 (score 444), then each 222 into 1+11 + 11+1 (score 111 each): total 666. Or split 444 into 3+13 + 13+1 (score 333), 333 into 2+12 + 12+1 (score 222), 222 into 1+11 + 11+1 (score 111): total 666. The total is the same.

Step 2. Base case. A pile of 111 stone needs no split. The score is 0=1×020 = \dfrac{1 \times 0}{2}0=21×0​.

Step 3. Hypothesis. Assume every pile of fewer than nnn stones gives the score m(m−1)2\dfrac{m(m - 1)}{2}2m(m−1)​ for its size mmm, whatever the splits.

Step 4. The step. The first split of nnn gives a+b=na + b = na+b=n with a,b≥1a, b \ge 1a,b≥1, and scores ababab. By the hypothesis, the two piles then give a(a−1)2\dfrac{a(a - 1)}{2}2a(a−1)​ and b(b−1)2\dfrac{b(b - 1)}{2}2b(b−1)​. The total is

ab+a2−a+b2−b2=(a+b)2−(a+b)2=n(n−1)2.\displaystyle ab + \dfrac{a^2 - a + b^2 - b}{2} = \dfrac{(a + b)^2 - (a + b)}{2} = \dfrac{n(n - 1)}{2}.ab+2a2−a+b2−b​=2(a+b)2−(a+b)​=2n(n−1)​.

Step 5. Conclusion. By strong induction, the total is always n(n−1)2\dfrac{n(n - 1)}{2}2n(n−1)​.

Step 6. Part (c). 20×192=190\dfrac{20 \times 19}{2} = 190220×19​=190 points.

Step 7. Part (d). A split into aaa and bbb separates exactly ababab pairs of stones. Every pair is separated once, at some split. So the total is the number of pairs, n(n−1)2\dfrac{n(n - 1)}{2}2n(n−1)​.

Answer: 190190190 points.

Log in to save this for later
← All Problems
← The Fibonacci numbers are 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … (here we list each value once…A bacteria count in a culture follows a simple model… →
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

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.