Let us apply the results of § 69 to the particularly important case in which ϕ(n)=xn. If x=1 then ϕ(n)=1, limϕ(n)=1, and if x=0 then ϕ(n)=0, limϕ(n)=0, so that these special cases need not detain us.

First, suppose x positive. Then, since ϕ(n+1)=xϕ(n), ϕ(n) increases with n if x>1, decreases as n increases if x<1.

If x>1, then xn must tend either to a limit (which must obviously be greater than 1) or to +. Suppose it tends to a limit l. Then limϕ(n+1)=limϕ(n)=l, by Exs. XXV. 7; but limϕ(n+1)=limxϕ(n)=xlimϕ(n)=xl, and therefore l=xl: and as x and l are both greater than 1, this is impossible. Hence xn+(x>1).

Example. The reader may give an alternative proof, showing by the binomial theorem that xn>1+nδ if δ is positive and x=1+δ, and so that xn+.

On the other hand xn is a decreasing function if x<1, and must therefore tend to a limit or to . Since xn is positive the second alternative may be ignored. Thus limxn=l, say, and as above l=xl, so that l must be zero. Hence limxn=0(0<x<1).

Example. Prove as in the preceding example that (1/x)n tends to + if 0<x<1, and deduce that xn tends to 0.

We have finally to consider the case in which x is negative. If 1<x<0 and x=y, so that 0<y<1, then it follows from what precedes that limyn=0 and therefore limxn=0. If x=1 it is obvious that xn oscillates, taking the values 1, 1 alternatively. Finally if x<1, and x=y, so that y>1, then yn tends to +, and therefore xn takes values, both positive and negative, numerically greater than any assigned number. Hence xn oscillates infinitely. To sum up: ϕ(n)=xn+(x>1),limϕ(n)=1(x=1),limϕ(n)=0(1<x<1),ϕ(n) oscillates finitely(x=1),ϕ(n) oscillates infinitely(x<1).

Example XXVII

1. If ϕ(n) is positive and ϕ(n+1)>Kϕ(n), where K>1, for all values of n, then ϕ(n)+. These examples are particularly important and several of them will be made use of later in the text. They should therefore be studied very carefully.

[For ϕ(n)>Kϕ(n1)>K2ϕ(n2)>Kn1ϕ(1), from which the conclusion follows at once, as Kn.]

2. The same result is true if the conditions above stated are satisfied only when nn0.

3. If ϕ(n) is positive and ϕ(n+1)<Kϕ(n), where 0<K<1, then limϕ(n)=0. This result also is true if the conditions are satisfied only when nn0.

4. If |ϕ(n+1)|<K|ϕ(n)| when nn0, and 0<K<1, then limϕ(n)=0.

5. If ϕ(n) is positive and lim{ϕ(n+1)}/{ϕ(n)}=l>1, then ϕ(n)+.

[For we can determine n0 so that {ϕ(n+1)}/{ϕ(n)}>K>1 when nn0: we may, e.g., take K between 1 and l. Now apply Ex. 1.]

6. If lim{ϕ(n+1)}/{ϕ(n)}=l, where l is numerically less than unity, then limϕ(n)=0. [This follows from Ex. 4 as Ex. 5 follows from Ex. 1.]

7. Determine the behaviour, as n, of ϕ(n)=nrxn, where r is any positive integer.

[If x=0 then ϕ(n)=0 for all values of n, and ϕ(n)0. In all other cases ϕ(n+1)ϕ(n)=(n+1n)rxx. First suppose x positive. Then ϕ(n)+ if x>1 (Ex. 5) and ϕ(n)0 if x<1 (Ex. 6). If x=1, then ϕ(n)=nr+. Next suppose x negative. Then |ϕ(n)|=nr|x|n tends to + if |x|1 and to 0 if |x|<1. Hence ϕ(n) oscillates infinitely if x1 and ϕ(n)0 if 1<x<0.]

8. Discuss nrxn in the same way. [The results are the same, except that ϕ(n)0 when x=1 or 1.]

9. Draw up a table to show how nkxn behaves as n, for all real values of x, and all positive and negative integral values of k.

[The reader will observe that the value of k is immaterial except in the special cases when x=1 or 1. Since lim{(n+1)/n}k=1, whether k be positive or negative, the limit of the ratio ϕ(n+1)/ϕ(n) depends only on x, and the behaviour of ϕ(n) is in general dominated by the factor xn. The factor nk only asserts itself when x is numerically equal to 1.]

10. Prove that if x is positive then xn1 as n. [Suppose, , x>1. Then x, x, x3, … is a decreasing sequence, and xn>1 for all values of n. Thus xnl, where l1. But if l>1 we can find values of n, as large as we please, for which xn>l or x>ln; and, since ln+ as n, this is impossible.]

11. nn1. [For n+1n+1<nn if (n+1)n<nn+1 or {1+(1/n)}n<n, which is certainly satisfied if n3 (see § 73 for a proof). Thus nn decreases as n increases from 3 onwards, and, as it is always greater than unity, it tends to a limit which is greater than or equal to unity. But if nnl, where l>1, then n>ln, which is certainly untrue for sufficiently large values of n, since ln/n+ with n (Exs. 7, 8).]

12. n!n+. [However large Δ may be, n!>Δn if n is large enough. For if un=Δn/n! then un+1/un=Δ/(n+1), which tends to zero as n, so that un does the same (Ex. 6).]

13. Show that if 1<x<1 then un=m(m1)(mn+1)n!xn=(mn)xn tends to zero as n.

[If m is a positive integer, un=0 for n>m. Otherwise un+1un=mnn+1xx, unless x=0.]

71. Alternative proof of Weierstrass’s Theorem Main Page 73.The limit of (1+1n)n