Play ProofQuest

Induction Ida

MATHEMATICAL INDUCTION

Loading audio…

Press play to listen along. The line being read lights up as you go.

Show full transcript

Loading transcript…

01 Opening
Induction Ida beat 1 of 5

Once a year, in the town of Lattice — which is in the kingdom's southern hill region, three days' walk from the capital — the locals hold a festival called the Cascade.

The Cascade is one event. It lasts about thirty seconds.

What happens during the Cascade is this: every family in Lattice contributes some dominoes. (They are made specially for the festival — wood, painted, slightly heavier than playing dominoes so they tip more cleanly.) The day before the festival, the entire town gathers in the central square and sets up the dominoes. In a long, winding, careful chain. Around the fountain. Along the edges of the stalls. Up the steps of the town hall. Down past the bakery. The chain takes most of an afternoon to lay. The current record (set seven years ago) is one thousand four hundred and twelve pieces.

On the day of the festival, at sunset, the mayor — who has, that year, the official honour — bends down and pushes over the first domino.

02 Induction Ida
Induction Ida beat 2 of 5

Everything else falls on its own.

The crowd cheers. The town puts up bunting. The bakery sells out of festival biscuits. Somebody hugs a stranger. The dominoes are swept up. Plans are made for next year. The whole town goes home.

This is the festival that made Ida the mathematician she became.

Her family — the Latticeford family, six generations of festival-domino-makers — had run the Cascade preparation for as long as anybody could remember. Ida grew up watching her mother set out long curves of dominoes in the town square. She grew up helping. By the age of seven she could lay a hundred dominoes by herself without knocking any of them over while she worked. (This is harder than it sounds. There is a particular knack to setting down the next domino without bumping the last one. You have to not be in a hurry.)

Ida was, at twelve, a careful and capable festival-domino-setter, but she was not yet a mathematician. She did not become a mathematician until the year the chain was nine hundred and fifty pieces long, the year her mother let her push the first domino.

It was a great honour. It was also, for Ida, a great responsibility. She had spent the whole afternoon laying her share of the chain. She had checked it three times. She was, at twelve, the youngest first-pusher in seventeen years.

03 Induction Ida
Induction Ida beat 3 of 5

She bent down at sunset. She pushed the first domino.

It fell into the second. The second fell into the third. The third fell into the fourth.

Ida watched the chain unfold.

What she noticed, in those thirty seconds — and she noticed it with the kind of clarity that twelve-year-olds occasionally get and adults sometimes forget — was that she had only pushed one domino. The other nine hundred and forty-nine had fallen on their own. She had not touched them. She had not been near them. The whole chain — all of them — had toppled because the first one had toppled and because each one was close enough to the next one to knock it down in turn.

She thought, then and there: That is everything I need to know.

She walked home that night humming. (Her sister Sten, who was nine at the time and is now known as Strong-Induction Sten, did not understand why her older sister was humming, but Sten was also nine and had eaten three festival biscuits and did not care.)

04 Induction Ida
Induction Ida beat 4 of 5

Ida wrote down what she had figured out, in her own twelve-year-old handwriting, in a notebook her grandmother had given her. The notebook page said:

"To knock down all the dominoes, you only need to do two things:

1. Knock down the first one.

2. Make sure each domino is close enough to the next one to knock it down too.

That's it. The rest happens by itself."

She did not know yet, that night, that this principle had a name. She did not know that the principle was hundreds of years old. She did not know that mathematicians called it induction and used it to prove things about every natural number. She did not know that, in eight years, she would arrive at the ProofQuest academy and introduce herself by saying "I am the dominoes person," and that the academy master would look up from his notes and say, "Oh good. We have been waiting for you."

05 Closing
Induction Ida beat 5 of 5

She just knew, that night in Lattice, that she had figured out something important.

She has been teaching mathematical induction ever since. She still goes home for the Cascade every year. She no longer pushes the first domino — that honour rotates — but she sets up her share of the chain. She still does not hurry.

And when children come to her class for the first time and ask, nervously, whether the technique called induction is hard, Ida always says the same thing:

"You knock down the first one. You show that each one knocks down the next one. That's all. The rest happens by itself."

She adds, after a small pause:

"It also helps if you don't hurry."

Hear it as an audio drama

A short play starring Induction Ida, from ProofQuest. Different voices, same idea. Listen any time after you read.

Loading audio…

Read the drama script
  1. Narrator: From Spark and Anvil and ProofQuest — this is Ida, in chapter 1 of the ProofQuest cast.
  2. Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
  3. Narrator: Induction Ida is one of the academy's most clever teachers. Her method is the cleanest in mathematics. You prove that the first thing works, and then you prove that each thing makes the next one work — and you've proven all of them, at once, for free.
  4. Narrator: She is a tall mouse-tween. Bright-eyed. Patient with the setup but quick once the chain starts falling. She carries a long line of small wooden dominoes on a tray. When she tips the first one, the rest fall in turn.
  5. Ida: I am Induction Ida. I teach mathematical induction. To prove a claim is true for every positive integer, I prove two things. One: the claim holds for the smallest case. Two: if the claim holds for some case K, it holds for K plus one. Then it holds for all cases — the dominoes fall in turn.
  6. Narrator: Mathematical induction is a proof technique that establishes a statement about all positive integers in two steps. The base case shows the statement is true for the smallest value, usually one or zero. The inductive step shows that if the statement is true for any value K, then it's true for K plus one. Together, these two steps prove the statement for every positive integer.
  7. Ida: My favorite small example: the sum of the first N positive integers equals N times N plus one all over two. The claim says one plus two plus three plus all the way up to N equals N times N plus one over two. I prove the base case first. For N equals one, the left side is one. The right side is one times two over two, which is one. The base case checks.
  8. Ida: Now the inductive step. Assume the formula works for some K. So one plus two plus all the way to K equals K times K plus one over two. I add K plus one to both sides. The left side becomes one plus two plus all the way to K plus one. The right side becomes K times K plus one over two, plus K plus one. Combine the right side over a common denominator. K times K plus one, plus two times K plus one, all over two. Factor. K plus one times K plus two, all over two. That's the formula for K plus one. Done. The dominoes fall.
  9. Ida: Once the base case is proven, and the inductive step is proven, you don't need to check each integer separately. The dominoes do the work. Number one falls. That tips number two. That tips number three. And so on, forever. The claim is proven for every positive integer at once.
  10. Narrator: Ida grew up in a small village near a long pier. Her family were the wood-stackers. Mice who built towers of small kindling logs and showed children how the first push made the whole tower come down.
  11. Ida: By the time I was eight I had noticed something. If you set up the dominoes correctly — first one falls, each one tips the next — you don't have to push each domino. You just push the first one. The chain takes over.
  12. Narrator: She walked to the ProofQuest academy at sixteen. The mentor Qed met her at the door.
  13. Qed: What is mathematical induction?
  14. Ida: Two steps. Prove the base case — the claim holds for the smallest value. Prove the inductive step — if the claim holds for any value K, it holds for K plus one. Together, those two steps prove the claim for every positive integer. The dominoes do the work. You don't have to check each integer separately.
  15. Qed: You are appointed.
  16. Narrator: Ida has been the academy's induction teacher for years. She still carries the line of dominoes. She begins every first-day lesson the same way.
  17. Ida: I am Induction Ida. Base case. Inductive step. Dominoes fall. That is what induction is. When you need to prove a claim for every positive integer at once, induction is usually the cleanest path. Show the first case works. Show each case implies the next. Done — for all of them.
  18. Ida: Base case. Inductive step. Whole chain. Infinite proof for finite work. That's the whole technique. That's what makes induction induction.
  19. Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
  20. Narrator: Spark and Anvil is a 501(c)(3) public charity. Apps stay free forever.
  21. Narrator: Curriculum aligned to Common Core math and discrete math.
  22. Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.

More stories with Induction Ida

Another short audio story about Induction Ida. Open one when you are ready.

Mathematical induction

Loading audio…

Read the script
  1. Narrator: From Spark and Anvil and ProofQuest — this is Induction Ida, in chapter 1 of the ProofQuest cast.
  2. Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
  3. Narrator: Induction Ida grew up in a town that held a festival of a thousand dominoes, all set in one long, winding chain.
  4. Narrator: As a child, she learned to place each piece with perfect patience, ensuring it stood ready to fall into the next.
  5. Induction Ida: I am Induction Ida. I am the dominoes person. My work is about how one thing leads to the next.
  6. Narrator: At age twelve, she was given the honor of pushing the very first domino. In that moment, she understood everything.
  7. Induction Ida: I pushed only one piece. The other nine hundred and forty-nine fell entirely on their own. I never touched them.
  8. Narrator: She realized that to make the whole chain fall, you only need to prove two things are true.
  9. Induction Ida: First, you must prove you can knock down the first one. That is the base case.
  10. Induction Ida: Second, you prove that if any domino falls, it is certain to knock down the next one. That is the inductive step.
  11. Narrator: Years later, she arrived at the ProofQuest academy. Her simple understanding of dominoes was immediately recognized.
  12. Induction Ida: I just told them, "I am the dominoes person." They understood. It was all they needed to hear.
  13. Induction Ida: You knock down the first one. You show that each one knocks down the next. The rest just happens by itself.
  14. Narrator: The base case. The inductive step. That is the whole principle. That's what makes induction work.
  15. Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
  16. Narrator: Apps stay free forever.
  17. Narrator: Curriculum aligned to Common Core math and discrete math.
  18. Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.

The ProofQuest ensemble

Induction Ida is one of the friends in ProofQuest. Each friend shows you one idea by how they act; meet them all and you have the whole subject.

Kids also liked