ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥3k\geq 3 and AA be an additive basis of order kk. Does there exist a constant c=c(k)>0c=c(k)>0 such that if r(n)≥clog⁡nr(n)\geq c\log n for all large nn then AA must contain a minimal basis of order kk? (Here r(n)r(n) counts the number of representations of nn as the sum of at most kk elements from AA.)

Record

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.