This research reveals periodicity in digit sequences related to prime divisors, highlighting new solutions to Prouhet-Tarry-Escott issues.
We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we bound (and, for prime powers, determine) the minimal period.When the condition fails, b(n) supplies new solutions to the Prouhet-Tarry-Escott problem.To analyze this situation we introduce a family of finite-difference identities and use them to evaluate two weighted multivariate polynomial sums, thereby extending identities that arise from the classical sum-of-digits function (N=1).
No takes yet. Share an insight, caveat, or question.
Weihong Ma (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: