ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A⊆NA\subseteq \mathbb{N} be a complete sequence, and define the threshold of completeness T(A)T(A) to be the least integer mm such that all n≥mn\geq m are in P(A)={∑n∈Bn:B⊆A finite }P(A) = \left\{\sum_{n\in B}n : B\subseteq A\textrm{ finite }\right\} (the existence of T(A)T(A) is guaranteed by completeness). Is it true that there are infinitely many kk such that T(nk)>T(nk+1)T(n^k)>T(n^{k+1})?

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.