Threads 0 to 0 of 0

Forum: Prime Sierpinski Project

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 ks such that k*2^n+1 can never be prime. These ks are called prime sierpinski numbers.

  1. Sticky Thread Sticky: Prime Sierpinski Project Guide

    Started by vaughan, 01-22-2006 11:45 AM
    • Replies: 0
    • Views: 4,409
    01-22-2006, 11:45 AM Go to last post

Thread Display Options

Use this control to limit the display of threads to those newer than the specified time frame.

Allows you to choose the data by which the thread list will be sorted.

Order threads in...

Note: when sorting by date, 'descending order' will show the newest results first.

Icon Legend

Contains unread posts
Contains unread posts
Contains no unread posts
Contains no unread posts
More than 15 replies or 150 views
Hot thread with unread posts
More than 15 replies or 150 views
Hot thread with no unread posts
Closed Thread
Thread is closed
Thread Contains a Message Written By You
You have posted in this thread

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts