ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime number, and let T(n)T(n) be the Tribonacci sequence defined by T(0)=0T(0)=0, T(1)=T(2)=1T(1)=T(2)=1, and T(n+3)=T(n+2)+T(n+1)+T(n)T(n+3)=T(n+2)+T(n+1)+T(n). Write νp(m)\nu_p(m) for the exponent of pp in a nonzero integer mm, with νp(0)=∞\nu_p(0)=\infty. Rational-center valuation conjecture. There exists a positive integer QQ such that, for every i∈{0,1,…,Q−1}i\in\{0,1,\ldots,Q-1\}, one of the following holds: (C) there exists κi∈Z≥0\kappa_i\in\mathbb Z_{\ge0} such that, for all but finitely many integers n≡i(modQ)n\equiv i\pmod Q, νp(T(n))=κi\nu_p(T(n))=\kappa_i; or (L) there exist ai∈Qa_i\in\mathbb Q, κi∈Z\kappa_i\in\mathbb Z, and μi∈Z>0\mu_i\in\mathbb Z_{>0} satisfying νp(ai−i)≥νp(Q)\nu_p(a_i-i)\ge\nu_p(Q) such that, for all but finitely many integers n≡i(modQ)n\equiv i\pmod Q, νp(T(n))=κi+μiνp(n−ai)\nu_p(T(n))=\kappa_i+\mu_i\nu_p(n-a_i). This is proposed as a possible repair of the preceding conjecture after its failure; no resolution is supplied in the text.

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.