ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n≥1n\ge 1 define the tetrahedral numbers

Tn=(n+23)=n(n+1)(n+2)6,T_n=\binom{n+2}{3}=\frac{n(n+1)(n+2)}{6},

the octahedral numbers

On=n(2n2+1)3,O_n=\frac{n(2n^{2}+1)}{3},

and the cubes Cn=n3C_n=n^{3}.

For a set SS of positive integers and an integer k≥1k\ge 1, say that a positive integer NN is a sum of at most kk elements of SS if there exist jj with 1≤j≤k1\le j\le k and elements s1,…,sj∈Ss_1,\dots,s_j\in S, not necessarily distinct, with N=s1+⋯+sjN=s_1+\cdots+s_j.

Each of the following three propositions holds.

  1. Every positive integer is a sum of at most 55 tetrahedral numbers, i.e. for every N∈Z≥1N\in\mathbb{Z}_{\ge 1} there are n1,…,n5∈Z≥0n_1,\dots,n_5\in\mathbb{Z}_{\ge 0} with N=∑i=15TniN=\sum_{i=1}^{5}T_{n_i}, where T0=0T_0=0.

  2. Every positive integer is a sum of at most 77 octahedral numbers, i.e. for every N∈Z≥1N\in\mathbb{Z}_{\ge 1} there are n1,…,n7∈Z≥0n_1,\dots,n_7\in\mathbb{Z}_{\ge 0} with N=∑i=17OniN=\sum_{i=1}^{7}O_{n_i}, where O0=0O_0=0.

  3. Every positive integer is a sum of at most 99 cubes, i.e. for every N∈Z≥1N\in\mathbb{Z}_{\ge 1} there are n1,…,n9∈Z≥0n_1,\dots,n_9\in\mathbb{Z}_{\ge 0} with N=∑i=19ni3N=\sum_{i=1}^{9}n_i^{3}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.