Problems

The functions \({\rm T}_n(x)\), for \(n=0\), 1, 2, \(\ldots\,\), satisfy the recurrence relation \[ {\rm T}_{n+1}(x) -2x {\rm T}_n(x) + {\rm T}_{n-1}(x) =0\, \ \ \ \ \ \ \ (n\ge1). \tag{\(*\)} \] Show by induction that \[ \left({\rm T}_n(x)\right)^2 - {\rm T}_{n-1}(x) {\rm T}_{n+1}(x) = \f(x)\,, \] where \(\f(x) = \left({\rm T}_1(x)\right)^2 - {\rm T}_0(x){\rm T}_2(x)\,\). In the case \(\f(x)\equiv 0\), determine (with proof) an expression for \({\rm T}_n(x)\) in terms of \({\rm T}_0(x)\) (assumed to be non-zero) and \({\rm r}(x)\), where \({\rm r}(x) = {\rm T}_1(x)/ {\rm T}_0(x)\). Find the two possible expressions for \({\rm r}(x)\) in terms of \(x\). %Conjecture (without proof) the general form of the solution of \((*)\).

1. The coefficients in the series \[ S= \tfrac13 x + \tfrac 16 x^2 + \tfrac1{12} x^3 + \cdots + a_rx^r + \cdots \] satisfy a recurrence relation of the form \(a_{r+1} + p a_r =0\). Write down the value of \(p\). By considering \((1+px)S\), find an expression for the sum to infinity of \(S\) (assuming that it exists). Find also an expression for the sum of the first \(n+1\) terms of \(S\).
2. The coefficients in the series \[ T=2 + 8x +18x^2+37 x^3 +\cdots + a_rx^r + \cdots \] satisfy a recurrence relation of the form \(a_{r+2}+pa_{r+1} +qa_r=0\). Find an expression for the sum to infinity of \(T\) (assuming that it exists). By expressing \(T\) in partial fractions, or otherwise, find an expression for the sum of the first \(n+1\) terms of \(T\).

A sequence of numbers, \(F_1, F_2, \ldots\), is defined by \(F_1=1, F_2=1\), and \[ F_n=F_{n-1}+F_{n-2}\, \quad \text{for \(n\ge 3\)}. \]

1. Write down the values of \(F_3, F_4, \ldots , F_8\).
2. Prove that \(F^{\vphantom{2}}_{2k+3}F^{\vphantom{2}}_{2k+1} -F_{2k+2}^2 = -F^{\vphantom{2}}_{2k+2}F^{\vphantom{2}}_{2k}+F_{2k+1}^2\,\).
3. Prove by induction or otherwise that \(F^{\vphantom{2}}_{2n+1}F^{\vphantom{2}}_{2n-1}-F^2_{2n}=1\,\) and deduce that \(F^2_{2n}+1\,\) is divisible by \(F^{\vphantom{2}}_{2n+1}\,.\)
4. Prove that \(F^2_{2n-1}+1\,\) is divisible by \(F^{\vphantom{2}}_{2n+1}\,.\)

The sequence of real numbers \(u_1\), \(u_2\), \(u_3\), \(\ldots\) is defined by \begin{equation*} u_1=2 \,, \qquad\text{and} \qquad u_{n+1} = k - \frac{36}{u_n} \quad \text{for } n\ge1, \tag{\(*\)} \end{equation*} where \(k\) is a constant.

1. Determine the values of \(k\) for which the sequence \((*)\) is: (a) constant; (b) periodic with period 2; (c) periodic with period 4.
2. In the case \(k=37\), show that \(u_n\ge 2\) for all \(n\). Given that in this case the sequence \((*)\) converges to a limit \(\ell\), find the value of \(\ell\).

The sequence \(u_n\) (\(n= 1, 2, \ldots\)) satisfies the recurrence relation \[ u_{n+2}= \frac{u_{n+1}}{u_n}(ku_n-u_{n+1}) \] where \(k\) is a constant. If \(u_1=a\) and \(u_2=b\,\), where \(a\) and \(b\) are non-zero and \(b \ne ka\,\), prove by induction that \[ u_{2n}=\Big(\frac b a \Big) u_{2n-1} \] \[ u_{2n+1}= c u_{2n} \] for \(n \ge 1\), where \(c\) is a constant to be found in terms of \(k\), \(a\) and \(b\). Hence express \(u_{2n}\) and \(u_{2n-1}\) in terms of \(a\), \(b\), \(c\) and \(n\). Find conditions on \(a\), \(b\) and \(k\) in the three cases:

1. the sequence \(u_n\) is geometric;
2. \(u_n\) has period 2;
3. the sequence \(u_n\) has period 4.

A sequence \(t_0\), \(t_1\), \(t_2\), \(...\) is said to be strictly increasing if \(t_{n+1} > t_n\) for all \(n\ge{0}\,\).

1. The terms of the sequence \(x_0\,\), \(x_1\,\), \(x_2\,\), \(\ldots\) satisfy $$ \ds x_{n+1}=\frac{x_n^2 +6}{5} $$ for \(n\ge{0}\,\). Prove that if \(x_0 > 3\) then the sequence is strictly increasing.
2. The terms of the sequence \(y_0\,\), \(y_1\,\), \(y_2\,\), \(\ldots\) satisfy $$ \ds y_{n+1}= 5-\frac 6 {y_n} $$ for \(n\ge{0}\,\). Prove that if \(2 < y_0 < 3\) then the sequence is strictly increasing but that \(y_n<3\) for all \(n\,\).

Given that \(\f''(x) > 0\) when \(a \le x \le b\,\), explain with the aid of a sketch why \[ (b-a) \, \f \Big( {a+b \over 2} \Big) < \int^b_a \f(x) \, \mathrm{d}x < (b-a) \, \displaystyle \frac{\f(a) + \f(b)}{2} \;. \] By choosing suitable \(a\), \(b\) and \(\f(x)\,\), show that \[ {4 \over (2n-1)^2} < {1 \over n-1} - {1 \over n} < {1 \over 2} \l {1 \over n^2} + {1 \over (n-1)^2}\r \,, \] where \(n\) is an integer greater than 1. Deduce that \[ 4 \l {1 \over 3^2} +{1 \over 5^2} + {1 \over 7^2} + \cdots \r < 1 < {1 \over 2} + \left( {1 \over 2^2} +{1 \over 3^2} + {1 \over 4^2} + \cdots \right)\,. \] Show that \[ {1 \over 2} \l {1 \over 3^2} + {1 \over 4^2} + {1 \over 5^2} + \frac 1 {6^2} + \cdots \r < {1 \over 3^2} +{1 \over 5^2} + {1 \over 7^2} + \cdots \] and hence show that \[ {3 \over 2} \displaystyle < \sum_{n=1}^\infty {1 \over n^2} <{7 \over 4}\;. \]

Given a sequence \(w_0\), \(w_1\), \(w_2\), \(\ldots\,\), the sequence \(F_1\), \(F_2\), \(\ldots\) is defined by $$F_n = w_n^2 + w_{n-1}^2 - 4w_nw_{n-1} \,.$$ Show that $\; F_{n}-F_{n-1} = \l w_n-w_{n-2} \r \l w_n+w_{n-2}-4w_{n-1} \r \; \( for \)n \ge 2\,$.

1. The sequence \(u_0\), \(u_1\), \(u_2\), \(\ldots\) has \(u_0 = 1\), and \(u_1 = 2\) and satisfies \[ u_n = 4u_{n-1} -u_{n-2} \quad (n \ge 2)\;. \] Prove that \ $ u_n^2 + u_{n-1}^2 = 4u_nu_{n-1}-3 \; $ for \(n \ge 1\,\).
2. A sequence \(v_0\), \(v_1\), \(v_2\), \(\ldots\,\) has \(v_0=1\) and satisfies \begin{equation*} v_n^2 + v_{n-1}^2 = 4v_nv_{n-1}-3 \quad (n \ge 1). \tag{\(\ast\)} \end{equation*} \makebox[7mm]{(a) \hfill}Find \(v_1\) and prove that, for each \(n\ge2\,\), either \(v_n= 4v_{n-1} -v_{n-2}\) or \(v_n=v_{n-2}\,\). \makebox[7mm]{(b) \hfill}Show that the sequence, with period 2, defined by \begin{equation*} v_n = \begin{cases} 1 & \mbox{for \(n\) even} \\ 2 & \mbox{for \(n\) odd} \end{cases} \end{equation*} \makebox[7mm]{\hfill}satisfies \((\ast)\). \makebox[7mm]{(c) \hfill}Find a sequence \(v_n\) with period 4 which has \(v_0=1\,\), and satisfies~\((\ast)\).

Prove that the cube root of any irrational number is an irrational number. Let \(\displaystyle u_n = {5\vphantom{\dot A}}^{1/{(3^n)}}\,\). Given that \(\sqrt[3]5\) is an irrational number, prove by induction that \(u_n\) is an irrational number for every positive integer \(n\). Hence, or otherwise, give an example of an infinite sequence of irrational numbers which converges to a given integer \(m\,\). [An irrational number is a number that cannot be expressed as the ratio of two integers.]

Show that, if \(n>0\,\), then $$ \int_{e^{1/n}}^\infty\,{{\ln x} \over {x^{n+1}}}\,\d x = {2 \over {n^2\e}}\;. $$ You may assume that \(\ds \frac{\ln x} x \to 0\;\) as \(x\to\infty\,\). Explain why, if \(1 < a < b\,\), then $$ \int_b^\infty\,{{\ln x} \over {x^{n+1}}}\,\d x < \int_a^\infty\,{{\ln x} \over {x^{n+1}}}\,\d x\;. $$ Deduce that $$ \sum_{n=1}^{N}{1 \over n^2} < {\e \over 2}\int_{\e^{1/N}}^{\infty} \left({1-x^{-N}} \over {x^2-x}\right) \ln x\,\d x\;, $$ where \(N\,\) is any integer greater than \(1\).

I borrow \(C\) pounds at interest rate \(100\alpha \,\%\) per year. The interest is added at the end of each year. Immediately after the interest is added, I make a repayment. The amount I repay at the end of the \(k\)th year is \(R_k\) pounds and the amount I owe at the beginning of \(k\)th year is \(C_k\) pounds (with \(C_1=C\)). Express \(C_{n+1}\) in terms of \(R_k\) (\(k= 1\), \(2\), \(\ldots\), \(n\)), \(\alpha\) and \(C\) and show that, if I pay off the loan in \(N\) years with repayments given by \(R_k= (1+\alpha)^kr\,\), where \(r\) is constant, then \(r=C/N\,\). If instead I pay off the loan in \(N\) years with \(N\) equal repayments of \(R\) pounds, show that \[ \frac R C = \frac{\alpha (1+\alpha)^{N} }{(1+\alpha)^N-1} \;, \] and that \(R/C\approx 27/103\) in the case \(\alpha =1/50\), \(N=4\,\).

A bicycle pump consists of a cylinder and a piston. The piston is pushed in with steady speed~\(u\). A particle of air moves to and fro between the piston and the end of the cylinder, colliding perfectly elastically with the piston and the end of the cylinder, and always moving parallel with the axis of the cylinder. Initially, the particle is moving towards the piston at speed \(v\). Show that the speed, \(v_n\), of the particle just after the \(n\)th collision with the piston is given by \(v_n=v+2nu\). Let \(d_n\) be the distance between the piston and the end of the cylinder at the \(n\)th collision, and let \(t_n\) be the time between the \(n\)th and \((n+1)\)th collisions. Express \(d_n - d_{n+1}\) in terms of \(u\) and \(t_n\), and show that \[ d_{n+1} = \frac{v+(2n-1)u}{v+(2n+1)u} \, d_n \;. \] Express \(d_n\) in terms of \(d_1\), \(u\), \(v\) and \(n\). In the case \(v=u\), show that \(ut_n = \displaystyle \frac {d_1} {n(n+1)}\). %%%%%Verify that \(\sum\limits_1^\infty t_n = d/u\).

The numbers \(x_n\), where \(n=0\), \(1\), \(2\), \(\ldots\) , satisfy \[ x_{n+1} = kx_n(1-x_n) \;. \]

1. Prove that, if \(0 < k < 4\) and \(0 < x_0 < 1\), then \(0 < x_n < 1\) for all \(n\,\).
2. Given that \(x_0=x_1=x_2 = \cdots =a\,\), with \(a\ne0\) and \(a\ne1\), find \(k\) in terms of \(a\,\).
3. Given instead that \(x_0=x_2=x_4 = \cdots = a\,\), with \(a\ne0\) and \(a\ne1\), show that \(ab^3 -b^2 +(1-a)=0\), where \(b=k(1-a)\,\). Given, in addition, that \(x_1 \ne a\), find the possible values of \(k\) in terms of \(a\,\).

The function \(\f\) satisfies \(\f(x+1)= \f(x)\) and \(\f(x)>0\) for all \(x\).

1. Give an example of such a function.
2. The function \(\F\) satisfies \[ \frac{\d \F}{\d x} =\f(x) \] and \(\F(0)=0\). Show that \(\F(n) = n\F(1)\), for any positive integer \(n\).
3. Let \(y\) be the solution of the differential equation \[ \frac{\d y}{\d x} +\f(x) y=0 \] that satisfies \(y=1\) when \(x=0\). Show that \(y(n) \to 0\) as \(n\to\infty\), where \(n= 1,\,2,\, 3,\, \ldots\)

Given that $$\e = 1 + {1 \over 1 !} + {1 \over 2 !} + {1 \over 3 !} + \cdots + {1 \over r !} + \cdots \; ,$$ use the binomial theorem to show that $$ {\left( 1 + {1 \over n} \right)}^{\!n} < \e $$ for any positive integer \(n\). The product \({\rm P }( n )\) is defined, for any positive integer \(n\), by $$ {\rm P} ( n ) = {3 \over 2} \cdot {5 \over 4} \cdot {9 \over 8} \cdot \ldots \cdot {2^n + 1 \over 2^n} . $$ Use the arithmetic-geometric mean inequality, $$ {a_1 + a_2 + \cdots + a_n \over n} \ge \ {\left( a_1 \cdot a_2 \cdot \ldots \cdot a_n \right)}^{1 \over n}\,, $$ to show that \({\rm P }( n ) < \e\) for all \(n\) . Explain briefly why \({\rm P} ( n )\) tends to a limit as \(n\to\infty\). Show that this limit, \(L\), satisfies \(2 < L\le\e\).