Lecture 54 · Mathematics
Six messages in three cards
Video in production
This lecture is still face down. Its script is written; filming and animation are under way.
Meanwhile, read the outlineWhat you will learn
Encode and decode all six triple permutations with explicit total-order conventions.
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.
Separate a permutation count from a working code
- Reference order + permutation table + direction
- Rank first; suits break ties
- L, M, H belong to this triple
Prove six orders and list all without omission
- 3×2×1=6
- 1 LMH; 2 LHM; 3 MLH
- 4 MHL; 5 HLM; 6 HML
Apply rank-first order and suit tie-break
- 2♣<2♦<Q♠
- 2♦, Q♠,2♣→MHL→4
- A♦, A♠, A♥→LHM→2
Give encoding and decoding as inverse procedures
- Encode: sort→pattern→place
- Decode: rank displayed cards→pattern→number
- Five→J♠,3♥,7♣
Expose disagreement in reference order
- Same row, different convention
- Rank-first: MHL→4
- Suit-first: LMH→1
Integrate offset with anchor without crossing roles
- Anchor supplies suit and starting rank
- Permutation supplies offset
- No rank sum in fixed-anchor decoding
Specify permutation trainer and error feedback
- Six cases per triple
- Accuracy before speed
- Separate role errors from table errors
Retrieve exact conventions and preview variable anchor
- Roles travel with identities
- Sorting a message erases its order
- Next: compute the anchor position
Companion interactive
Planned
Send and read numbers 1–6 using any distinct triple.
The interactive for this lecture is being built and will appear here.
Notes
Written notes for this lecture will appear here.
Sources
- Mathematical Card Magic, Chapter K, pp. 308–309
How these sources were used
- Six-permutation protocol; our rank-first convention is an explicitly stated adaptation of the book’s total order.