benchmarks.wiki / Public workspace
OlympiadBench / 1834 / Find the smallest positive integer n, or show that no such n exists, with…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
question
Find the smallest positive integer , or show that no such exists, with the following property: there are infinitely many distinct -tuples of positive rational numbers such that both
are integers.
Plain-text mathematical notation (without MathML)
Find the smallest positive integer n, or show that 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 that no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ such that both
$$
a_{1}+a_{2}+\cdots+a_{n} \quad \text { and } \quad \frac{1}{a_{1}}+\frac{1}{a_{2}}+\cdots+\frac{1}{a_{n}}
$$
are integers.answer type
Numerical
is multiple answer
false
language
English
question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import