The uniqueness conjecture for a v-palindrome equation

Let r(n)r(n) denote the digit reversal of nn in base ten, and let v(n)v(n) be the sum of the primes and exponents appearing in the prime factorization of nn. Uniqueness conjecture for the vv-palindrome equation. The only positive integer nn such that ner10(n)n e r_{10}(n) and n=v(r10(n))n=v(r_{10}(n)) is 4949.

This is the third conjecture restated from the cited short note. The source statement writes r(n)r(n) in the equation, while the surrounding discussion defines digit reversal in base ten; its resolution is not specified.

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.