ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be an odd prime. Let a,n,ka,n,k be positive integers with 1≤a≤p−11\le a\le p-1 and 2≤k≤a(p−1)pn−1+12\le k\le a(p-1)p^{n-1}+1. Define ϵk=0\epsilon_k=0 if kk is even and ϵk=1\epsilon_k=1 if kk is odd, and let ⟨k⟩\langle k\rangle be the integer satisfying 0≤⟨k⟩≤p−20\le\langle k\rangle\le p-2 and k≡⟨k⟩(modp−1)k\equiv\langle k\rangle\pmod{p-1}. The diagonal valuation conjecture.

vp(s(apn,apn−k))={n+(n+vp(k))ϵk−1−vp(⌊k2⌋),k≡ϵk(modp−1), +(n+vp(k))ϵk+vp(B2⌊⟨k⟩2⌋),k≢ϵk(modp−1).v_p\bigl(s(ap^n,ap^n-k)\bigr)=\begin{cases}n+(n+v_p(k))\epsilon_k-1-v_p\left(\left\lfloor\frac{k}{2}\right\rfloor\right),&k\equiv\epsilon_k\pmod{p-1},\ +(n+v_p(k))\epsilon_k+v_p\left(B_{2\left\lfloor\frac{\langle k\rangle}{2}\right\rfloor}\right),&k\not\equiv\epsilon_k\pmod{p-1}. \end{cases}

This is the specialization m=nm=n of the preceding conjecture, so it is merged here as a separately stated restatement only because the paper explicitly labels it as another conjecture; the source gives no resolution beyond the cases noted for the preceding conjecture.

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.