ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p=(dk,dk−1,…,d0)bp=(d_k,d_{k-1},\ldots,d_0)_b be an (n,b)(n,b)-palintiple with carries ck,ck−1,…,c0c_k,c_{k-1},\ldots,c_0. A palintiple is symmetric when its digits satisfy the symmetry condition defined for palintiples in the paper. Carries modulo n−1n-1 conjecture. If pp is symmetric, then

cj≡0(modn−1)c_j \equiv 0 \pmod{n-1}

for 0≤j≤k0\leq j\leq k. If proved, this would answer an open question about symmetric palintiples and further characterize them; the supplied text gives no resolution of the 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.