enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Simple prime number generator in Python - Stack Overflow

   stackoverflow.com/questions/567222

   randprime(a, b) # Return a random prime number in the range [a, b). primepi(n) # Return the number of prime numbers less than or equal to n. prime(nth) # Return the nth prime, with the primes indexed as prime(1) = 2. The nth prime is approximately n*log(n) and can never be larger than 2**n.

3. How to implement an efficient infinite generator of prime numbers...

   stackoverflow.com/questions/2211990

   In binary format, an integer is a list of 0 s and 1 s, 0 at position i if i is not a prime, 1 if it may be a prime. The requisite infinity is a result of the fact that Python 3 integers are unbounded. container, size = 1 << 2, 3 # we start with 0b100 (from right to left: 0 and 1 are not primes, 2 is. last_prime = 1.

4. python - Generator function for prime numbers - Stack Overflow

   stackoverflow.com/questions/25706885

   Sieve of Eratosthenes: Most efficient prime generator algorithm. Taken from here: Simple Prime Generator in Python - an answer by Eli Bendersky. It marks off all the multiples of 2, 3, 5, 7 and 11. The rest are all prime numbers.

5. Basic prime number generator in Python - Stack Overflow

   stackoverflow.com/questions/29812602

   Here is the standard method of generating primes adapted from the C# version at: Most Elegant Way to Generate Prime Number. def prime_gen(n): primes = [2] # start at 3 because 2 is already in the list. nextPrime = 3. while nextPrime < n: isPrime = True. i = 0. # the optimization here is that you're checking from.

6. Is there a Python library to list primes? - Stack Overflow

   stackoverflow.com/questions/13326673

   SymPy is one choice. It is a Python library for symbolic mathematics. It provides several functions for prime. isprime(n) # Test if n is a prime number (True) or not (False). primerange(a, b) # Generate a list of all prime numbers in the range [a, b). randprime(a, b) # Return a random prime number in the range [a, b). primepi(n) # Return the ...

7. Most elegant way to generate prime numbers - Stack Overflow

   stackoverflow.com/questions/1042902

   Standard Method (Peter Smit, jmservera, Rekreativc) The first prime number is 2. Add this to a list of primes. The next prime is the next number that is not evenly divisible by any number on this list. public static List<int> GeneratePrimesNaive(int n) {. List<int> primes = new List<int>(); primes.Add(2); int nextPrime = 3;

8. java - Prime Number Generator Logic - Stack Overflow

   stackoverflow.com/questions/20435289

   1. To generate prime number simply loop through a given number and check if that number is prime or not. For efficient prime number generation IsPrime method must be very efficient and fast. So here is code to check if given number is prime or not very efficiently. public static boolean IsPrime(int n) {.

9. JavaScript Prime Number Generator - Stack Overflow

   stackoverflow.com/questions/15732370

   for (var y=2; y<x; y++) {. Problem 3: Instead of dividing x by y and comparing to one, you should use the modulo operator: x%y. If the result is zero, then x is not a prime number. Problem 4: You are adding prime numbers inside the inner loop, so you will end up with most numbers multiple times, not just prime numbers once.

10. math - Prime Number Generator in C - Stack Overflow

    stackoverflow.com/questions/37513311

    Prime Number Generator in C. Ask Question Asked 8 years, 4 months ago. Modified 3 years ago. Viewed 9k ...

11. Which is the fastest algorithm to find prime numbers?

    stackoverflow.com/questions/453793

    There is a 100% mathematical test that will check if a number P is prime or composite, called AKS Primality Test. The concept is simple: given a number P, if all the coefficients of (x-1)^P - (x^P-1) are divisible by P, then P is a prime number, otherwise it is a composite number. For instance, given P = 3, would give the polynomial: