ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let O(t)\mathscr{O}(t) denote the number of possible orderings arising from the biases among congruence classes for kk-indivisible partitions, and let φ(t)\varphi(t) be Euler's totient function. Growth conjecture. As t→∞t\to\infty, we have

O(t)φ(t)=o(t)\frac{\mathscr{O}(t)}{\varphi(t)}=o(t)

and

log⁡t=o(O(t)φ(t)).\log t=o\left(\frac{\mathscr{O}(t)}{\varphi(t)}\right).

Thus the normalized number of orderings is conjectured to grow sublinearly in tt and faster than logarithmically. The claim is motivated by numerical evidence and 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.