ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer ii, let gig_i and kik_i denote the two integer sequences defined in the paper, where gig_i is the least integer admitting an ii-layered partition and kik_i is the least ii-layered number. Sequence-equality conjecture.

gi=kig_i=k_i

for every positive integer ii. The conjecture asserts that the least integer with an ii-layered partition is itself the least ii-layered number; the supplied context gives examples for i=5,6,7,8i=5,6,7,8.

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.