| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6415642 | Journal of Number Theory | 2012 | 6 Pages |
Abstract
We describe an algorithm to determine whether or not a given system of congruences is satisfied by Cullen numbers. We use this algorithm to prove that there are infinitely many Cullen numbers which are both Riesel and SierpiÅski. (Such numbers should be discarded if you are searching prime numbers with Prothʼs theorem.)
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Pedro Berrizbeitia, J.G. Fernandes, Marcos J. González, Florian Luca, V. Janitzio MejÃa Huguet,