ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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.