benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let n≥1 be an integer. What is the maximum number of disjoint pairs of elements of the set {1,2,…,n} such that the sums of the different pairs are different integers not exceeding …

Problem

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

problem

Let n≥1n \geq 1 be an integer. What is the maximum number of disjoint pairs of elements of the set {1,2,…,n}\{ 1,2,\ldots , n \} such that the sums of the different pairs are different integers not exceeding nn?
Plain-text mathematical notation (without MathML)
Let n≥1 be an integer. What is the maximum number of disjoint pairs of elements of the set {1,2,…,n} such that the sums of the different pairs are different integers not exceeding n?
Original LaTeX notation
Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?

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
6f6a039a-1b67-5e30-8916-3c01bf1702a4
task_key
test--6f6a039a-1b67-5e30-8916-3c01bf1702a4
task_revision_id
1
config / split
/ test

Official source

initial import