ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a(n)a(n) be the smallest prime obtained by inserting nn between two copies of a positive-length string of identical decimal digits, or 00 if no such prime exists. A positive integer is a multiple of 1111 when it is divisible by 1111.

Wu's divisibility-by-3 conjecture. If nn is not a multiple of 1111 with an even number of digits and a(n)=0a(n)=0, then nn is a multiple of 33.

This is proposed after the original OEIS conjecture has been shown false. The paper reports computational examples supporting the claim, but the supplied text gives no 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.