Sheldon Conjecture

Theorem

There is only $1$ Sheldon prime, and that is $73$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Historical Note

The Sheldon Conjecture was expounded by the fictional physicist Sheldon Cooper, who expounded upon the properties of the number $73$ in (fittingly) episode $73$ of The Big Bang Theory, by Lee Aronsohn, Jim Reynolds and Maria Ferrari:

Sheldon Cooper:

$73$ is the best number:

$73$ is the $21$st prime number.

Its mirror $37$ is the $12$th prime number.

Its mirror $21$ is the product of multiplying, hang on to your hats, $7$ by $3$.

Eh? Eh? Did I lie?

Leonard Hofstadter:

We get it. $73$ is the Chuck Norris of numbers.

Sheldon Cooper:

Chuck Norris wishes.

In binary, $73$ is a palindrome: $1,001,001$, which backwards is $1,001,001$, exactly the same.

All Chuck Norris backwards gets you is Sirron Kcuhc!

The unspoken implication of this statement was that $73$ was the only (prime) number to have this property.

The question was settled by Carl Pomerance and Chris Spicer in $2019$, who proved that the Sheldon Conjecture is indeed true, thereby turning it into a theorem.

However, as of time of writing (May $2019$), this result is still referred to as the Sheldon Conjecture.

Sources

• Jan. 2019: Carl Pomerance and Chris Spicer: Proof of the Sheldon Conjecture (Amer. Math. Monthly Vol. 121, no. 1: pp. 1 – 10)