The square-free v-palindrome conjecture in base ten

Let v(n)v(n) denote the sum of the primes and exponents appearing in the prime factorization of nn, and let r10(n)r_{10}(n) be the digit reversal of nn in base ten. A vv-palindrome in base ten is a natural number nn with 10midn10 mid n, ner10(n)n e r_{10}(n), and v(n)=v(r10(n))v(n)=v(r_{10}(n)). Square-free vv-palindrome conjecture. There are infinitely many vv-palindromes nn in base ten such that both nn and r10(n)r_{10}(n) are square-free.

This conjecture asks for an infinite family of vv-palindromes satisfying the additional square-freeness condition; the source does not specify a resolution.

Sources & referencesView supporting material

Primary source

Chris Bispels, Muhammet Boran, Steven J. Miller, Eliel Sosis and Daniel Tsai, “v-Palindromes: An Analogy to the Palindromes”, arXiv:2405.05267 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.