Unsure whether question already answered - there are over 1000 questions on this forum with the "continued-fractions" string.
I request a proof (or hints) that an infinite continued fraction can not converge to a rational number. Using http://www.math.uchicago.edu/~may/VIGRE/VIGRE2008/REUPapers/Yang.pdf as a reference, I followed pages 1-7 (through theorem 1.19), but can not determine how to use the referenced theorems 1.16 or 1.19 to create the desired proof.
Note: I am aware that all rational numbers have a (unique) finite continued fraction, as discussed at https://en.wikipedia.org/wiki/Euclidean_algorithm and https://en.wikipedia.org/wiki/Continued_fraction. However, I don't think that the Euclidean Algorithm eliminates the possibility of an infinite continued fraction converging to a rational number.
Next day, better mood. Khinchin does, indeed, do a better job. Theorem 11 on page 12 says, with the $a_0; a_1, a_2,...$ (positive) integers, all convergents $p/q$ are irreducible, that is $\gcd(p,q)=1.$ ASSUME the limiting value of an infinite (simple) continued fraction is rational $m/n$ with $\gcd(m,n) = 1.$
Theorem 9 on page 9 says $$ \left| \frac{m}{n} - \frac{p}{q} \right| < \frac{1}{q^2} \; \; , $$ since the apparatus has $q_{k+1} > q_k.$
Your continued fraction is infinite, which means we can take a convergent far enough out so that $$ q > n \; \; . $$ Then $$ \left| \frac{m}{n} - \frac{p}{q} \right| = \left| \frac{mq-np}{nq} \right| < \frac{1}{q^2} \; \; . $$ In turn, this says $$ |mq-np| < \frac{nq}{q^2} = \frac{n}{q} < 1. $$ As $|mq-np|$ is a non-negative integer, we find $$ mq=np. $$ As $\gcd(p,q) = 1,$ it follows that $$ q | n \; \; . $$ However, this contradicts $q > n,$ then contradicts the assumption that the limit of the infinite continued fraction is a rational number.