Wu's divisibility-by-3 conjecture for symmetric concatenations
Statement
Let be the smallest prime obtained by inserting between two copies of a positive-length string of identical decimal digits, or if no such prime exists. A positive integer is a multiple of when it is divisible by .
Wu's divisibility-by-3 conjecture. If is not a multiple of with an even number of digits and , then is a multiple of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.