Paul Leyland

From testwiki
Revision as of 07:51, 6 May 2024 by imported>Jevansen (Moving from Category:Number theorists to Category:British number theorists using Cat-a-lot)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:For Template:Use dmy dates 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 xy+yx, 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

Template:Reflist

Template:Authority control


Template:UK-mathematician-stub