benchmarks.wiki / Public workspace

Omni-MATH / For an integer x≥1, let p(x) be the least prime that does not divide x, and define q(x) to be the product of all primes less than p(x). In particular, p(1)=2. For x having p(x)=2, … · Discussion

Discussing For an integer x≥1, let p(x) be the least prime that does not divide x, and define q(x) to be the product of all primes less than p(x). In particular, p(1)=2. For x having p(x)=2, … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.