Beispiel #1
0
def main():
	total = 0
	getcontext().prec = 102
	for n in range(2, 101):
		if not isSquare(n):
			root = str(Decimal(n).sqrt())
			root = root.replace('.','')
			total += sumStringNumbers(root[:100])
	print total
Beispiel #2
0
def main():
	total = 0
	getcontext().prec = 102
	for n in range(2, 101):
		if not isSquare(n):
			root = str(Decimal(n).sqrt())
			root = root.replace('.','')
			total += sumStringNumbers(root[:100])
	print total
Beispiel #3
0
9 = 7 + 2*1^2
15 = 7 + 2*2^2
21 = 3 + 2*3^2
25 = 7 + 2*3^2
27 = 19 + 2*2^2
33 = 31 + 2*1^2

It turns out that the conjecture was false.

What is the smallest odd composite that cannot be written 
as the sum of a prime and twice a square?
"""
from Helper import isPrime, isSquare

primes = [2]
n = 3

while True:
	if n % 2 == 1 and isPrime(n) == False:
		flag = False
		for i in primes:
			if isSquare((n-i)/2):
				flag = True
				break
		if flag == False:
			print n
			break
	if isPrime(n):
		primes.append(n) 

	n += 1