arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.02701math.GM
收藏

10的素因数:对先前界限的推广

Prime Divisors of 10's Friends: A Generalization of Prior Bounds

Indian Institute of Technology Kanpur(坎普尔印度理工学院)

Sagar Mandal

AI总结:

本文研究10的友数的素因数上界,改进了先前对第二、第三和第四小素因数的上界证明。

摘要:

10是数学中最小的正整数,其是否为孤立数或友数仍是一个开放问题。本文为10的友数的每个素因数提供上界。本文是对最近一篇论文[4]的推广,在其中证明了10的友数的第二、第三和第四小素因数的必要上界。此外,本文还为10的友数的第三和第四小素因数建立了比[4]中给出的更优的上界。

英文摘要:

10 is the smallest positive integer which is whether solitary or friendly is still an open question in mathematics. In this paper, we provide upper bounds for each of the prime divisors of a friend of 10. This paper is precisely a generalization of a recent paper [4] in which necessary upper bounds for the 2nd, 3rd, and 4th smallest prime divisors of a friend of 10 have been proved. Further, we establish better upper bounds for the 3rd, and 4th smallest prime divisors of a friend of 10 than the bounds given in [4].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑