
For each positive integer n, if the sum of the factors of n is divided by n, then the result is called the abundancy index of n. If the abundancy index of some positive integer m equals the abundancy index of n but m is not equal to n, then m and n are called friends. A positive integer with no friends is called solitary. The smallest positive integer that is not known to have a friend and is not known to be solitary is 10. It is not known if the number 6 has odd friends, that is, if odd perfect numbers exist. In a 2007 article, Nielsen proved that the number of nonidentical prime factors in any odd perfect number is at least 9. A 2015 article by Nielsen, which was more complicated and used a computer program that took months to complete, increased the lower bound from 9 to 10. This work applies methods from Nielsen's 2007 article to show that each friend of 10 has at least 10 nonidentical prime factors. This is a formal write-up of results presented at the Southern Africa Mathematical Sciences Association Conference 2023 at the University of Pretoria.
14 pages, 0 figures, 1 table; minor revision as per journal peer review (paragraphs added to section 5, remarks like "to be presented" at conference updated to remarks like "presented" at conference since the conference has now taken place, file added to supplementary material, "guide to supplementary material" file updated accordingly, acknowledgement of anonymous referee(s) added)
Computer algorithm, friends, Mathematics - Number Theory, Abundancy, Arithmetic functions; related numbers; inversion formulas, abundancy index, solitary numbers, 11A25, 510, 620, Number theory, Prime factors, factor-chain-search scheme, FOS: Mathematics, Number Theory (math.NT), Factorization; primality, Friend of 10, Computer solution of Diophantine equations
Computer algorithm, friends, Mathematics - Number Theory, Abundancy, Arithmetic functions; related numbers; inversion formulas, abundancy index, solitary numbers, 11A25, 510, 620, Number theory, Prime factors, factor-chain-search scheme, FOS: Mathematics, Number Theory (math.NT), Factorization; primality, Friend of 10, Computer solution of Diophantine equations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
