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…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let S\mathbb{S} is the set of prime numbers that less or equal to 26. Is there any a1,a2,a3,a4,a5,a6∈Na_1, a_2, a_3, a_4, a_5, a_6 \in \mathbb{N} such that gcd(ai,aj)∈Sfor 1≤i≠j≤6 gcd(a_i,a_j) \in \mathbb{S} \qquad \text {for } 1\leq i \ne j \leq 6 and for every element pp of S\mathbb{S} there exists a pair of 1≤k≠l≤6 1\leq k \ne l \leq 6 such that $$s=gcd(a_k,a_l)?$$
Plain-text mathematical notation (without MathML)
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 pair of 1≤k≠l≤6 such that $$s=gcd(a_k,a_l)?$$
Original LaTeX notation
Let $\mathbb{S}$ is the set of prime numbers that less or equal to 26. Is there any $a_1, a_2, a_3, a_4, a_5, a_6 \in \mathbb{N}$ such that $$ gcd(a_i,a_j) \in \mathbb{S} \qquad \text {for }  1\leq i \ne j \leq 6$$ and for every element $p$ of $\mathbb{S}$ there exists a pair of $ 1\leq k \ne l \leq 6$ such that $$s=gcd(a_k,a_l)?$$

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import