benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest positive integer n or show no such n exists, with the following property: there are infinitely many distinct n-tuples of positive rational numbers (a₁,a₂,…,a_(n))…

Problem

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

problem

Find the smallest positive integer nn or show no such nn exists, with the following property: there are infinitely many distinct nn-tuples of positive rational numbers (a1,a2,…,an)(a_1, a_2, \ldots, a_n) such that both a1+a2+…+anand1a1+1a2+…+1ana_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n} are integers.
Plain-text mathematical notation (without MathML)
Find the smallest positive integer n or show no such n exists, with the following property: there are infinitely many distinct n-tuples of positive rational numbers (a₁,a₂,…,a_(n)) such that both
a₁+a₂+…+a_(n) and (1)/(a₁)+(1)/(a₂)+…+(1)/(a_(n))
are integers.
Original LaTeX notation
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both
$$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$
are integers.

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