Web Directory

    Top: Science: Math: Number_Theory: Factoring:

 

Sierpinski Problem

  Link Details for: Sierpinski Problem
Link Title: Sierpinski Problem Open in a new window
Link URL: http://www.prothsearch.net/sierp.html
Link Details: Sierpinski proved there exist infinitely many odd integers k such that k*2^n+1 is composite for every n. Ray Ballinger coordinates a search to prove or disprove whether k=78557 is the smallest solution.
Category: Top : Science : Math : Number_Theory : Factoring
Link Type: Lock this listing - So it can't be removedLock this listing - and upgrade it to FeaturedReport this listingAdd a regular link to the same category
ScreenShot:
Sierpinski Problem