Chapter IV · Limits of functions of a positive integral variable

Chapter IV problems

Miscellaneous examples 120 min

Eleven of Hardy’s Miscellaneous Examples on Chapter IV, with graded hints and full solutions.

How to use this page

These problems are chosen from the Miscellaneous Examples at the end of Hardy’s Chapter IV, for variety rather than difficulty: monotone sequences, recursions, averages, functions defined by limits, series and complex numbers. Each is restated briefly; Hardy’s wording is in the book. Try each problem for a while before opening the first hint, and open the hints one at a time: the first only points in a direction, the last is nearly a solution. Dots show difficulty (one: routine; three: needs a real idea).

Sequences and their limits

Exercise A formula that picks out multiples of 4 ●○○ Hardy: Misc. Examples IV, 1

The function ϕ(n)\phi(n) takes the values 1,0,0,0,1,0,0,0,1,…1, 0, 0, 0, 1, 0, 0, 0, 1, \dots for n=0,1,2,…n = 0, 1, 2, \dots. Express it by a formula without trigonometric functions.

Hint
Complex numbers are allowed. The four numbers 1,−1,i,−i1, -1, i, -i are the fourth roots of unity.
Hint
Try 14{1n+(−1)n+in+(−i)n}\tfrac14\{1^n + (-1)^n + i^n + (-i)^n\} for n=0,1,2,3n = 0, 1, 2, 3.

Solution
ϕ(n)=14{1+(−1)n+in+(−i)n}.\phi(n) = \tfrac14\{1 + (-1)^n + i^n + (-i)^n\}.

Check the four residues: n≡0(mod4)n \equiv 0 \pmod 4 gives 14(1+1+1+1)=1\tfrac14(1 + 1 + 1 + 1) = 1; n≡1n \equiv 1 gives 14(1−1+i−i)=0\tfrac14(1 - 1 + i - i) = 0; n≡2n \equiv 2 gives 14(1+1−1−1)=0\tfrac14(1 + 1 - 1 - 1) = 0; n≡3n \equiv 3 gives 14(1−1−i+i)=0\tfrac14(1 - 1 - i + i) = 0. Since ini^n has period 44, this covers all nn.

The idea generalises. If ω\omega is a kk-th root of unity other than 11, then 1+ω+⋯+ωk−1=(1−ωk)/(1−ω)=01 + \omega + \cdots + \omega^{k-1} = (1 - \omega^k)/(1 - \omega) = 0. Applying this to ω=εn\omega = \varepsilon^n, where ε=Cis⁡(2π/k)\varepsilon = \operatorname{Cis}(2\pi/k), shows that 1k∑j=0k−1εjn\tfrac1k\sum_{j=0}^{k-1} \varepsilon^{jn} is 11 when kk divides nn and 00 otherwise.

Exercise Two sequences squeezing one limit ●●○ Hardy: Misc. Examples IV, 3–4

Let ϕ(n)=(1+1/n)n\phi(n) = (1 + 1/n)^n and ψ(n)=(1−1/n)−n\psi(n) = (1 - 1/n)^{-n} for n≥2n \ge 2. Show that ϕ\phi increases, ψ\psi decreases, and ψ(n)>ϕ(n)\psi(n) > \phi(n); deduce that both tend to limits. Then show that the two limits are equal.

Hint
Use Bernoulli’s inequality (1+h)m>1+mh(1 + h)^m > 1 + mh for h>−1h > -1, h≠0h \ne 0, and integers m≥2m \ge 2 (a case of §74). Work with the ratios ϕ(n+1)/ϕ(n)\phi(n+1)/\phi(n) and ψ(n)/ψ(n+1)\psi(n)/\psi(n+1).
Hint
ϕ(n+1)ϕ(n)=(1−1(n+1)2)n+1n+1n\dfrac{\phi(n+1)}{\phi(n)} = \Big(1 - \dfrac{1}{(n+1)^2}\Big)^{n+1}\dfrac{n+1}{n} and ψ(n)ψ(n+1)=(1+1n2−1)nnn+1\dfrac{\psi(n)}{\psi(n+1)} = \Big(1 + \dfrac{1}{n^2 - 1}\Big)^{n}\dfrac{n}{n+1}.
Hint
For equality of the limits, bound ψ(n)/ϕ(n)=(1+1n2−1)n\psi(n)/\phi(n) = (1 + \tfrac{1}{n^2 - 1})^n above, using (1+h)−n≥1−nh(1 + h)^{-n} \ge 1 - nh for h≥0h \ge 0.

Solution

ϕ\phi increases. ϕ(n+1)ϕ(n)=(n+2)n+1(n+1)n+1⋅nn(n+1)n=(n(n+2)(n+1)2)n+1n+1n=(1−1(n+1)2)n+1n+1n\dfrac{\phi(n+1)}{\phi(n)} = \dfrac{(n+2)^{n+1}}{(n+1)^{n+1}} \cdot \dfrac{n^n}{(n+1)^n} = \Big(\dfrac{n(n+2)}{(n+1)^2}\Big)^{n+1} \dfrac{n+1}{n} = \Big(1 - \dfrac{1}{(n+1)^2}\Big)^{n+1}\dfrac{n+1}{n}. By Bernoulli, (1−1(n+1)2)n+1>1−n+1(n+1)2=nn+1\big(1 - \tfrac{1}{(n+1)^2}\big)^{n+1} > 1 - \tfrac{n+1}{(n+1)^2} = \tfrac{n}{n+1}, so the ratio exceeds 11.

ψ\psi decreases. ψ(n)=(nn−1)n\psi(n) = \big(\tfrac{n}{n-1}\big)^n, so ψ(n)ψ(n+1)=(nn−1)n(nn+1)n+1=(n2n2−1)nnn+1\dfrac{\psi(n)}{\psi(n+1)} = \Big(\dfrac{n}{n-1}\Big)^n\Big(\dfrac{n}{n+1}\Big)^{n+1} = \Big(\dfrac{n^2}{n^2-1}\Big)^n \dfrac{n}{n+1}. By Bernoulli, (1+1n2−1)n>1+nn2−1>1+1n\big(1 + \tfrac{1}{n^2-1}\big)^n > 1 + \tfrac{n}{n^2-1} > 1 + \tfrac1n, so the ratio exceeds (1+1n)nn+1=1\big(1 + \tfrac1n\big)\tfrac{n}{n+1} = 1.

ψ>ϕ\psi > \phi. ψ(n)ϕ(n)=(nn−1⋅nn+1)n=(1+1n2−1)n>1\dfrac{\psi(n)}{\phi(n)} = \Big(\dfrac{n}{n-1}\cdot\dfrac{n}{n+1}\Big)^n = \Big(1 + \dfrac{1}{n^2-1}\Big)^n > 1.

Both converge. ϕ(n)<ψ(n)≤ψ(2)=4\phi(n) < \psi(n) \le \psi(2) = 4, so ϕ\phi is increasing and bounded above; ψ(n)>ϕ(n)≥ϕ(2)=94\psi(n) > \phi(n) \ge \phi(2) = \tfrac94, so ψ\psi is decreasing and bounded below. By §69 both have limits, and lim⁡ϕ≤lim⁡ψ\lim\phi \le \lim\psi.

The limits are equal. For h≥0h \ge 0 and nh<1nh < 1: (1+h)−n=(1−h1+h)n≥1−nh1+h≥1−nh(1 + h)^{-n} = \big(1 - \tfrac{h}{1+h}\big)^n \ge 1 - \tfrac{nh}{1+h} \ge 1 - nh (Bernoulli again), so (1+h)n≤1/(1−nh)(1 + h)^n \le 1/(1 - nh). With h=1/(n2−1)h = 1/(n^2 - 1) this gives 1<ψ(n)/ϕ(n)≤11−n/(n2−1)→11 < \psi(n)/\phi(n) \le \dfrac{1}{1 - n/(n^2-1)} \to 1. Hence ψ(n)/ϕ(n)→1\psi(n)/\phi(n) \to 1, and ψ(n)−ϕ(n)=ϕ(n){ψ(n)/ϕ(n)−1}→0\psi(n) - \phi(n) = \phi(n)\{\psi(n)/\phi(n) - 1\} \to 0. The common limit is ee (Chapter IX).

Exercise Average product of a split ●●○ Hardy: Misc. Examples IV, 5

Let SnS_n be the arithmetic mean of the products r(n−r)r(n - r) over all ways of writing n=r+(n−r)n = r + (n - r) as a sum of two distinct positive integers (order ignored). Show that Sn/n2→16S_n/n^2 \to \tfrac16.

Hint
The splittings are r=1,2,…,kr = 1, 2, \dots, k with k=[(n−1)/2]k = [(n-1)/2]. You need ∑r\sum r and ∑r2\sum r^2.
Hint
∑r=1kr(n−r)=16k(k+1)(3n−2k−1)\sum_{r=1}^k r(n - r) = \tfrac16 k(k+1)(3n - 2k - 1). Treat odd and even nn separately.

Solution

Using ∑r=1kr=12k(k+1)\sum_{r=1}^k r = \tfrac12 k(k+1) and ∑r=1kr2=16k(k+1)(2k+1)\sum_{r=1}^k r^2 = \tfrac16 k(k+1)(2k+1),

∑r=1kr(n−r)=12nk(k+1)−16k(k+1)(2k+1)=16k(k+1)(3n−2k−1),\sum_{r=1}^k r(n - r) = \tfrac12 nk(k+1) - \tfrac16 k(k+1)(2k+1) = \tfrac16 k(k+1)(3n - 2k - 1),

so Sn=16(k+1)(3n−2k−1)S_n = \tfrac16 (k+1)(3n - 2k - 1).

If n=2k+1n = 2k + 1 is odd: Sn=16(k+1)(4k+2)=16n(n+1)S_n = \tfrac16(k+1)(4k + 2) = \tfrac16 n(n+1). If n=2k+2n = 2k + 2 is even: Sn=16(k+1)(4k+5)=112n(2n+1)S_n = \tfrac16(k+1)(4k + 5) = \tfrac1{12} n(2n + 1). (Check: n=6n = 6 has splittings 1+51 + 5, 2+42 + 4, mean product 6.5=6⋅13/126.5 = 6 \cdot 13/12.) In both cases Sn/n2→16S_n/n^2 \to \tfrac16: 16(1+1/n)→16\tfrac16(1 + 1/n) \to \tfrac16 and 112(2+1/n)→16\tfrac1{12}(2 + 1/n) \to \tfrac16.

The answer does not depend on the reading of “distinct pairs”: over ordered pairs r=1,…,n−1r = 1, \dots, n-1 the mean is 16n(n+1)\tfrac16 n(n+1), with the same limit. The limit is ∫01t(1−t) dt=16\int_0^1 t(1 - t)\,dt = \tfrac16 in disguise.

Recursions

Exercise Nested square roots ●●○ Hardy: Misc. Examples IV, 11

Let k>0k > 0, x1>0x_1 > 0 and xn+1=k+xnx_{n+1} = \sqrt{k + x_n}. Let α\alpha be the positive root of x2=x+kx^2 = x + k. Show that xnx_n increases if x1<αx_1 < \alpha, decreases if x1>αx_1 > \alpha, and tends to α\alpha in either case.

Hint
Compare xn+12−α2x_{n+1}^2 - \alpha^2 with xn−αx_n - \alpha: what does it say about which side of α\alpha each term lies?
Hint
xn+12−xn2=k+xn−xn2=−(xn−α)(xn−β)x_{n+1}^2 - x_n^2 = k + x_n - x_n^2 = -(x_n - \alpha)(x_n - \beta), where β<0\beta < 0 is the other root.
Hint
A monotone bounded sequence converges; pass to the limit in xn+12=k+xnx_{n+1}^2 = k + x_n.

Solution

The side of α\alpha is preserved. xn+12−α2=(k+xn)−(k+α)=xn−αx_{n+1}^2 - \alpha^2 = (k + x_n) - (k + \alpha) = x_n - \alpha, and xn+1+α>0x_{n+1} + \alpha > 0, so xn+1−αx_{n+1} - \alpha has the same sign as xn−αx_n - \alpha. By induction every xnx_n is on the same side of α\alpha as x1x_1 (or all equal α\alpha, if x1=αx_1 = \alpha).

Monotone. x2−x−k=(x−α)(x−β)x^2 - x - k = (x - \alpha)(x - \beta) with β=12(1−1+4k)<0\beta = \tfrac12(1 - \sqrt{1 + 4k}) < 0. So xn+12−xn2=−(xn−α)(xn−β)x_{n+1}^2 - x_n^2 = -(x_n - \alpha)(x_n - \beta), and since xn−β>0x_n - \beta > 0 this has the sign of α−xn\alpha - x_n. If x1<αx_1 < \alpha, all xn<αx_n < \alpha and the sequence increases; if x1>αx_1 > \alpha, it decreases.

The limit. In the first case xnx_n increases and is bounded by α\alpha; in the second it decreases and is bounded below by α\alpha. Either way it has a limit L>0L > 0 (§69). Letting n→∞n \to \infty in xn+12=k+xnx_{n+1}^2 = k + x_n gives L2=k+LL^2 = k + L, so L=αL = \alpha or L=βL = \beta; as L>0L > 0, L=αL = \alpha.

Explore Nested square roots

Try this. This is the recursion with x1=kx_1 = \sqrt k. Change kk and find how large n0n_0 must be for δ=0.001\delta = 0.001. For k=2k = 2 the limit is α=2\alpha = 2.

ϕ(n)=xn+1=k+xn\phi(n) = x_{n+1}=\sqrt{k+x_n} , candidate limit l=2l = 2
nφ(n)
  • band l ± δ
  • l
  • n₀ (drag)
  • n ≥ n₀, good
  • n ≥ n₀, bad
3 terms with n ≥ n₀ fall outside the band: n = 1, 2, 3.
What to notice

The terms climb steadily and never overshoot α\alpha, as the proof says. The gap shrinks by roughly the factor 1/(2α)1/(2\alpha) at each step, because xn+1−α=(xn−α)/(xn+1+α)x_{n+1} - \alpha = (x_n - \alpha)/(x_{n+1} + \alpha).

Exercise Heron’s square-root rule ●●○ Hardy: Misc. Examples IV, 13

Let x>0x > 0, A>0A > 0, x1=12(x+A/x)x_1 = \tfrac12(x + A/x) and xn+1=12(xn+A/xn)x_{n+1} = \tfrac12(x_n + A/x_n). Show that

xn−Axn+A=(x−Ax+A)2n,\frac{x_n - \sqrt A}{x_n + \sqrt A} = \left(\frac{x - \sqrt A}{x + \sqrt A}\right)^{2^n},

and deduce that xn→Ax_n \to \sqrt A.

Hint
Compute xn+1−Ax_{n+1} - \sqrt A and xn+1+Ax_{n+1} + \sqrt A separately: each is a perfect square over 2xn2x_n.
Hint
Writing x0=xx_0 = x, the identity says that the quantity qn=(xn−A)/(xn+A)q_n = (x_n - \sqrt A)/(x_n + \sqrt A) is squared at every step.

Solution

Write x0=xx_0 = x, so that xn+1=12(xn+A/xn)x_{n+1} = \tfrac12(x_n + A/x_n) for all n≥0n \ge 0. Then

xn+1±A=xn2±2A xn+A2xn=(xn±A)22xn,x_{n+1} \pm \sqrt A = \frac{x_n^2 \pm 2\sqrt A\, x_n + A}{2x_n} = \frac{(x_n \pm \sqrt A)^2}{2x_n},

so qn+1=qn2q_{n+1} = q_n^2, where qn=(xn−A)/(xn+A)q_n = (x_n - \sqrt A)/(x_n + \sqrt A) (all xnx_n are positive, so xn+A≠0x_n + \sqrt A \ne 0). By induction qn=q02nq_n = q_0^{2^n}, which is Hardy’s identity.

Since x>0x > 0, ∣x−A∣<x+A|x - \sqrt A| < x + \sqrt A, so ∣q0∣<1|q_0| < 1 and qn=q02n→0q_n = q_0^{2^n} \to 0. Solving qn(xn+A)=xn−Aq_n(x_n + \sqrt A) = x_n - \sqrt A for xnx_n gives xn=A 1+qn1−qn→Ax_n = \sqrt A\,\dfrac{1 + q_n}{1 - q_n} \to \sqrt A.

The exponent 2n2^n explains Heron’s speed: once ∣qn∣|q_n| is about 10−310^{-3}, the next step makes it about 10−610^{-6}. The number of correct digits roughly doubles at every step.

Explore Heron’s rule doubles the digits

Try this. Set δ\delta to 0.0010.001 and then to 0.0000010.000001, and find the smallest n0n_0 each time. Change AA.

ϕ(n)=xn+1=12(xn+Axn)\phi(n) = x_{n+1}=\tfrac12\left(x_n+\frac{A}{x_n}\right) , candidate limit l=1.414l = 1.414
nφ(n)
  • band l ± δ
  • l
  • n₀ (drag)
  • n ≥ n₀, good
  • n ≥ n₀, bad
2 terms with n ≥ n₀ fall outside the band: n = 1, 2.
What to notice

Making δ\delta a thousand times smaller costs only about one more step: the error is squared at every step.

Exercise Undoing a smoothing ●●● Hardy: Misc. Examples IV, 20

Let ∣α∣<1|\alpha| < 1, y0=x0y_0 = x_0 and yn=xn−αxn−1y_n = x_n - \alpha x_{n-1} for n≥1n \ge 1. Express xnx_n in terms of the yy’s, and show that if yn→ly_n \to l then xn→l/(1−α)x_n \to l/(1 - \alpha).

Hint
xn=yn+αxn−1x_n = y_n + \alpha x_{n-1}. Unwind it.
Hint
Write yn=l+tny_n = l + t_n with tn→0t_n \to 0. The ll-part of xnx_n is a geometric sum. For the tt-part, split the sum into recent and old terms, as in the proof of the next problem.

Solution

Formula. xn=yn+αxn−1x_n = y_n + \alpha x_{n-1}, so by induction

xn=yn+αyn−1+α2yn−2+⋯+αny0=∑j=0nαn−jyj.x_n = y_n + \alpha y_{n-1} + \alpha^2 y_{n-2} + \cdots + \alpha^n y_0 = \sum_{j=0}^{n} \alpha^{n-j} y_j.

Limit. Put yj=l+tjy_j = l + t_j with tj→0t_j \to 0. Then

xn=l 1−αn+11−α+Tn,Tn=∑j=0nαn−jtj.x_n = l\,\frac{1 - \alpha^{n+1}}{1 - \alpha} + T_n, \qquad T_n = \sum_{j=0}^{n} \alpha^{n-j} t_j .

The first part tends to l/(1−α)l/(1 - \alpha) since αn+1→0\alpha^{n+1} \to 0. For TnT_n: the tjt_j are bounded, say ∣tj∣≤A|t_j| \le A. Let δ>0\delta > 0 and choose NN with ∣tj∣<12δ(1−∣α∣)|t_j| < \tfrac12\delta(1 - |\alpha|) for j≥Nj \ge N. For n≥Nn \ge N,

∣Tn∣≤A∑j<N∣α∣n−j+12δ(1−∣α∣)∑j≥N∣α∣n−j≤A ∣α∣n−N+11−∣α∣+12δ.|T_n| \le A\sum_{j < N} |\alpha|^{n-j} + \tfrac12\delta(1 - |\alpha|)\sum_{j \ge N} |\alpha|^{n-j} \le \frac{A\,|\alpha|^{n-N+1}}{1 - |\alpha|} + \tfrac12\delta.

The first term tends to 00 as n→∞n \to \infty, so it is below 12δ\tfrac12\delta for large nn, and then ∣Tn∣<δ|T_n| < \delta. Hence Tn→0T_n \to 0 and xn→l/(1−α)x_n \to l/(1 - \alpha). The old terms are not small, but they are damped by high powers of α\alpha; the recent terms are not damped much, but they are small.

Averages

Exercise Cesàro means ●●● Hardy: Misc. Examples IV, 16, 18

Show that if sn→ls_n \to l then s1+s2+⋯+snn→l\dfrac{s_1 + s_2 + \cdots + s_n}{n} \to l. Show that the converse is false by taking sn=1,0,1,0,…s_n = 1, 0, 1, 0, \dots.

Hint
Write sn=l+tns_n = l + t_n; you must show that (t1+⋯+tn)/n→0(t_1 + \cdots + t_n)/n \to 0 when tn→0t_n \to 0.
Hint
Split the sum at a fixed index NN beyond which every ∣tj∣<12δ|t_j| < \tfrac12\delta. The early terms are not small, but there are only NN of them.
Hint
For the converse, count the 11s among s1,…,sns_1, \dots, s_n.

Solution

Since s1+⋯+snn−l=t1+⋯+tnn\dfrac{s_1 + \cdots + s_n}{n} - l = \dfrac{t_1 + \cdots + t_n}{n} with tj=sj−l→0t_j = s_j - l \to 0, it is enough to show that the average of a null sequence is null.

The tjt_j are bounded (a convergent sequence is bounded), say ∣tj∣≤A|t_j| \le A. Let δ>0\delta > 0 and choose NN with ∣tj∣<12δ|t_j| < \tfrac12\delta for j>Nj > N. For n>Nn > N,

∣t1+⋯+tnn∣≤∣t1∣+⋯+∣tN∣n+∣tN+1∣+⋯+∣tn∣n<NAn+n−Nn⋅δ2<NAn+δ2.\left|\frac{t_1 + \cdots + t_n}{n}\right| \le \frac{|t_1| + \cdots + |t_N|}{n} + \frac{|t_{N+1}| + \cdots + |t_n|}{n} < \frac{NA}{n} + \frac{n - N}{n}\cdot\frac{\delta}{2} < \frac{NA}{n} + \frac{\delta}{2}.

With NN fixed, NA/n<12δNA/n < \tfrac12\delta as soon as n>2NA/δn > 2NA/\delta. So the average is less than δ\delta in absolute value for all large nn, and tends to 00.

This is Hardy’s “split into two groups” argument, which he urges the reader to study with great care: the first group has terms that need not be small, but their number is fixed while nn grows; the second group has many terms, but each is small. (Hardy lets the split point grow slowly with nn; a fixed NN chosen from δ\delta works equally well.)

Converse false. For sn=1,0,1,0,…s_n = 1, 0, 1, 0, \dots the sum s1+⋯+sns_1 + \cdots + s_n is the number of odd numbers up to nn, that is ⌈n/2⌉\lceil n/2\rceil, so the average lies between 12\tfrac12 and 12+12n\tfrac12 + \tfrac1{2n} and tends to 12\tfrac12, although sns_n oscillates. (Compare the series 1−1+1−⋯1 - 1 + 1 - \cdots, whose partial sums these are: averaging assigns it the value 12\tfrac12.)

Corollary (Misc. Examples IV, 17). If ϕ(n)−ϕ(n−1)→l\phi(n) - \phi(n-1) \to l, then ϕ(n)/n→l\phi(n)/n \to l: apply the result to sn=ϕ(n)−ϕ(n−1)s_n = \phi(n) - \phi(n-1) (with ϕ(0)=0\phi(0) = 0), whose average is ϕ(n)/n\phi(n)/n.

Explore Averages of 1,0,1,0,…1, 0, 1, 0, \dots

Try this. These are the averages (s1+⋯+sn)/n(s_1 + \cdots + s_n)/n for sn=1,0,1,0,…s_n = 1, 0, 1, 0, \dots. Find n0n_0 for δ=0.01\delta = 0.01.

ϕ(n)=s1+⋯+snn\phi(n) = \frac{s_1+\cdots+s_n}{n} , candidate limit l=0.5l = 0.5
nφ(n)
  • band l ± δ
  • l
  • n₀ (drag)
  • n ≥ n₀, good
  • n ≥ n₀, bad
5 terms with n ≥ n₀ fall outside the band: n = 1, 3, 5, 7, 9.
What to notice

The averages settle on 12\tfrac12, approaching it from above at the odd places and sitting on it at the even ones, although the sequence being averaged never settles at all.

Functions defined by limits

Exercise Detecting the integers ●○○ Hardy: Misc. Examples IV, 22

Show that lim⁡n→∞11+nsin⁡2πx\lim\limits_{n\to\infty} \dfrac{1}{1 + n\sin^2\pi x} is 11 when xx is an integer and 00 otherwise. Deduce that lim⁡n→∞ψ(x)+nϕ(x)sin⁡2πx1+nsin⁡2πx\lim\limits_{n\to\infty}\dfrac{\psi(x) + n\phi(x)\sin^2\pi x}{1 + n\sin^2\pi x} equals ϕ(x)\phi(x) except at the integers, where it equals ψ(x)\psi(x).

Hint
When is sin⁡πx=0\sin\pi x = 0?

Solution

If xx is an integer, sin⁡πx=0\sin\pi x = 0 and every term is 11. Otherwise c=sin⁡2πx>0c = \sin^2\pi x > 0, so 1+nc→+∞1 + nc \to +\infty and 1/(1+nc)→01/(1 + nc) \to 0.

For the second expression: at an integer every term is ψ(x)\psi(x). Otherwise divide top and bottom by nn:

ψ(x)/n+ϕ(x) c1/n+c→ϕ(x) cc=ϕ(x).\frac{\psi(x)/n + \phi(x)\,c}{1/n + c} \to \frac{\phi(x)\,c}{c} = \phi(x).

So a formula built from smooth pieces can change a function’s values on the integers alone.

Series

Exercise Telescoping with factorials ●●○ Hardy: Misc. Examples IV, 25

Show that ∑ν=1∞1ν(ν+1)=1\displaystyle\sum_{\nu=1}^\infty \frac{1}{\nu(\nu+1)} = 1 and, for k≥1k \ge 1, ∑ν=1∞1ν(ν+1)⋯(ν+k)=1k⋅k!\displaystyle\sum_{\nu=1}^\infty \frac{1}{\nu(\nu+1)\cdots(\nu+k)} = \frac{1}{k \cdot k!}.

Hint
Find a difference of two products of kk consecutive factors that equals kk divided by the product of k+1k + 1 consecutive factors.
Hint
1ν(ν+1)⋯(ν+k−1)−1(ν+1)⋯(ν+k)=(ν+k)−νν(ν+1)⋯(ν+k)\dfrac{1}{\nu(\nu+1)\cdots(\nu+k-1)} - \dfrac{1}{(\nu+1)\cdots(\nu+k)} = \dfrac{(\nu + k) - \nu}{\nu(\nu+1)\cdots(\nu+k)}.

Solution

Put Pν=1ν(ν+1)⋯(ν+k−1)P_\nu = \dfrac{1}{\nu(\nu+1)\cdots(\nu+k-1)} (kk factors). By the second hint,

1ν(ν+1)⋯(ν+k)=1k (Pν−Pν+1).\frac{1}{\nu(\nu+1)\cdots(\nu+k)} = \frac1k\,(P_\nu - P_{\nu+1}).

So the partial sum telescopes:

∑ν=1n1ν(ν+1)⋯(ν+k)=1k (P1−Pn+1)=1k(11⋅2⋯k−1(n+1)(n+2)⋯(n+k)).\sum_{\nu=1}^{n} \frac{1}{\nu(\nu+1)\cdots(\nu+k)} = \frac1k\,(P_1 - P_{n+1}) = \frac1k\left(\frac{1}{1\cdot 2\cdots k} - \frac{1}{(n+1)(n+2)\cdots(n+k)}\right).

As n→∞n \to \infty the last fraction tends to 00, so the sum is 1k⋅k!\dfrac{1}{k \cdot k!}. For k=1k = 1 this is ∑1/(ν(ν+1))=1\sum 1/(\nu(\nu+1)) = 1.

Exercise Differentiating the geometric series, without derivatives ●●○ Hardy: Misc. Examples IV, 28

Show that if ∣z∣<1|z| < 1 then 1+2z+3z2+⋯+(n+1)zn+⋯=1(1−z)21 + 2z + 3z^2 + \cdots + (n+1)z^n + \cdots = \dfrac{1}{(1 - z)^2}.

Hint
Multiply the partial sum Sn=1+2z+⋯+nzn−1S_n = 1 + 2z + \cdots + nz^{n-1} by 1−z1 - z.
Hint
You will need nzn→0nz^n \to 0 for ∣z∣<1|z| < 1; it follows from nrn→0n r^n \to 0 for 0≤r<10 \le r < 1 (Examples XXVII).

Solution

Let Sn=1+2z+⋯+nzn−1S_n = 1 + 2z + \cdots + nz^{n-1}. Then

(1−z)Sn=1+z+z2+⋯+zn−1−nzn=1−zn1−z−nzn,(1 - z)S_n = 1 + z + z^2 + \cdots + z^{n-1} - nz^n = \frac{1 - z^n}{1 - z} - nz^n,

so

Sn=1−zn(1−z)2−nzn1−z.S_n = \frac{1 - z^n}{(1 - z)^2} - \frac{nz^n}{1 - z}.

For ∣z∣=r<1|z| = r < 1, zn→0z^n \to 0 (§87) and ∣nzn∣=nrn→0|nz^n| = nr^n \to 0, so nzn→0nz^n \to 0. Hence Sn→1(1−z)2S_n \to \dfrac{1}{(1-z)^2}.

A harder one

Exercise When does sin⁡2nθπ\sin 2^n\theta\pi converge? ●●● Hardy: Misc. Examples IV, 32

Show that if sin⁡(2nθπ)→l\sin(2^n\theta\pi) \to l, then l=0l = 0 and θ\theta is a rational number whose denominator is a power of 22.

Hint
Let sn=sin⁡2nθπs_n = \sin 2^n\theta\pi and cn=cos⁡2nθπc_n = \cos 2^n\theta\pi. The double-angle formulas give cn+1=1−2sn2c_{n+1} = 1 - 2s_n^2, cn+1=2cn2−1c_{n+1} = 2c_n^2 - 1 and sn+1=2sncns_{n+1} = 2s_nc_n. Show first that cnc_n converges, and find the possible limits.
Hint
You should find cn→1c_n \to 1 and l=0l = 0. Now write 2nθ=2kn+un2^n\theta = 2k_n + u_n with knk_n an integer and −1<un≤1-1 < u_n \le 1. What does cn→1c_n \to 1 say about unu_n, and how is un+1u_{n+1} related to unu_n once ∣un∣<12|u_n| < \tfrac12?

Solution

l=0l = 0. From cn+1=1−2sn2c_{n+1} = 1 - 2s_n^2, the sequence cn+1c_{n+1}, and hence cnc_n, tends to m=1−2l2m = 1 - 2l^2. Letting n→∞n \to \infty in cn+1=2cn2−1c_{n+1} = 2c_n^2 - 1 gives m=2m2−1m = 2m^2 - 1, so m=1m = 1 or m=−12m = -\tfrac12. Letting n→∞n \to \infty in sn+1=2sncns_{n+1} = 2s_nc_n gives l=2lml = 2lm. If m=−12m = -\tfrac12, then l=−ll = -l, so l=0l = 0, but then m=1−0=1m = 1 - 0 = 1, a contradiction. So m=1m = 1, and 1−2l2=11 - 2l^2 = 1 gives l=0l = 0.

θ\theta is dyadic. Write 2nθ=2kn+un2^n\theta = 2k_n + u_n with knk_n an integer and −1<un≤1-1 < u_n \le 1. Then cn=cos⁡unπ→1c_n = \cos u_n\pi \to 1, and since cos⁡uπ\cos u\pi is close to 11 on (−1,1](-1, 1] only near u=0u = 0, un→0u_n \to 0. Choose n0n_0 with ∣un∣<12|u_n| < \tfrac12 for all n≥n0n \ge n_0. For such nn, 2n+1θ=4kn+2un2^{n+1}\theta = 4k_n + 2u_n with −1<2un<1-1 < 2u_n < 1, so (by uniqueness of the representation) un+1=2unu_{n+1} = 2u_n. By induction un0+ν=2νun0u_{n_0 + \nu} = 2^\nu u_{n_0} for all ν≥0\nu \ge 0. The left side has absolute value less than 12\tfrac12 while the right side is unbounded unless un0=0u_{n_0} = 0. Hence un0=0u_{n_0} = 0, so 2n0θ=2kn02^{n_0}\theta = 2k_{n_0} and θ=2kn0/2n0\theta = 2k_{n_0}/2^{n_0}, a rational number with a power of 22 as denominator.

Conversely, if θ=p/2m\theta = p/2^m then 2nθ2^n\theta is an integer for n≥mn \ge m, so sin⁡2nθπ=0\sin 2^n\theta\pi = 0 from then on. Hardy adds that for other bases the limit need not be 00: sin⁡(9nπ/2)=1\sin(9^n\pi/2) = 1 for every nn, because 9n≡1(mod4)9^n \equiv 1 \pmod 4.