%0 Generic %1 citeulike:3036278 %A Euler, Leonhard %D 2005 %K Vor1800 available-in-tex-format mathematics number-theory pre1800 %T A most easy method for finding many very large prime numbers %U http://arxiv.org/abs/math/0507401 %X Euler employs the formula naa+1 to give a list of numbers. Thanks to his work on idoneals, he can quickly determine which numbers of this form are composite. He uses n=232 in this paper, which is an idoneal. Normally, of course, it's difficult to know whether large numbers are composite, so this is a useful test. Then after he strikes the composite numbers from the list, he has big prime numbers.

@misc{citeulike:3036278, abstract = {Euler employs the formula naa+1 to give a list of numbers. Thanks to his work on idoneals, he can quickly determine which numbers of this form are composite. He uses n=232 in this paper, which is an idoneal. Normally, of course, it's difficult to know whether large numbers are composite, so this is a useful test. Then after he strikes the composite numbers from the list, he has big prime numbers.}, added-at = {2009-08-02T17:14:35.000+0200}, archiveprefix = {arXiv}, author = {Euler, Leonhard}, biburl = {https://www.bibsonomy.org/bibtex/2feedc8585652124cbcc6f67656c8ad10/rwst}, citeulike-article-id = {3036278}, citeulike-linkout-0 = {http://arxiv.org/abs/math/0507401}, citeulike-linkout-1 = {http://arxiv.org/pdf/math/0507401}, description = {my bookmarks from citeulike}, eprint = {math/0507401}, interhash = {35cc9915e07e5557fb1c695a9e8e0395}, intrahash = {feedc8585652124cbcc6f67656c8ad10}, keywords = {Vor1800 available-in-tex-format mathematics number-theory pre1800}, month = Jul, posted-at = {2008-07-23 08:47:04}, priority = {2}, timestamp = {2009-08-06T10:21:46.000+0200}, title = {A most easy method for finding many very large prime numbers}, url = {http://arxiv.org/abs/math/0507401}, year = 2005 }