关于10的友数必要条件的注记
A note on necessary conditions for a friend of 10
AI总结:
本文针对10是孤立数的民间猜想,推导了10的友数N的多个必要条件,包括其为奇平方数、素因子数量与性质、同余特征、素因子计数不等式及上界,为验证该猜想提供理论支撑。
摘要:
孤立数始终笼罩着神秘色彩。一个民间猜想断言10是孤立数,即它没有友数。在本文中,我们证明:若N是10的友数,则它必为奇平方数,且至少有7个不同的素因子,其中最小的素因子是5。此外,当5^{2a}恰整除N时,存在N的一个素因子p,使得2a+1≡0 (mod f)且5^f≡1 (mod p),其中f是大于1且不超过min{2a+1,p-1}的最小正奇数。另外,N存在素因子p和q(未必不同),满足p≡1 (mod 10)且q≡1 (mod 6)。我们还证明,若费马素数F_k整除N,则N必有一个素因子模2F_k同余于1。若将N表示为N=5^{2a}m²的形式,则m不是无平方因子数。进一步地,我们得到Ω(N)≥2ω(N)+6a-4,且若Ω(m)≤K,则N<5·6^{(2^{K-2a+1}-1)²},其中Ω(n)和ω(n)分别表示整数n的素因子总个数和不同素因子个数。
英文摘要:
Solitary numbers are shrouded with mystery. A folklore conjecture assert that 10 is a solitary number i.e. it has no friends. In this article, we establish that if $N$ is a friend of $10$ then it must be odd square with at least seven distinct prime factors, with $5$ being the least one. Moreover there exists a prime factor $p$ of $N$ such that $2a+1\equiv 0 \pmod f$ and $5^{f}\equiv 1 \pmod p$ where $f$ is the smallest odd positive integer greater than $1$ and less than or equal to $\min\{ 2a+1,p-1\}$, provided $5^{2a}\mid \mid N$. Further, there exist prime factors $p$ and $q$ (not necessarily distinct) of $N$ such that $p\equiv1 \pmod {10}$ and $q\equiv 1\pmod 6$. Besides, we prove that if a Fermat prime $F_k$ divides $N$ then $N$ must have a prime factor congruent to $1$ modulo $2F_k$. Also, if we consider the form of $N$ as $N=5^{2a}m^2$ then $m$ is non square-free. Furthermore, we show that $Ω(N)\geq 2ω(N)+6a-4$ and if $Ω(m)\leq K$ then $N< 5\cdot 6^{(2^{K-2a+1}-1)^2}$ where $Ω(n)$ and $ω(n)$ denote the total number of prime factors and the number of distinct prime factors of the integer $n$ respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。