ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq, kk, pip_i, sis_i, and aija_{ij} define a recursion

⟨s1;a11,a12,…,a1p1:s2;a21,a22,…,a2p2:⋯:sk;ak1,ak2,…,akpk∣0⟩.\langle s_1;a_{11},a_{12},\ldots,a_{1p_1}:s_2;a_{21},a_{22},\ldots,a_{2p_2}:\cdots:s_k;a_{k1},a_{k2},\ldots,a_{kp_k}|0\rangle.

Suppose that k=qk=q, pi=q−1p_i=q-1, and the ceiling function ⌈nq⌉\left\lceil\frac{n}{q}\right\rceil satisfies this recursion. Divisibility and sum conjecture. Then qq does not divide any aija_{ij}, and

q∑i=1ksi=∑i=1k∑j=1piaij.q\sum_{i=1}^k s_i=\sum_{i=1}^k\sum_{j=1}^{p_i}a_{ij}.

The claim is motivated by empirical evidence that the ceiling function ⌈nq⌉\left\lceil\frac{n}{q}\right\rceil solves many such recursions. The source gives no resolution beyond this evidence, so the conjecture remains open.

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.