Put . Every positive solution satisfies
After reducing , we still have . Here is the continued fraction convergent criterion with its proof. If is reduced and obeys this inequality, it is a strict best approximation of the second kind: for any different with , the assumption would give
a contradiction. Choose consecutive continued fraction convergents with . Their determinant is , their errors alternate in sign, and every integer pair is uniquely . For , either , or have opposite signs: positive would make , negative make , and is impossible. Opposite signs make and have the same sign, so . If , reduction gives the th convergent itself. Thus a strict best approximation must be a convergent. The determinant and alternating-error facts follow immediately from the recurrence , and the positive continued-fraction tail formula. Therefore the reduced ratio is a convergent of . Without assuming , the unreduced pair may be a common multiple of the convergent's numerator and denominator; for example for reduces to .

Articles by others on the same topic (0)

There are currently no matching articles.