A Sierpinski number is an odd number – call it k – for which the expression k × 2 n + 1 is not prime. This has to hold for any positive, whole value of n.

HP Prime Python Libraries arith asc char euler gcd iegcd ifactor isprime lcm nextprime nprimes prevprime array array append extend builtins abs all any bin bool bytearray append extend bytes center ...

It's rather small at the moment but hopefully what is there is quick and easy to use. If you are radio-active :-), the more the merrier. Please contribute, fix, enhance with more RF functions and ...

New and increasingly powerful computer chips have allowed prime-number hunters to find increasingly larger primes. Fritzchens Fritz/Flickr The Electronic Frontier Foundation is a civil liberty ...

We have known for millennia that an infinite number of prime numbers, i.e., 2, 3, 5, 7, 11, etc., can be divided by themselves and the number 1 only.