Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Note

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

COMMENTS

For 6 a), let



x= 1 + n2 .
We have
√ √
√ ( 1 + n2 − n)( 1 + n2 + n)
x=n+ 1+ n2 −n=n+ √
( 1 + n2 + n)
1
=n+ √
( 1 + n2 + n)
and hence
1
x=n+ .
n+x
Iterating this relationship gives
1
x=n+ 1
n + n + n+x
1
=n+ 1
2n + n+x
1
=n+
2n + 2n+1 1
n+x

and so on.... Hence



1 + n2 = [n, 2n, 2n, 2n, 2n, . . . ].
For 6 b), by Theorem 0.62 of the course notes, we have
xpk + pk−1
f (x) = [a0 , . . . , ak , x] =
xqk + qk−1
where
pj
= [a0 , . . . , aj ].
qj
Hence
Z 1 Z 1
xpk + pk−1
f (x)dx = dx
0 0 xqk + qk−1
Since for any a, b, c, d,
(bc − ad) log cx + d + acx
Z
ax + b
dx =
cx + d c2
1
2 COMMENTS

after some, algebraic manipulations, the above implies


Z 1
pk (−1)k
 
qk
f (x)dx = + log 1 +
0 qk qk2 qk−1

You might also like