Reversal-multiplication polynomiality conjecture
Statement
Let be a positive integer and let denote its reversal. A pair is polynomial if the multiplication can be performed without carry, and is a palindrome when it equals its reversal. Reversal-multiplication conjecture. If is a palindrome, then is a polynomial pair.
Polynomial pairs are known to produce palindromic products, and the converse is suggested by computations involving the corresponding reversal-multiplication sequence. The conjecture concerns whether every palindromic product arising from reversal multiplication is carry-free.
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.