Exemplo n.º 1
0
#!/usr/bin/env python
# http://projecteuler.net/index.php?section=problems&id=3
import math
from EulerLibs import MathLibs

answer = 0
for i in MathLibs.factors(600851475143):
	if MathLibs.isPrime(i):
		answer = i
		
print answer
Exemplo n.º 2
0
#!/usr/bin/env python
# http://projecteuler.net/index.php?section=problems&id=27
from EulerLibs import MathLibs

most_primes = { 'a': 1, 'b': 41, 'primes': 40 }

for a in xrange(-999, 1000):
	for b in xrange(-999, 1000):
		n = 0
		prime_count = 0
		while True:
			p = n**2 + (a * n) + b
			if p < 2:
				break
			elif not MathLibs.isPrime(p):
				break
				
			prime_count += 1
			n += 1
			
		values = { 'a': a, 'b': b, 'primes': prime_count }
		
		if values['primes'] > most_primes['primes']:
			most_primes = values
			
answer = most_primes['a'] * most_primes['b']
print answer
Exemplo n.º 3
0
#!/usr/bin/env python
# http://projecteuler.net/index.php?section=problems&id=7
import math
from EulerLibs import MathLibs

primes = 0
answer = 1;
while (primes < 10001):
	answer += 1
	if (MathLibs.isPrime(answer)):
		primes += 1	
	
print answer