Show that if $1$

n$+1<$ q $<1$

n

$,$ then a step in the algorithm always produces a smaller

numerator. conclude that q can be written as a finite sum Pm

j$=1$

$1$

nj

$,$ where n$1>$ n$2>$

$>$ nm$.$