Paul Leyland: Difference between revisions
Content deleted Content added
DarkCherry (talk | contribs) Undid revision 1107805370 by DarkCherry (talk) |
|||
| Line 10: | Line 10: | ||
==External links== |
==External links== |
||
*[ |
*[https://www.brnikat.com/ Paul Leyland's home page] |
||
*[http://www.astropalma.com/ Tacande Observatory's home page] |
|||
{{authority control}} |
{{authority control}} |
||
Revision as of 22:50, 21 February 2023
Paul Leyland is a British 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 , 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". Archived from the original on 9 May 2008. Retrieved 9 August 2011.
External links
 | This article about a United Kingdom mathematician is a stub. You can help Wikipedia by expanding it. |