Proof of Lemma 2, p. 11 — for such a divisor p, M/gcd(p, M) + p ≤ 2M/3 · Prove2Me

P

Initializing...

Proof of Lemma 2, p. 11 — for such a divisor p, M/gcd(p, M) + p ≤ 2M/3 · Prove2Me