Paul Leyland: Difference between revisions

Content deleted Content added

Inline

Latest revision as of 06:51, 6 May 2024

Paul Leyland is a British astronomer and number theorist who has studied integer factorization and primality testing.

He has contributed to the factorization of RSA-129, RSA-140, and RSA-155, as well as potential factorial primes as large as 400! + 1. He has also studied Cunningham numbers, Cullen numbers, Woodall numbers, etc., and numbers of the form $x^{y}+y^{x}$ , which are now called Leyland numbers.^[1] He was involved with the NFSNet project to use distributed computing on the Internet from 2005 to 2008.^[2]

References[edit]

^ Richard Crandall and Carl Pomerance (2005), Prime Numbers: A Computational Perspective, Springer
^ "About NFSNET". Archived from the original on 9 May 2008. Retrieved 9 August 2011.

External links[edit]

This article about a United Kingdom mathematician is a stub. You can help Wikipedia by expanding it.

[CP2005-1] Richard Crandall and Carl Pomerance (2005), Prime Numbers: A Computational Perspective, Springer

[2] "About NFSNET". Archived from the original on 9 May 2008. Retrieved 9 August 2011.

[1]

[2]

@@ Line 1: / Line 1: @@
+{{short description|British number theorist}}
-'''Paul Leyland''' is a [[number theory|number theorist]] who has studied [[integer factorization]] and [[primality test]]ing.
+{{for|the rugby league player|Paul Leyland (rugby league)}}
+{{Use dmy dates|date=April 2022}}
+'''Paul Leyland''' is a British [[astronomy|astronomer]] and [[number theory|number theorist]] who has studied [[integer factorization]] and [[primality test]]ing.
+He has contributed to the factorization of [[RSA-129]], [[RSA-140]], and [[RSA-155]], as well as potential [[factorial prime]]s as large as 400! + 1. He has also studied [[Cunningham number]]s, [[Cullen number]]s, [[Woodall number]]s, etc., and numbers of the form <math>x^y + y^x</math>, which are now called [[Leyland number]]s.<ref name="CP2005">{{citation |author=[[Richard Crandall]] and [[Carl Pomerance]] |title=Prime Numbers: A Computational Perspective |publisher=Springer |date=2005}}</ref>  He was involved with the [[NFSNet]] project to use [[distributed computing]] on the [[Internet]] from 2005 to 2008.<ref>{{cite web |title=About NFSNET |url-status= dead |url= http://www.nfsnet.org/aboutus.html |archive-url= https://web.archive.org/web/20080509131653/http://www.nfsnet.org/aboutus.html |archive-date= 9 May 2008 |access-date= 9 August 2011 }}</ref>
-He has contributed to the factorization of [[RSA-129]], [[RSA-140]], and [[RSA-155]].
+==References==
-See also: [[Leyland number]]
+{{Reflist}}
-== External links ==
+==External links==
-*[http://www.leyland.vispa.com/numth/factorization/main.htm Paul Leyland's home page]
+*[https://www.brnikat.com/ Paul Leyland's home page]
+*[http://www.astropalma.com/ Tacande Observatory's home page]
+{{authority control}}
-[[Category:Erdős number 2|Leyland, Paul]]
+{{DEFAULTSORT:Leyland, Paul}}
-{{mathematician-stub}}
+[[Category:Living people]]
+[[Category:Year of birth missing (living people)]]
+[[Category:British number theorists]]
+[[Category:20th-century British mathematicians]]
+[[Category:21st-century British mathematicians]]
+{{UK-mathematician-stub}}