Main menu Navigation ●Main page ●Contents ●Current events ●Random article ●About Wikipedia ●Contact us ●Donate Contribute ●Help ●Learn to edit ●Community portal ●Recent changes ●Upload file

●Create account ●Log in ●Create account ● Log in Pages for logged out editors learn more ●Contributions ●Talk

(Top) 1 References 2 External links

Paul Leyland

●Deutsch ●Español ●Kreyòl ayisyen ●Português ●Română Edit links ●Article ●Talk ●Read ●Edit ●View history Tools Actions ●Read ●Edit ●View history General ●What links here ●Related changes ●Upload file ●Special pages ●Permanent link ●Page information ●Cite this page ●Get shortened URL ●Download QR code ●Wikidata item Print/export ●Download as PDF ●Printable version Appearance From Wikipedia, the free encyclopedia

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.

[edit]

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