Vrftsjtryk

Let $g(n)$ be the distance between the $n$th prime and the next.

By elementary means we can see that $g(n)$ is not eventually constant and that $g(n)$ is not strictly monotonic.

Further we know that it isn't eventually monotonic (meaning $g(k) le g(k+1) le g(k+2) le cdots$) by extremely advanced theorems like Zhangs result that some finite gap occurs infinitely often.

It was hinted to me that there is an easier proof though, that doesn't depend extremely advanced results. Could anyone point me to one please?

In brief: You can tweak the linked to argument. All you need in addition is a reasonable bound on the number of consecutive primes that have the same difference. It is not hard to show a bound linear in the difference.

Then proceed as in the linked question, that is show that this leads to an upper bound on the number of primes below a certain threshold that contradicts well-known results.

There it is that the number of primes below $N^2$ is at most linear in $N$. Here it will be that the number of primes below $N^2$ is at most quadratic in $N$. Both are absurd.

In detail:

Let us first show that the number of consecutive primes with difference $d$ is at most $2d$.

A difference $d$ is fixed. Let $p$ be a an auxiliary prime that does not divide $d$, for example the next prime after $d$ (which by Bertrand's postulate is $<2d$).

We show that there can be at most $p+2$ consecutive primes with difference $d$.
Let us consider $p_0, p_0 + d , p_0 + 2d , dots, p_0 + p d, p_0 + (p+1)d$. modulo $p$. We show at least one of these numbers is not prime.

Since $p nmid d$, we get that $p_0, p_0 + d , p_0 + 2d , dots,p_0 + (p-1)d$ covers all congruence classes modulo $p$. Thus in particular one of these is $0$ modulo $p$. This means it is not a prime unless it is equal to $p$ itself. However this is only possible for $p_0$ or $p_0 + d$, as $p < 2d$. In this case, $p_0 + pd$ or $p_0 + (p+1)d$, respectively, is divisible by $p$ too and thus not prime.

Thus we have shown that the difference $d$ can occur at most $p+1$ times successively, and thus if the sequence of differences is not decreasing it can occur at most $p+1$ times in total. Recall that $p+1 le 2d$. So, the difference $d$ occurs at most $2d$ times.

This implies that the size of the $1+ sum_{d=1}^D 2d$-th prime is at least
$2+ sum_{d=1}^D (2d)d$.

Now the former sum is $1 + D(D+1)$ and the latter sum is $2 + frac{D(D+1)(2D+1)}{3}$. This later expression is at least of size $D^3/2$ (leaving very small $D$ aside).

Yet by the prime number theorem we know that there are about $D^3/2/log (D^3/2)$ primes below $D^3/2$. For sufficiently large $D$ this is much larger than $1 + D(D+1)$, and thus yields a contradiction to the $1 + D(D+1)$-th prime being greater than $D^3/2$.