Paper Infomation
Comparison of 4n+1 and 4n-1 Primes
Full Text(PDF, 16KB)
Author: Mi Zhou
Abstract: The famous mathematician Littlewood proposed an unsolved conjecture in number theory, which has two descriptions :1. Before any number in front of K, the number of prime numbers in the form of 4n+1 i s no more than 4n-1; 2. After this number k, the number of prime numbers in the form of 4n-1 is no more than the number of primes in the form of 4n+1. This paper proves that there is a conclusion about this conjecture: 1. There is a critical point K, and the number of 4n+1 primes before any natural number in front of k is not more than 4n-1.2. There is no critical point, the number of 4n+1 primes is never more than 4n-1 primes. One of the two conclusions must be true.
Keywords: Number Theory, p=4n+1, p=4n-1
References:
[1] Unsolved problems in number theory, baidubaike, https://baike.baidu.com/item/%E6%95%B0%E8%AE%BA%E4%B8%AD%E6%9C%AA%E8%A7%A3%E5%86%B3%E7%9A%84%E9%97%AE%E9%A2%98/1583113?fr=aladdin
[2] Littlewood, baidubaike, https://baike.baidu.com/item/%E6%9D%8E%E7%89%B9%E5%B0%94%E4%BC%8D%E5%BE%B7/1490811?fr=aladdin
[3] Prime Race,《American moonthly》, http://www.dms.umontreal.ca/~andrew/PDF/PrimeRace.pdf
[4] Prime Race,《American moonthly》, http://www.dms.umontreal.ca/~andrew/PDF/PrimeRace.pdf
[5] Chandra matrix，baidubaike，https://baike.baidu.com/item/%E9%92%B1%E5%BE%B7%E6%8B%89%E7%AD%9B%E5%AD%90/3724583?fr=aladdin