The arbitrarily long gaps between v-palindromes conjecture
Statement
Let be an integer. A -palindrome is a number satisfying the paper's definition in base .
Arbitrarily long gaps conjecture. Consecutive positive integers each not a -palindrome in base can be arbitrarily long.
The conjecture is motivated by the example of consecutive positive integers from through that are not -palindromes in base ten. Its status is not resolved in the supplied text.
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.