Popular recipes tagged "primes" but not "encryption"

Batch prime generator (Batch)

2017-04-25T11:44:27-07:00

Batch recipe 580789 by Antoni Gual (primes). Revision 3.

Here is a radically differnt approach to generating primes in pure batch that overperforms everything else I have found . The idea comes from an exercise in Knuth's TAOCP Vol 3 page 617.

Prime factors of an integer by Brent algorithm (Python)

2015-05-28T06:47:01-07:00

Python recipe 579049 by Antoni Gual (primes, python).

This recipe uses trial division to get factors below 1 milion then switches to Brent's algorithm to get bigger factors. No fast enough to break a RSA key :)

de Polignac's Formula (Python)

2013-08-10T03:40:02-07:00

Python recipe 578632 by Samuel James Erickson (factorial, n, prime, primes). Revision 4.

Obtains the total number of factors of p in n! for any prime p.

Find the nth prime in python (Python)

2013-01-06T20:23:21-08:00

Python recipe 578403 by Captain DeadBones (primes, prime_generator, prime_number).

This is a nth prime number generator in python that I put together for an article I wrote How To Find Prime Numbers In Python

Genreate x digits prime number in python, version 2 (Python)

2013-01-06T20:27:09-08:00

Python recipe 578405 by Captain DeadBones (primes, prime_generator).

This is a prime number generator in python that I put together for an article I wrote How To Find Prime Numbers In Python. The script will generate a prime number of x digits, where x is less than 15. It might work for larger x, but it will take a while.

Evolutionary Algorithm (Generation of Prime Numbers) (Python)

2011-11-27T06:45:00-08:00

Python recipe 577964 by Alexander James Wallar (algorithm, example, genetic, genetic_algorithm, genetic_algorithms, list, number, of, prime, primelist, primes, theory).

This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.

Parameters:

isPrime --> n: number to check if it is prime allPrimes --> n: size of list of random primes, m: the primes in the list will be between 0 and m

Even faster prime generator (C++)

2011-11-27T21:48:25-08:00

C++ recipe 577966 by Sumudu Fernando (primes, prime_generator).

A very quick (segmented) sieve of Eratosthenes.

Takes ~6s on a midrange machine to hit all 50 847 534 primes less than 1 billion, ending with 999999937

If you want to actually do anything with every prime (beyond counting them), there are three places to add a statement doing whatever is necessary with "lastP" -- one at the top (handles the special case '2'), one in the middle (handles "small" primes which are actually used to sieve), and one at the bottom (handles "large" primes which merely survive sieving).

In principle one can use a function object as parameter to allow generic operations on the primes, so add that if you want more general-purpose code (perhaps I'll do that later)

For higher limits you need to switch to wider types and follow the commented guidelines for the constants. For a fixed limit, changing B_SIZE may affect performance so if needed tune it (profile as you go, of course!). But this will get quite slow if you go to much higher numbers.

primeList (Python)

2011-11-05T23:42:37-07:00

Python recipe 577935 by Alexander James Wallar (list, numbers, prime, primelist, primes, theory). Revision 3.

This module returns all the prime numbers strictly less than n. For this code to print out all of the primes n inclusive, in the range, n+1 must be substituted for n.

Faster prime generator (C++)

2011-10-08T23:26:24-07:00

C++ recipe 577899 by Mathijs Romans (primes, prime_generator).

The sieve of Eratosthenes implemented in C++. I noticed another recipe that could be improved upon, making it faster and a bit prettier.

Fastest way to list all primes below N in python (Python)

2010-07-27T01:57:20-07:00

Python recipe 577331 by robert.william.hanks (fast, fastest, math, numbers, numpy, primes, python). Revision 6.

I was looking for a fast way to list all primes below n, so far i came up to this with the numpy solution the fastest. It does primes up to 10e6 in 15ms in my old machine, and it is capable of reaching 10e9.

A fast & memory-wise prime number generator up to N (Python)

2010-08-13T18:28:00-07:00

Python recipe 577357 by robert.william.hanks (fast, numpy, primes, prime_generator, prime_number, python).

Using python 2.6 & numpy. This code was first posted here

Infinite list of primes! Yay! (Python)

2010-07-20T04:05:00-07:00

Python recipe 577318 by Alejandro Peralta (iterators, numbers, primes).

It's an iterator that returns prime numbers.

Got the idea from here: www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf

Some prime generation algorithms. (Python)

2010-08-06T11:20:34-07:00

Python recipe 577329 by Thomas Lehmann (generation, is_prime, prime, primes). Revision 4.

Basic idea was to see the difference between different prime algorithms in time. Also they are not perfect the output shows that really higher numbers let grow the difference why I have separated this into functions to make it visible. I add this here because I have been missing this very often when I have been searching for algorithms.

The 'is_prime' is a well known way of checkin for a number being prime or not.
The sieve of Erastothenes is simply to strike out multiples of a given value; the primes will remain.
the function 'profile' is a decorator for functions measuring the execution time
Some information are in the comments of the code

Find Prime Numbers in python (Python)

2010-06-12T08:22:40-07:00

Python recipe 577259 by Giannis Fysakis (algorithm, algorithms, primality_testing, prime, primes, prime_generator, prime_number). Revision 2.

The algorithm is based on the idea
that the next larger prime after one prime is the sum of the two smaller previous minus three prime numbers back. For the first five prime numbers 2,3,5,7,11 this pattern is not true also it is not true if the number is a composite number (including of course if the number's square root is integer).

Example trying to find the tenth prime

so lets play with numbers 17(minus 3 from Next,position 7), 19(minus 2 from Next,position 8), 23(minus 1 from Next,position 9) and number Next at position 10 :

hmmm ... if we add 19 and 23 we get 42, but 42 minus 17 equals 25 which isn't a prime :(

In order to correct this we assume that 25 is the next prime number ( temporary holding the tenth position) finally to get the real Next prime number we take 23 + 25 = 48 , we subtract 19 and we get 29 which finally it takes the tenth position ( because it deserves it :P)

Prime, Perfect and Fibonacci Number Widget Class (Python)

2010-05-19T17:02:28-07:00

Python recipe 577229 by AJ. Mayorga (cryptography, numbers, prime, primes). Revision 2.

A class Ive had in my snippets for awhile that can generate prime, perfect and fibonacci sequences as well as check whether or not a supplied value is any of them.

Simple primes generator (Python)

2009-11-04T06:52:06-08:00

Python recipe 576948 by Maxime Fontenier (any, generator, numbers, primes).

Simple prime generator.

I write it as a sample usage of the any function.

Sieve of Eratosthenes (Python)

2008-12-27T11:45:09-08:00

Python recipe 576596 by Louis RIVIERE (algorithms, eratosthenes, math, primes). Revision 3.

Returns primes < n.

Fast prime generator (C++)

2008-11-30T00:40:23-08:00

C++ recipe 576559 by Florian Mayer (primes, prime_generator). Revision 2.

This is the sieve of Eratosthenes implemented in C++.

Prime look up program (Python)

2008-07-26T19:45:12-07:00

Python recipe 576380 by Phil Huffman (algorithm, primes).

Finds the nth prime without using a sieve algorithm.