素数 $v$-回文数的刻画
A characterization of prime $v$-palindromes
AI总结:
本文定义了 $v$-回文数,并证明素数 $v$-回文数恰好是特定形式孪生素数对中的较大者,从而在标准猜想下推出其仅有有限个。
摘要:
对于整数 $n\geq 1$,若其不是 10 的倍数,也不是十进制回文数,且在 $n$ 的素因数分解中,大于 1 的素因子及对应指数之和,等于将 $n$ 的十进制数字反转所得整数的相应和,则称其为 $v$-palindrome。例如,取 198 及其反转 891,它们的素因数分解分别为 $198 = 2\cdot 3^2\cdot 11$ 和 $891 = 3^4\cdot 11$,将各自分解中出现的数字相加均得到 18。这意味着 198 和 891 都是 $v$-palindrome。我们建立了素数 $v$-palindrome 的一个刻画:它们恰好是形式为 $(5 \cdot 10^m - 3, 5 \cdot 10^m - 1)$ 的孪生素数对中较大的那个。因此,关于孪生素数分布的标准猜想意味着素数 $v$-palindrome 只有有限个。
英文摘要:
An integer $n\geq 1$ is a $v$-palindrome if it is not a multiple of $10$, nor a decimal palindrome, and such that the sum of the prime factors and corresponding exponents larger than $1$ in the prime factorization of $n$ is equal to that of the integer formed by reversing the decimal digits of $n$. For example, if we take 198 and its reversal 891, their prime factorizations are $198 = 2\cdot 3^2\cdot 11$ and $891 = 3^4\cdot 11$ respectively, and summing the numbers appearing in each factorization both give 18. This means that $198$ and $891$ are $v$-palindromes. We establish a characterization of prime $v$-palindromes: they are precisely the larger of twin prime pairs of the form $(5 \cdot 10^m - 3, 5 \cdot 10^m - 1)$, and thus standard conjectures on the distribution of twin primes imply that there are only finitely many prime $v$-palindromes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。