ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k(m)k(m) be the maximum number of distinct values of gm(n)g_m(n) attained at a fixed endpoint in the paper's construction, and let d(m)d(m) denote the number of positive divisors of mm. Prime-power sharpness conjecture. For every prime power mm, the bound k(m)≤d(m)−1k(m)\leq d(m)-1 is attained: k(m)=d(m)−1k(m)=d(m)-1. The paper notes sharpness for several examples and for prime mm, but leaves the assertion for all prime powers 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.