## Access

You are not currently logged in.

Access JSTOR through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article

# Primes at a Glance

R. K. Guy, C. B. Lacampagne and J. L. Selfridge
Mathematics of Computation
Vol. 48, No. 177 (Jan., 1987), pp. 183-202
DOI: 10.2307/2007883
Stable URL: http://www.jstor.org/stable/2007883
Page Count: 20

You can always find the topics here!

Topics: Prime numbers, Mathematical theorems

#### Select the topics that are inaccurate.

Cancel
Preview not available

## Abstract

Let $N = B - L, B \geqslant |L|, \gcd(B, L) = 1, p \mid 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 \mid BL$ and $p < q$ then $p \mid 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.

• 183
• 184
• 185
• 186
• 187
• 188
• 189
• 190
• 191
• 192
• 193
• 194
• 195
• 196
• 197
• 198
• 199
• 200
• 201
• 202