ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.