ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bb be an odd integer with b≠2r+1b\neq 2^r+1 for every positive integer rr, let dd be even, and let pp be the smallest prime satisfying p∣(b−1)p\mid(b-1) and p∤dp\nmid d. A bb-anti-Niven dd-AP is an arithmetic progression of integers with common difference dd whose terms are relatively prime to their base-bb digital sums.

Anti-Niven progression conjecture. There exist infinitely many bb-anti-Niven dd-APs of length p−1p-1.

This conjecture generalizes the result for two-term progressions to other even common differences. The paper provides computational motivation, but no resolution is given.

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.