ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c(n)c(n) be the smallest prime obtained by appending a positive-length string of identical decimal digits to nn, or 00 if no such prime exists.

Wu's divisibility-by-3 conjecture. If c(n)=0c(n)=0, then nn is divisible by 33.

The claim concerns the analogous one-sided digit-concatenation sequence. The supplied text gives no proof or resolution.

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.