Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your 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.

On the Smallest $k$ Such that All $k \cdot 2^N + 1$ are Composite

G. Jaeschke
Mathematics of Computation
Vol. 40, No. 161 (Jan., 1983), pp. 381-384
DOI: 10.2307/2007382
Stable URL: http://www.jstor.org/stable/2007382
Page Count: 4
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
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.
On the Smallest $k$ Such that All $k \cdot 2^N + 1$ are Composite
Preview not available

Abstract

In this note we present some computational results which restrict the least odd value of $k$ such that $k \cdot 2^n + 1$ is composite for all $n \geqslant 1$ to one of 91 numbers between 3061 and 78557, inclusive. Further, we give the computational results of a relaxed problem and prove for any positive integer $r$ the existence of infinitely many odd integers $k$ such that $k \cdot 2^r + 1$ is prime but $k \cdot 2^v + 1$ is not prime for $v < r$.

Page Thumbnails

  • Thumbnail: Page 
381
    381
  • Thumbnail: Page 
382
    382
  • Thumbnail: Page 
383
    383
  • Thumbnail: Page 
384
    384