benchmarks.wiki / Public workspace

Omni-MATH / Let k≥14 be an integer, and let p_(k) be the largest prime number which is strictly less than k. You may assume that p_(k)≥3k/4. Let n be a composite integer. Prove: (a) if … · Discussion

Discussing Let k≥14 be an integer, and let p_(k) be the largest prime number which is strictly less than k. You may assume that p_(k)≥3k/4. Let n be a composite integer. Prove: (a) if … · 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.