<style>button,.story-clue{pointer-events:none}button{opacity:.55}.story-clue{pointer-events:auto}.panel-select{opacity:1}#app-status{display:none}</style>
A MATHEMATICAL ADVENTURE FOR CURIOUS MINDS

A small why. A big adventure.

Follow the story. Try a proof. Let curiosity choose how deep you go.

No account. No API key. Just curiosity.

Two ways in. One table between them.

I'd rather not fight math today

Walk in through the manga: seventeen chapters, sixty-four pocket pebbles, zero required formulas. The Lean source stays behind glass until you ask for it.

Straight to the mathematics

Begin at the proof map — thousands of named theorems — then climb the full ladder from clock inverses to R = T. The story keeps telling itself beside you; it will keep you honest.

Made for company: one reader who loves math and one who does not — one sofa. Whatever each of you finds carries over to the tea salon.

Start with “I don’t know yet.”

Seventeen chapters, one extraordinary argument. One small discovery is enough for today.

17 chapters · MathOriginal source ↗

Pip’s rule: mistakes are clues. Every chapter is open, and every question allows another try.

Powers, smaller problems, and a suspicious parcel.

Choose your depthDefinitions, assumptions, mechanisms.
Explore the whole proof29,511 theorems · original statements · dependencies

Search the local catalogue in English or Japanese. Major landmarks have Japanese titles. Open the full original proof on GitHub for the complete context.

Your discovery in this chapter

Learn why simplifying a hypothetical counterexample must preserve its important properties.

Coprime
The greatest common divisor is 1.
Cancellation
From d·x=d·y and d≠0, infer x=y in this integer setting.
Where the metaphor ends

Packing represents dividing out a common factor. This does not manufacture a solution; it transforms one only under the stated assumption.

</>S_FreyPackage_of_counterexample.lean
Original source ↗ · L17–29Pinned revision aa2d8b3
have ⟨a, b, c, a0, b0, c0, ab, H⟩ :
∃ (a b c : ℤ), a ≠ 0 ∧ b ≠ 0 ∧ c ≠ 0 ∧ Int.gcd a b = 1 ∧ a ^ p + b ^ p = c ^ p := by
obtain ⟨d, a', b', d0, cop, a_eq, b_eq⟩ :=
Int.exists_gcd_one' (Int.gcd_pos_of_ne_zero_left b ha)
simp only [a_eq, mul_pow, b_eq] at H
rw [← add_mul, mul_comm] at H
obtain ⟨c', rfl⟩ := (Int.pow_dvd_pow_iff pp.ne_zero).1 ⟨_, H.symm⟩
rw [mul_pow] at H
have a0' := left_ne_zero_of_mul (a_eq ▸ ha)
have b0' := left_ne_zero_of_mul (b_eq ▸ hb)
have c0' := right_ne_zero_of_mul hc
exact ⟨a', b', c', a0', b0', c0', cop,
mul_left_cancel₀ (pow_ne_zero _ (mod_cast d0.ne')) H⟩

👩🏻‍🎨 Mika · Source reading guide

Write a=d·a′ and b=d·b′ with gcd(a′,b′)=1. The equation implies dᵖ divides cᵖ, hence d divides c. After writing c=d·c′, cancel the nonzero factor dᵖ. Subsequent parts of this file rearrange signs and parity to achieve the Frey normalization.

Annotated original · not a live Lean state

Point to a story clue or a highlighted term to connect the two.

Try this logical move →
Source and verification details

Source: anthropics/fermats-last-theorem @ aa2d8b3. Upstream reports verification; this reader has not independently rebuilt the project. Manga explanations are not formal proofs.

Source license & attribution
Chapter 4/17 · Math

The suitcase diet

Pip packed three umbrellas. The equation packed a common factor.

How we got here

We have narrowed the exponents. Now we simplify the hypothetical numbers without losing the equation. Recall the scale: an operation is useful only when we track what it preserves. Here we must also track common factors.

These links explain the reading route. A story analogy is not a proof of this theorem.

Take it to the tea salon
MIKA
“Strip them — a smaller solution hides underneath. Divide all three, and gcd one comes within reach.”
Divide carefully

Story → proofRemoving ribbons must preserve the contents. The divisibility theorem justifies factoring c as well as a and b.

Justify divisionInt.pow_dvd_pow_iff
MIKA
“And the lighter suitcase still closes tight: the equation survived the cancellation. Tidy evidence only.”
Evidence survives

Story → proofClosing the lighter suitcase means the equation survives cancellation. The common factor must be nonzero to cancel it.

Cancel with evidencemul_left_cancel₀

The idea behind the story

Write a=d·a′ and b=d·b′ with gcd(a′,b′)=1. The equation implies dᵖ divides cᵖ, hence d divides c. After writing c=d·c′, cancel the nonzero factor dᵖ. Subsequent parts of this file rearrange signs and parity to achieve the Frey normalization.

Why establish d≠0?

  • To cancel dᵖ safely.
  • To make every exponent prime.

The story and source are readable here. Enable JavaScript to edit proofs, try quizzes, and explore the interactive map.

The lighter suitcase still carries the equation. Now it gets its official Frey-package seals.

Read. Try. Make it click.

  1. Read the manga and choose Story, Math, or Lean depth.
  2. Open the proof playground. Edit the tactics and watch the goals change.
  3. Select a state, term, or hint. Wrong turns are part of the story.

The playground checks a small propositional language. FLT excerpts are editable reading material, not live-checked Lean proofs. The complete FLT build remains an upstream verification report.

I’m lost · Help

Mika’s help desk

The suitcase diet

One thing at a time

Start with the cake-scale story. You only need to read one small piece at a time. If you are in the Fermat story, start with Story depth, then the words listed before the chapter.

In simpler words

You do not need to know Lean, symbols or university mathematics to begin. Definitions come first in the small stories.

A small clue

Look at the small example before the general formula. Ask what changed and what stayed the same.

Close this panel to return to the exact place you were reading. These are prepared hints for this page.

Start with the first small story →