ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥1k\geq1 with 7∤k7\nmid k, write k=∑ai7ik=\sum a_i7^i, and let ss satisfy s≡k(mod98)s\equiv k\pmod{98}. For t≥1t\geq1, define

xt=N13(Δ2⋅7t+1,7)−1,yt=N29(Δ2⋅7t+1,7)−1.x_t=N_{13}(\Delta^{2\cdot7^t+1},7)-1,\qquad y_t=N_{29}(\Delta^{2\cdot7^t+1},7)-1.

Base-7 digit conjecture.

N13(Δk,7)=N13(Δs,7)+∑i≥2Xixi,N_{13}(\Delta^k,7)=N_{13}(\Delta^s,7)+\sum_{i\geq2}X_ix_i,

and

N29(Δk,7)=N29(Δs,7)+∑i≥2Yiyi,N_{29}(\Delta^k,7)=N_{29}(\Delta^s,7)+\sum_{i\geq2}Y_iy_i,

where each XiX_i and YiY_i is a linear combination of the base-77 digits aia_i.

These conjectural formulas describe the nilpotency indices through the residue of kk modulo 9898 and its higher base-77 digits; the supplied text gives no resolution evidence.

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.