benchmarks.wiki / Public workspace

Omni-MATH / Find all triples (a,b,c) of distinct positive integers so that there exists a subset S of the positive integers for which for all positive integers n exactly one element of the tri…

Problem

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

problem

Find all triples (a,b,c)(a,b,c) of distinct positive integers so that there exists a subset SS of the positive integers for which for all positive integers nn exactly one element of the triple (an,bn,cn)(an,bn,cn) is in SS.
Plain-text mathematical notation (without MathML)
Find all triples (a,b,c) of distinct positive integers so that there exists a subset S of the positive integers for which for all positive integers n exactly one element of the triple (an,bn,cn) is in S.
Original LaTeX notation
Find all triples $(a,b,c)$ of distinct positive integers so that there exists a subset $S$ of the positive integers for which for all positive integers $n$ exactly one element of the triple $(an,bn,cn)$ is in $S$.

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