ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every integer t≥2t\ge 2 and every strictly increasing tt-tuple of positive integers a1<⋯<ata_1<\cdots<a_t, define a set recursively by A0={a1,…,at}A_0=\{a_1,\ldots,a_t\} and, for each n≥0n\ge 0, adjoining the least positive integer that is neither already in AnA_n nor expressible as a sum of tt distinct elements of AnA_n. The conjecture is that every resulting set A=⋃n≥0AnA=\bigcup_{n\ge 0}A_n is ultimately periodic: there exist integers N≥1N\ge 1 and p≥1p\ge 1 such that, for every integer m≥Nm\ge N, m∈Am\in A if and only if m+p∈Am+p\in A.

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.