Magic & Math with Cards

Lecture 36 · Mathematics

How much freedom does one riffle allow?

Video in production

This lecture is still face down. Its script is written; filming and animation are under way.

Meanwhile, read the outline

What you will learn

Count distinct Gilbreath permutations and distinguish operation histories, compositions and sampling distributions.

Before this lecture

In this lecture

An outline of the lecture, scene by scene, with the statements that appear on screen. It follows the draft script, so details may change in production.

  1. Pose distinct-output counting

    • Four cards: 8 Gilbreath orders, 24 total

  2. Prove endpoint bijection

    • N − 1 distinct binary choices

  3. Compare counts

    • G(N) = 2^(N−1)
    • 8 cards: 128 / 40320 = 1/315

  4. Separate descriptions from outputs

    • Descriptions: 2^N
    • Distinct outputs: 2^(N−1)

  5. Break the guarantee with a second operation

    • RBRB → BRRB → RRBB

  6. Compute finite reachable sets

    • Final deck list: p(q(i))
    • Finite enumeration, not a general two-step formula

  7. Separate possibility from probability

    • Allowed outcomes ≠ probability distribution

  8. Play and retrieve

    • The final singleton is not a binary choice

Companion interactive

Planned

Generate distinct outputs once, find duplicate descriptions and break the one-shuffle colour guarantee with two operations.

The interactive for this lecture is being built and will appear here.

Notes

Written notes for this lecture will appear here.

Sources

How these sources were used
  • Persi Diaconis and Ron Graham, Magical Mathematics: Endpoint argument gives 2^(N−1); explicit uniqueness proof and finite two-operation enumeration added.