from continued_fraction import convergent
from util import digits
def seq():
yield 2
k = 1
while True:
yield 1
yield 2 * k
yield 1
k += 1
con = convergent([1], seq())
top = 100
for i in range(top):
n, d = con.next()
print sum(digits(n))
def minx(D):
if int(D**0.5)**2 == D: return 0
b = root(D)
for x,y in convergent([1], b):
if x**2 - D * y ** 2 == 1:
return x
from util import digits
from continued_fraction import convergent
answer = 0
con = convergent([1], [1,2])
top = 1000
#ignoring the first convergent in this problem
con.next()
for i in range(top):
n, d = con.next()
if len(digits(n)) > len(digits(d)):
answer += 1
print answer
from continued_fraction import convergent
from util import digits
def seq():
yield 2
k = 1
while True:
yield 1
yield 2 * k
yield 1
k += 1
con = convergent([1], seq())
top = 100
for i in range(top):
n,d = con.next()
print sum(digits(n))
from util import digits
from continued_fraction import convergent
answer = 0
con = convergent([1], [1, 2])
top = 1000
# ignoring the first convergent in this problem
con.next()
for i in range(top):
n, d = con.next()
if len(digits(n)) > len(digits(d)):
answer += 1
print answer
