Biography:Paul Leyland
From HandWiki
Short description: British number theorist
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 [math]\displaystyle{ x^y + y^x }[/math], 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
- ↑ Richard Crandall and Carl Pomerance (2005), Prime Numbers: A Computational Perspective, Springer
- ↑ "About NFSNET". http://www.nfsnet.org/aboutus.html.
External links
![]() | Original source: https://en.wikipedia.org/wiki/Paul Leyland.
Read more |