Riemann Hypothesis in a Play

Curtain rises. A group of people enters in gender-neutral dresses and wearing masks. It is not clear if they are finite or infinite in numbers as they continue to enter. They call themselves theorems. As the first theorem is proved, the clock ticks one and one character removes their mask revealing their identity. The leave the stage and sit in the audience.

A second group of people enters the stage. This group is unmasked and call themselves proof. They sing if Mr. Monologue is real he must be able to prove Riemann hypothesis (RH). But before that he must be able to prove that prime number are infinitely many. Since the infinitude of primes is already been proven. Thus we partially proved that Mr. Monologue is real. This is the n = 1 case of proof by mathematical induction.

Let Mr. Monologue be $\mathbb{R}$
Let
$x$ be in $\mathbb{R}$
We proved that
$x$ is 1
We know that
1 is in $\mathbb{R}$
We also know that
1 is mapped to $P$
Where
$P$ is the set of primes
Let this theorem be $T$
Then
$T$ can be proved in
$n$ ways
If
$n$ is zero
Then
$T$ has no proof. Thus
T is C
Where
C is a conjecture. If
C is false, then
$n$ is negative. If
C is true, then
$n$ is positive

T is C
Until it is proven. Once it is proven. Then
$n$ changes from 0
to positive or negative. Hence
$n$ is evolving. Thus
$n$ is $t$
Where
$t$ is time
But
$n$ is an integer
Thus time is discrete

Since RH is unproven yet,

n will change to plus 1

or minus 1

Thus proviving that Mr. Monologue is real.

Share this:

Leave a comment Cancel reply