benchmarks.wiki / Public workspace
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. · Discussion
Discussing 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}. · Omni-MATH
Posts
Chronological order within this page.
State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.