期刊文献+

关于孤立数的一些新结果 被引量:6

New Results of Anti-Sociable Numbers
下载PDF
导出
摘要 完全数、相亲数以及孤立数一直是数论研究的一个重要课题.最近,在孤立数方面取得了一些进展,2000年,F.LUCA证明了Fermat数都是孤立数;2005年,乐茂华教授证明了2的方幂都是孤立数,用乐茂华教授的方法给出孤立数的一些新的结果:对于任意含有4w+1(w∈Z)型素因子的正整数n,设p为n的任意一个4w+1(w∈Z)型素因子,则在n2,p2n2,p4n2,p6n2里至少有一个是孤立数,因此可以证明孤立数在完全平方数里有正密度,另外也给出求解确定孤立数的方法. Perfect number, amicable number and anti-sociable numbers are important topics in number theory. Recently, advances have been made in anti-sociable numbers. In 2000, F. LUCA proved that Fermat number are anti-sociable numbers, and in 2005, M.H. LE proved all powers of 2 are anti-sociable numbers. We have used the method of M.H. LE to obtain some new results of the anti-sociable numbers. For every integer n containing prime divisors that are 1 mod 4, let p mod 4 be an arbitrary prime divisor of n. There is at least one anti-sociable number in n^2, p^2n^2, p^4n^2, and p^6n^2. Therefore we can prove that anti-sociable numbers have positive density in perfect square numbers. We also give a method to find the exact anti-sociable numbers.
作者 周斌彬
机构地区 上海大学理学院
出处 《上海大学学报(自然科学版)》 CAS CSCD 北大核心 2008年第4期394-398,共5页 Journal of Shanghai University:Natural Science Edition
关键词 孤立数 同余 相亲数 anti-sociable number congruence amicable number
  • 相关文献

参考文献6

二级参考文献37

  • 1颜松远.2500年研究探寻相亲数(英文)[J].数学进展,2004,33(4):385-400. 被引量:24
  • 2乐茂华.2的方幂是孤立数[J].四川理工学院学报(自然科学版),2005,18(3):1-1. 被引量:16
  • 3华罗庚.数论导引[M].北京:科学出版社,1979.11-12.
  • 4Guy R K. Unsolved problems in number theory [M]. New York: Springer Verlag, 1981.
  • 5Luca F. The anti-social Fermat numbers [J]. Amer Math Monthly, 2000, 107:171-173.
  • 6Battiato S, BorhoW. Are there odd ami cable numbers not divisible by three [J]. Mathematics of Computation, 1988, 50: 633-637.
  • 7Battiato S, Borho W. Breeding amicable numbers in abundance Ⅱ [J].Mathematics of Computation,2000, 235(70): 1329-1333.
  • 8Borho W. On Tha bit ibn Kurrah's formula for amicable numbers [J]. Mathematics of Computation, 1972,118(26): 571-578.
  • 9Borho W. Some large primes and amicable numbers[J]. Mathematics of Computation, 1981, 118(36):303-304.
  • 10Borho W, Hoffmann H. Breeding amicable numbers in abundance [J]. Mathematics of Computation, 1986,173(46): 281-293.

共引文献33

同被引文献41

引证文献6

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部