ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer k≥1k \ge 1 and an integer s≥1s \ge 1, call a positive integer nn ss-representable in kk-th powers if there exist non-negative integers x1,…,xsx_1,\dots,x_s with

n=x1k+x2k+⋯+xsk.n = x_1^{k} + x_2^{k} + \dots + x_s^{k}.

Let g(k)g(k) be the least ss such that every positive integer is ss-representable in kk-th powers, and let G(k)G(k) be the least ss such that all but finitely many positive integers are ss-representable in kk-th powers; both quantities are finite for every k≥1k \ge 1, and G(k)≤g(k)G(k) \le g(k).

For k≥1k \ge 1 define qq and rr by the Euclidean division

3k=2kq+r,0≤r<2k,3^{k} = 2^{k} q + r, \qquad 0 \le r < 2^{k},

so that q=⌊(3/2)k⌋q = \lfloor (3/2)^{k} \rfloor and r=2k{(3/2)k}r = 2^{k}\{(3/2)^{k}\}, where ⌊x⌋\lfloor x \rfloor and {x}\{x\} denote the integral and fractional parts of xx.

Then:

  1. For every integer k≥1k \ge 1,
q+r≤2k,q + r \le 2^{k},

and consequently

g(k)=2k+⌊(3/2)k⌋−2.g(k) = 2^{k} + \left\lfloor (3/2)^{k} \right\rfloor - 2 .
  1. G(3)=4G(3) = 4; that is, every sufficiently large positive integer is a sum of four cubes of non-negative integers.

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.