Omni-MATH / For a given integer n≥2, let a₀,a₁,…,a_(n) be integers satisfying 0=a₀<a₁<…<a_(n)=2n−1. Find the smallest possible number of elements in the set {a_(i)+a_(j)∣0≤i≤j≤n}.

Problem

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

For a given integer n≥2, let a₀,a₁,…,a_(n) be integers satisfying 0=a₀<a₁<…<a_(n)=2n−1. Find the smallest possible number of elements in the set {a_(i)+a_(j)∣0≤i≤j≤n}.

For a given integer $n\ge 2$, let $a_0,a_1,\ldots ,a_n$ be integers satisfying $0=a_0<a_1<\ldots <a_n=2n-1$. Find the smallest possible number of elements in the set $\{ a_i+a_j \mid 0\le i \le j \le n \}$.

Discussion

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.

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

task_id

3191ff2a-47ac-5a01-a7b5-c6be16813981

task_key

test--3191ff2a-47ac-5a01-a7b5-c6be16813981

task_revision_id

2

config / split

/ test

Official source

initial import