Forum: Math

Sub-Forums Threads / Posts  Last Post

  1. The Prime Sierpinski project (PSP) is a mathematical project involved in the search of large prime numbers of a special class called proth numbers. They have the general formula k*2^n+1. We further specialize by searching for numbers where k is prime in k*2^n+1. Further more it has been proven that there exists an infinite number of prime k’s such that k*2^n+1 can never be prime. These k’s are called prime sierpinski numbers.

    Forum Actions:

    Forum Statistics:

    • Threads: 22
    • Posts: 218
  2. To solve the Sierpinski and Riesel problem for base 5.

    Forum Actions:

    Forum Statistics:

    • Threads: 1
    • Posts: 12
  3. Attacking the Sierpinski problem

    Forum Actions:

    Forum Statistics:

    • Threads: 96
    • Posts: 1,538
  4. To solve the Sierpinski and Riesel problem for base 5.

    Forum Actions:

    Forum Statistics:

    • Threads: 3
    • Posts: 28
  5. Wieferich@home is a scientific experiment that uses Internet-connected computers in the Search for next Wieferich and Near-Wieferich primes.

    Forum Actions:

    Forum Statistics:

    • Threads: 11
    • Posts: 252