1

I need help with the following proofs:

Given a continued fraction $[a_0,a_1,...,a_N]$ ($a_i$ for all $i$ is a natural number).

We define as well:$p_{-1}=1$ ,$q_{-1}=0$ ,$p_0=a_0$ ,$q_0=1$ , and by recursion:

$p_n=a_np_{n-1}+p_{n-2}$ , $q_n=a_nq_{n-1}+q_{n-2}$

Prove:

1.$p_nq_{n-1}-p_{n-1}q_n=(-1)^{n-1}$

2.$p_nq_{n-2}-p_{n-2}q_n=(-1)^na_n$

I know that it should be done with induction but I really can't solve it..

ChikChak
  • 2,002
  • please take a look at the examples i included in http://math.stackexchange.com/questions/2028083/is-there-a-simpler-way-to-find-an-inverse-of-a-congruence/2028096#2028096 so this has a bit more concrete reality for you – Will Jagy Nov 27 '16 at 19:15

1 Answers1

1

Note for part (1) that

$$d_n = p_nq_{n-1} - q_np_{n-1} = q_{n-1}(a_np_{n-1} + p_{n-2}) - p_{n-1}(a_nq_{n-1} + q_{n-2}) = -(p_{n-1}q_{n-2} - q_{n-1}p_{n-2}) ,$$

and

$$p_0q_{-1} - p_{-1}q_0 = -1.$$

Then apply induction using $d_0 = -1$ and $d_n = - d_{n-1}$.

Use a similar argument for part (2).

RRL
  • 90,707