ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer k≥5k\geq 5, consider Equation (Gk) and let Per(Fk)\mathrm{Per}(F_k) be its set of periods.

Period-set containment conjecture.

Per(Fk)⊂{1,12(3−(−1)k),2k,3k−1}∪{(3k−2)⋅a+(3k−1)⋅b∣gcd⁡(a,b)=1}.\mathrm{Per}(F_k) \subset \left\{1, \frac{1}{2}(3-(-1)^k), 2k, 3k-1\right\} \cup \left\{(3k-2)\cdot a+(3k-1)\cdot b \mid \gcd(a,b)=1\right\}.

The conjecture is motivated by computer simulations for k=5k=5 and k=6k=6, together with the periodicity results established earlier in the paper. It predicts that, beyond the explicitly listed periods, every period is a coprime linear combination of 3k−23k-2 and 3k−13k-1; the general description of Per(Fk)\mathrm{Per}(F_k) 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.