Math 2.0

Proposition

Ultimate Gilbreath principle

Statement

A theorem called "the ultimate Gilbreath principle" states that, for a permutation π\pi of {1,2,3,…,n}\{1, 2, 3,\dots, n\}, the following four properties are equivalent:

  • π\pi is a Gilbreath permutation.
  • For each jj, the top jj cards π(1),…π(j)\pi(1),\dots \pi(j) are distinct modulo jj.
  • For each jj and kk with kj≤nkj\le n, the jj cards π((k−1)j+1),π((k−1)j+2),…,π(kj)\pi\bigl((k-1)j+1\bigr),\pi\bigl((k-1)j+2\bigr),\dots,\pi(kj) are distinct modulo jj.
  • For each jj, the top jj cards are consecutive in 1,2,…,n1,2,\dots, n.

Further reading

  1. Wikipedia, page 38064572, revision 1348023430, Gilbreath shuffle, section Ultimate Gilbreath principle. adopted
About this page
TagB2DNP2N7WZ
URIm2://B2DNP2N7WZ
Kindstatement, proposition
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status B2DNP2N7WZ.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.