While attending a math puzzle contest, my friend (a math student) asked me to prove that $$\sum_{k=1}^n \frac{1}{k} \notin \mathbb{Z} \quad \forall n \geq 2$$
Being the first time seeing this problem, I came up with a proof that required the following conjecture:
(1) Given a composite number $n \geq 4$, $\exists p$ prime such that $$p < n < 2p$$
My friend told me that this followed directly from Bertrand's Postulate (and it indeed does).
Now Bertrand's postulate, which says that there exists a prime between $n$ and $2n$, has a pretty involved proof. My question is:
Question: Is there a simpler proof of Bertrand's Postulate if we take $n$ to be prime (which is all I need)? If so could someone either provide a reference or proof/sketch for the same? So far I have come up empty...
Thanks for your time.
PS: Here is how I link (1) with Bertrand's Postulate: Define for composite $n \geq 4$ $$p(n) = \max \{p : p \leq n, \quad p \mbox{ prime} \}$$ Suppose (1) is wrong, then for some $n$, we have $$2p(n) \leq n$$ This also means that $\{p(n)+1, \cdots 2p(n)\}$ are all composite. However by Bertrand's Postulate, between $p(n)$ and $2p(n)$, there is a prime $q$. $\Rightarrow\Leftarrow$