benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let S is the set of prime numbers that less or equal to 26. Is there any a₁,a₂,a₃,a₄,a₅,a₆∈N such that gcd(a_(i),a_(j))∈S for 1≤i≠j≤6 and for every element p of S there exists a pa… · Discussion

Discussing Let S is the set of prime numbers that less or equal to 26. Is there any a₁,a₂,a₃,a₄,a₅,a₆∈N such that gcd(a_(i),a_(j))∈S for 1≤i≠j≤6 and for every element p of S there exists a pa… · 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.