, Volume 11, Issue 2, pp 78–87 | Cite as

The Sierpinski problem

  • Shailesh A. Shirali


In this article, we describe briefly a number-theoretic problem first studied by Sierpiński, now known as theSierpiński problem. The problem remains open.


Sierpiński numbers Fermat numbers Chinese remainder theorem covering set 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Suggested Reading

  1. [1] Scholar
  2. [2] Scholar
  3. [3]
    R Baillie, G Cormack, and H C Williams, The problem of Sierpinski concerningk. 2n + 1’,Math. Comp., Vol. 37, pp. 229–231, 1981.CrossRefGoogle Scholar
  4. [4]
    W Keller, Factors of Fermat numbers and large primes of the formk. 2n + 1,Math. Comp., Vol. 41, pp. 661–673, 1983.CrossRefGoogle Scholar
  5. [5]
    P Ribenboim,The New Book of Prime Number Records, Springer Verlag, 1996.Google Scholar
  6. [6]
    W Sierpinski, Sur un probleme concernant les nombresk. 2n+ 1,Elem. Math., Vol. 15, pp. 73–74, 1960.Google Scholar

Copyright information

© Indian Academy of Sciences 2006

Authors and Affiliations

  • Shailesh A. Shirali
    • 1
  1. 1.Amber Valley Residential SchoolChikmagalur KarnatakaIndia

Personalised recommendations