Lecture 48 · Performance
Little Fibs
Two cards from their sum
Video in production
This lecture is still face down. Its script is written; filming and animation are under way.
Meanwhile, play the trickWhat you will learn
Perform Little Fibs from an openly known six-card packet and decode any two distinct selections from their sum.
Before this lecture
Nothing. This lecture is a fine place to start.
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.
Introduce known packet and free pair selection
At the table- A=1; K=13
- Choose exactly two distinct cards
Decode and repeat
At the table- Report only the sum
Reveal the numerical preparation
At the table- 1, 2, 3, 5, 8, 13
Prove pair uniqueness by exhaustive table
- 6 choose 2=15 distinct pair totals
Give an exact validated decoder
- Choose largest available value < total
- Check total is valid
Distinguish Fibonacci facts and selection size
- Exactly two cards is information
Locate the actual information inputs
- Known packet + total → pair
Play and retrieve
- 11→3+8; 13→5+8
Companion interactive
Decode a hidden pair from its sum, validate inputs and design collisions.
The trick page is this lecture’s companion: be the spectator, lift the curtain to step through why it works, try the challenge, then learn the handling.
Sources
- Mathematical Card Magic, Chapter 4, Little Fibs, pp. 89–92
- “Little Fibs” (video) · link
How these sources were used
- Original effect; adapted to openly introduced six-card packet, removing stock-control handling. Exact-two-card uniqueness and identity mapping preserved.
- Original-author performance reference, not copied narration.