Shuffle a deck of 4 cards. Ask the participant to remember the bottom card. Move top card to bottom. Flip the first card. Cut (not shuffle) the 4 cards in any way (or not at all). Do a two card flip/swap where the first two cards' positions are swapped and they are also flipped. Flip the first card and move it to the bottom. Move the first card to the bottom. Flip the first card. The "outlier card" that is either flipped or not flipped is the original bottom card. Is there a mathematical theorem/property that can prove or generalize this result? I have checked that it works empirically for 4 cards but wondering if this works only in special cases (for example using only 4 cards with 2 card swap/flips but not in 20 card cases with 6 card swaps/flips). For reference, this youtube video shows the trick: https://www.youtube.com/watch?v=oGEcYkwF6d4&t=272s&ab_channel=NationalMuseumofMathematics
2026-03-29 18:30:24.1774809024
How do you prove mathematically this four card trick?
243 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in PERMUTATIONS
- A weird automorphism
- List Conjugacy Classes in GAP?
- Permutation does not change if we multiply by left by another group element?
- Validating a solution to a combinatorics problem
- Selection of at least one vowel and one consonant
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Probability of a candidate being selected for a job.
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Expected "overlap" between permutations of a multiset
- Selecting balls from infinite sample with certain conditions
Related Questions in CARD-GAMES
- optimal strategy for drawing a deck of cards
- Blackjack basic strategy statistics wanted
- Combinatorics question: Suppose you play a game of cards in which only 5 cards are dealt from a standard 52 deck....
- Three of a kind and a pair on hands bigger than 5
- Card Game Odds In-Between
- Inversions of a Deck of Cards
- 2 detectives card trick
- Interesting Riddle about a Game with Playing Cards
- Does not playing the basic strategy in Blackjack hurt other players at the table?
- Why is this line of reasoning not correct?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
It can be extended to more cards.
It relies on the following fact: If you have a pile of cards that alternate face down and face up, flipping over two adjacent cards as a unit will not affect the face up/face down arrangement. If the pile contains an even number of cards, then you can cut it anywhere and the cards will still alternate, so you can repeatedly cut and flip two cards without affecting that. The only thing that differs is whether it goes DUDUDU.. or UDUDUD... .
The trick first sets up the pile such that the cards alternate except that the chosen card is the wrong way around. With 4 cards this is done by flipping the card that is not adjacent to the chosen card. The cut and flip two procedure will then leave this situation intact, i.e. the cards remain alternating except that the chosen card is the wrong way around. At the end you flip over every other card so that they all face the same way, except that the chosen card is still reversed.