Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1348-1869-8 |
Объём: | 92 страниц |
Масса: | 160 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 xy + yx, which are now called Leyland numbers. He has been involved with the NFSNet project.In 2002 he co-authored a paper with Samuel S. Wagstaff Jr. entitled "MPQS with three large primes" in the Proceedings of the Algorithmic Number Theory Symposium 2002. Since Wagstaff co-authored a paper with Paul Erdos, this means Leyland has an Erdos number of 2.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.