ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let v ⁣:N→Zv\colon\mathbb{N}\to\mathbb{Z} be the additive function defined by v(p)=pv(p)=p for primes pp and v(pα)=p+αv(p^\alpha)=p+\alpha for prime powers pαp^\alpha with α≥2\alpha\geq2. For integers n≥1n\geq1 and b≥2b\geq2, call nn a vv-palindrome in base bb if b∤nb\nmid n, n≠rb(n)n\neq r_b(n), and v(n)=v(rb(n))v(n)=v(r_b(n)), where rb(n)r_b(n) is the integer obtained by reversing the base-bb digits of nn; in base 1010, call it a vv-palindrome. Nonexistence conjecture for prime vv-palindromes. There are no prime vv-palindromes. The claim is motivated by extensive computer calculations and complements known infinite families of composite vv-palindromes; whether any prime examples exist remains open.

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.