I have noticed that the algebraic fraction
$\frac{3a+2b}{4a+3b} $
Gives better and better approximations to $\sin 45^\circ = \frac{\sqrt{2}}{2} $
For $ a = b = 1$ we get $5/7 \approx 0.714 $
Now, taking $ a = 5, b = 7$, we get $ 29/41 \approx 0.707$
All the times, take
$ a_{n+1} = 3a_n + 2b_n$
$ b_{n+1} = 4a_n+3b_n$
And this process converges to $\frac{\sqrt{2}}{2} $
I have arrived at this result by a casual consideration. When I take the approximation $5/7$, I wonder what happens if I rewrite the numbers $5$ and $7$ as a function of two quantities $a, b$ in order to get a better approximation by successive iterations, in which the first approximation is the case $ a = b = 1$. Thus I have written $ 5 = 3a + 2b$ and the number $7 = 4a+3b$ I have selected both numerator and denominator to be consecutive numbers, and surprisingly this gives better approximations to $\frac{\sqrt{2}}{2}$
The question now is: how to prove that, in fact, this algebraic fraction, whit the described iteration above, converges to the desired value?
I presume you mean $$ \eqalign{ a_{n+1} &= 3 a_n + 2 b_n\cr b_{n+1} &= 4 a_n + 3 b_n\cr}$$
That is $X_{n+1} = A X_n$ where $X_n = \pmatrix{a_n\cr b_n\cr}$ and $A = \pmatrix{3 & 2\cr 4 & 3\cr}$. The reason this works is that $A$ has eigenvalues $3 \pm 2 \sqrt{2}$, with eigenvector $\pmatrix{1\cr \sqrt{2}\cr}$ for $3 + 2 \sqrt{2}$.
More generally, suppose $A$ is an $m \times m$ real matrix with a simple eigenvalue $\lambda > 0$, and all other eigenvalues have absolute value strictly less than $\lambda$. Let $V$ be a normalized eigenvector for $\lambda$. Then for almost any initial vector $X_0$, the vectors $X_n = A^n X_0$ satisfy $X_n / \|X_n\| \to \pm V$ as $n \to \infty$.