def main():
print reduce(lambda x, y: x * y, [pyprimes.nth_prime(i + 1) for i in xrange(7)])
# Project Euler - Problem 7 # By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. # # What is the 10 001st prime number? # # Darren Brain # [email protected] # 2/28/2016 from pyprimes import nth_prime print(nth_prime(10001))
def test_nth_primes(self):
self.assertEqual(pyprimes.nth_prime(100), PRIMES[-1])
self.assertRaises(ValueError, pyprimes.nth_prime, 0)
self.assertRaises(ValueError, pyprimes.nth_prime, -1)
def convert_to_primes(group: FiveTuple) -> FivePrimes:
return tuple(EnumeratedPrime(index, nth_prime(index)) for index in group)
def test_nth_primes(self):
self.assertEqual(pyprimes.nth_prime(100), PRIMES[-1])
self.assertRaises(ValueError, pyprimes.nth_prime, 0)
self.assertRaises(ValueError, pyprimes.nth_prime, -1)
# https://code.google.com/codejam/contest/6254486/dashboard#s=p2
import sys
import pyprimes
factor_primes = list(pyprimes.primes_below(pyprimes.nth_prime(1e5)))
def log(*messages):
return # silent
for message in messages:
print message,
print
class CoinCandidate(object):
def __init__(self, value):
self.value = value
self.bases = range(2, 10 + 1)
self.base_values = dict((i, int(self.value, i)) for i in self.bases)
self.base_divisors = dict()
self.prime_bases = set()
def is_invalid(self):
return len(self.prime_bases) > 0
def is_valid(self):
# 2 - 10
return len(self.base_divisors) == 9
def is_done(self):
return self.is_valid() or self.is_invalid()
# Problem 7
from pyprimes import nth_prime
print('The solution is %d' % nth_prime(10001))
# Problem 7
# What is the 10 001st prime number?
import pyprimes
print("100001th Prime: %d" %(pyprimes.nth_prime(10001)))
def prime_10001():
return pyprimes.nth_prime(10001)
#! /usr/bin/env python # projecteuler.net # # problem 7 # # What is the 10 001st prime number? import pyprimes x = pyprimes.nth_prime(10001) print(x)
