Proof of Lemma 2, p. 12 — if gcd(q, M) = 1 or gcd(q, M) = M, then M/gcd(q, M) + q ≥ M

Initializing...

Proof of Lemma 2, p. 12 — if gcd(q, M) = 1 or gcd(q, M) = M, then M/gcd(q, M) + q ≥ M · Prove2Me