2) Finite Continued Fractions Flashcards
What is a finite continued fraction
What is a simple finite continued fraction
A finite continued fraction is simple if all its elements are integers.
How are the sequences (pk) and (qk) defined in terms of a sequence (xk) in continued fractions
How can a continued fraction of the form [x0:x1,x2,…,xn,w] be expressed in terms of the sequences (pk) and (qk)
How can a finite continued fraction [x0 :x1,x2,…,xn] be expressed in terms of the sequences (pn) and (qn)
What key properties hold for the sequences (pk) and (qk) in continued fractions
Describe the proof of the key properties of the sequences (pk) and (qk)
For a finite simple continued fraction [x0:x1,…,xn] with associated sequences (pk) and (qk), what is gcd(pk ,qk ) for each k≥0
For each k ≥ 0, we have gcd(pk, qk) = 1
Describe the proof that gcd (pk, qk) = 1for each k ≥0 in a finite simple continued fraction
If the Continued Fraction Algorithm terminates what number does it represent
The Continued Fraction Algorithm terminates for every rational number