Card Magic Based in Math

 

I recently viewed a magic card trick on YouTube demonstrated by MLT magic tricks. As with many card tricks, the technique is based on math. The trick is good because it doesn’t require “setting” the deck ahead of time. Also, the trick only requires minimal card manipulation and so it is a good trick for beginning magicians to master.

Rather than describing the set-up and execution of the trick, I recommend readers to the MLT YouTube video. Near the end of the video, he mentions that he knows the trick is based in math; however, he admits he doesn’t know the exact math behind the trick. Watch the video and return here to learn the math basis of the trick. Knowing the math doesn’t help in executing the trick but does allow one to variations of the trick.

Here's an abbreviated description of the trick execution:

Shuffle the deck (standard 52-card deck)
Allow the spectator to shuffle the deck
Split the deck into two equal piles of 26 cards each
Have the spectator choose one of the two piles
Have the spectator split the chosen pile into two smaller of stacks of any size
Have the spectator put aside one of the smaller stacks (we’ll call it the count stack)
The magician picks up the non-chosen pile and spreads out the 26 cards face down
The spectator picks one card from the fanned-out cards
The spectator places the card back on the pile
The magician shuffles the cards (with one minor manipulation
The shuffled pile is placed on top of the small pile of cards (the small pile not set aside)
The magician shuffles the combined pile
The spectator is asked how many cards are in the count stack
The magician counts off that number of cards and reveals the spectator’s card

Here is the math behind the trick:

The deck of cards has the standard 52 cards. When the deck is split, each of the two piles has 26 cards. The spectator choices one of the two piles and splits that pile into two smaller stacks of any size. The size of the stack set aside (we called it the count stack). The number of cards in the count stack will be designated c. Therefore, the number of cards in the stack not set aside, is 26-c.

When the spectator returns the chosen card to the magician, the manipulation forces the card to bottom of the 26-card pile. The magician places this pile on top of the remaining stack. The spectator’s card is in 26^th card from the top.

The final shuffle has the magician pulling the top and bottom cards of the combined stack in pairs (see video for visual description). The result of this final shuffle moves the spectator’s chosen card from the 26^th position to a position closer to the top by the same number of cards in the remaining stack. Earlier we determined this number to be 26-c. So what is the new position of the spectator’s card. We’ll call this position p. Initially, it was at 26. After the final shuffle it moves up 26-c places, so final position is:

p = 26-(26-c) =c

The position of the spectator’s card in the final deck configuration is the same number of cards in the count pile (c).

This blog has other posts related to math-based magic tricks:

Uncle Billy Magic Trick

Red/Black Magic Trick

Dice Magic Trick

Magic Trick with Card and Algebra

Phone Number Fun Based in e

Check out MLT Magic's Amazon page at: MLT Magic Trick's Amazon Page

The Frequency of Prime Numbers – The Prime Number Theorem

 

As we progress through the first twenty natural numbers, there are four prime numbers in the first ten numbers (2, 3, 5, 7) and another four in the next ten numbers (11, 13, 17, 19). So, in these first twenty, we have a relative frequency of 40% prime numbers. After this point, the percentage of prime numbers begins to drop. Under 40, there are 30% prime numbers; under 100, 25% prime. Moving to 1000, there are 168 prime numbers, so the frequency drops to 16.8%.

For centuries, this persistent drop of prime numbers has been known and is termed the Prime Number Theorem (PNT). It states that primes number distribution asymptotically drops. There is a function, called the prime-counting function and uses the expression, π(N), as the number of primes less than or equal to N.

A first approximation of this function is:

π(x) ~ x/ln(x)

A result of this function is that the nth prime number, p_n, can be approximated to:

p_n ~ n*ln(n)

The prime-counting function was also used in a prior post Math Vacation: Counting Prime Numbers (jamesmacmath.blogspot.com).

Euler Characteristic of Polyhedra

 

Leonhard Euler was a Swiss mathematician of the 18^th century. One of his many contributions to mathematics was his polyhedron formula:

V+F-E=2

This formula states there is a fixed relationship between the vertices (V), faces (F), and edges (E) of any solid, convex polyhedron.

Here are examples of the formula for some common, simple shapes:

Tetrahedron
4 vertices
4 faces
6 edges

4+4-6=2

Four-sided pyramid
5 vertices
5 faces
8 edges

5+5-8=2

Cube
8 vertices
6 faces
12 edges

8+6-12=2

The “2” at the end of the equation is also known as the Euler characteristic (Euler characteristic - Wikipedia). In the study of topology, the Euler characteristic of all solid, convex polyhedra is 2. The Euler characteristic of a toroidal polyhedron (a doughnut-like solid with a hole) is 0.