benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let n>1 be an integer. Find, with proof, all sequences x₁,x₂,…,x_(n−1) of positive integers with the following three properties: (a). ; (b). for all ; (c). given any two indices an…

Problem

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

problem

Let n>1n > 1 be an integer. Find, with proof, all sequences x1,x2,…,xn−1x_1, x_2, \ldots, x_{n-1} of positive integers with the following three properties: (a). ; (b). for all ; (c). given any two indices and (not necessarily distinct) for which , there is an index such that .
Plain-text mathematical notation (without MathML)
Let n>1 be an integer. Find, with proof, all sequences x₁,x₂,…,x_(n−1) of positive integers with the following
three properties:
 (a). ; (b). for all ; (c). given any two indices and (not necessarily distinct)
for which , there is an index such
that .
Original LaTeX notation
Let $n > 1$ be an integer. Find, with proof, all sequences $x_1, x_2, \ldots, x_{n-1}$ of positive integers with the following
three properties:
 (a). ; (b). for all ; (c). given any two indices and (not necessarily distinct)
for which , there is an index such
that .

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

task_id
6ff3d0ff-2b43-5d3f-9d5f-8344734ce264
task_key
test--6ff3d0ff-2b43-5d3f-9d5f-8344734ce264
task_revision_id
1
config / split
/ test

Official source

initial import