Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Primes at a glance

Authors: R. K. Guy, C. B. Lacampagne and J. L. Selfridge
Journal: Math. Comp. 48 (1987), 183-202
MSC: Primary 11A41
MathSciNet review: 866108
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $ N = B - L$, $ B \geqslant \vert L\vert$, $ \gcd (B,L) = 1$, $ p\vert BL$ for all primes $ p \leqslant \sqrt N $. Then N is 0, 1 or a prime. Writing N in this form suggests a primality and a squarefreeness test. If we also require that when the prime $ q\vert BL$ and $ p < q$ then $ p\vert BL$, we say that $ B - L$ is a presentation of N. We list all presentations found for any N. We believe our list is complete.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11A41

Retrieve articles in all journals with MSC: 11A41

Additional Information

Article copyright: © Copyright 1987 American Mathematical Society