Definition. When ϕ(n) does not tend to a limit, nor to +, nor to , as n tends to , we say that ϕ(n) oscillates as n tends to .

A function ϕ(n) certainly oscillates if its values form, as in the case considered in the last example above, a continual repetition of a cycle of values. But of course it may oscillate without possessing this peculiarity. Oscillation is defined in a purely negative manner: a function oscillates when it does not do certain other things.

The simplest example of an oscillatory function is given by ϕ(n)=(1)n, which is equal to +1 when n is even and to 1 when n is odd. In this case the values recur cyclically. But consider ϕ(n)=(1)n+(1/n), the values of which are 1+1,1+(1/2),1+(1/3),1+(1/4),1+(1/5), . When n is large every value is nearly equal to +1 or 1, and obviously ϕ(n) does not tend to a limit or to + or to , and therefore it oscillates: but the values do not recur. It is to be observed that in this case every value of ϕ(n) is numerically less than or equal to 3/2. Similarly ϕ(n)=(1)n100+(1000/n) oscillates. When n is large, every value is nearly equal to 100 or to 100. The numerically greatest value is 900 (for n=1). But now consider ϕ(n)=(1)nn, the values of which are 1, 2, 3, 4, 5, …. This function oscillates, for it does not tend to a limit, nor to +, nor to . And in this case we cannot assign any limit beyond which the numerical value of the terms does not rise. The distinction between these two examples suggests a further definition.

Definition. If ϕ(n) oscillates as n tends to , then ϕ(n) will be said to oscillate finitely or infinitely according as it is or is not possible to assign a number K such that all the values of ϕ(n) are numerically less than K, |ϕ(n)|<K for all values of n.

These definitions, as well as those of § 58 and 60, are further illustrated in the following examples.

Example XXIV

Consider the behaviour as n tends to of the following functions:

1. (1)n, 5+3(1)n, (1,000,000/n)+(1)n, 1,000,000(1)n+(1/n).

2. (1)nn, 1,000,000+(1)nn.

3. 1,000,000n, (1)n(1,000,000n).

4. n{1+(1)n}. In this case the values of ϕ(n) are 0,4,0,8,0,12,0,16, . The odd terms are all zero and the even terms tend to +: ϕ(n) oscillates infinitely.

5. n2+(1)n2n. The second term oscillates infinitely, but the first is very much larger than the second when n is large. In fact ϕ(n)n22n and n22n=(n1)21 is greater than any assigned value Δ if n>1+Δ+1. Thus ϕ(n)+. It should be observed that in this case ϕ(2k+1) is always less than ϕ(2k), so that the function progresses to infinity by a continual series of steps forwards and backwards. It does not however ‘oscillate’ according to our definition of the term.

6. n2{1+(1)n}, (1)nn2+n, n3+(1)nn2.

7. sinnθπ. We have already seen (Exs. XXIII. 9) that ϕ(n) oscillates finitely when θ is rational, unless θ is an integer, when ϕ(n)=0, ϕ(n)0.

The case in which θ is irrational is a little more difficult. But it is not difficult to see that ϕ(n) still oscillates finitely. We can without loss of generality suppose 0<θ<1. In the first place |ϕ(n)|<1. Hence ϕ(n) must oscillate finitely or tend to a limit. We shall consider whether the second alternative is really possible. Let us suppose that limsinnθπ=l. Then, however small ϵ may be, we can choose n0 so that sinnθπ lies between lϵ and l+ϵ for all values of n greater than or equal to n0. Hence sin(n+1)θπsinnθπ is numerically less than 2ϵ for all such values of n, and so |sin12θπcos(n+12)θπ|<ϵ.

Hence cos(n+12)θπ=cosnθπcos12θπsinnθπsin12θπ must be numerically less than ϵ/|sin12θπ|. Similarly cos(n12)θπ=cosnθπcos12θπ+sinnθπsin12θπ must be numerically less than ϵ/|sin12θπ|; and so each of cosnθπcos12θπ, sinnθπsin12θπ must be numerically less than ϵ/|sin12θπ|. That is to say, cosnθπcos12θπ is very small if n is large, and this can only be the case if cosnθπ is very small. Similarly sinnθπ must be very small, so that l must be zero. But it is impossible that cosnθπ and sinnθπ can both be very small, as the sum of their squares is unity. Thus the hypothesis that sinnθπ tends to a limit l is impossible, and therefore sinnθπ oscillates as n tends to .

The reader should consider with particular care the argument ‘cosnθπcos12θπ is very small, and this can only be the case if cosnθπ is very small’. Why, he may ask, should it not be the other factor cos12θπ which is ‘very small’? The answer is to be found, of course, in the meaning of the phrase ‘very small’ as used in this connection. When we say ‘ϕ(n) is very small’ for large values of n, we mean that we can choose n0 so that ϕ(n) is numerically smaller than any assigned number, if . Such an assertion is palpably absurd when made of a fixed number such as cos12θπ, which is not zero.

Prove similarly that cosnθπ oscillates finitely, unless θ is an even integer.

8. sinnθπ+(1/n), sinnθπ+1, sinnθπ+n, (1)nsinnθπ.

9. acosnθπ+bsinnθπ, sin2nθπ, acos2nθπ+bsin2nθπ.

10. a+bn+(1)n(c+dn)+ecosnθπ+fsinnθπ.

11. nsinnθπ. If θ is integral, then ϕ(n)=0, ϕ(n)0. If θ is rational but not integral, or irrational, then ϕ(n) oscillates infinitely.

12. n(acos2nθπ+bsin2nθπ). In this case ϕ(n) tends to + if a and b are both positive, but to if both are negative. Consider the special cases in which a=0, b>0, or a>0, b=0, or a=0, b=0. If a and b have opposite signs ϕ(n) generally oscillates infinitely. Consider any exceptional cases.

13. sin(n2θπ). If θ is integral, then ϕ(n)0. Otherwise ϕ(n) oscillates finitely, as may be shown by arguments similar to though more complex than those used in Exs. XXIII. 9 and Exs. XXIV. 7.1

14. sin(n!θπ). If θ has a rational value p/q, then n!θ is certainly integral for all values of n greater than or equal to q. Hence ϕ(n)0. The case in which θ is irrational cannot be dealt with without the aid of considerations of a much more difficult character.

15. cos(n!θπ), acos2(n!θπ)+bsin2(n!θπ), where θ is rational.

16. an[bn], (1)n(an[bn]).

17. [n], (1)n[n], n[n].

18. The smallest prime factor of n. When n is a prime, ϕ(n)=n. When n is even, ϕ(n)=2. Thus ϕ(n) oscillates infinitely.

19. The largest prime factor of n.

20. The number of days in the year n A.D.

 

Example XXV

1. If ϕ(n)+ and ψ(n)ϕ(n) for all values of n, then ψ(n)+.

2. If ϕ(n)0, and |ψ(n)||ϕ(n)| for all values of n, then ψ(n)0.

3. If lim|ϕ(n)|=0, then limϕ(n)=0.

4. If ϕ(n) tends to a limit or oscillates finitely, and |ψ(n)||ϕ(n)| when nn0, then ψ(n) tends to a limit or oscillates finitely.

5. If ϕ(n) tends to +, or to , or oscillates infinitely, and |ψ(n)||ϕ(n)| when nn0, then ψ(n) tends to + or to or oscillates infinitely.

6. ‘If ϕ(n) oscillates and, however great be n0, we can find values of n greater than n0 for which ψ(n)>ϕ(n), and values of n greater than n0 for which ψ(n)<ϕ(n), then ψ(n) oscillates’. Is this true? If not give an example to the contrary.

7. If ϕ(n)l as n, then also ϕ(n+p)l, p being any fixed integer. [This follows at once from the definition. Similarly we see that if ϕ(n) tends to + or or oscillates so also does ϕ(n+p).]

8. The same conclusions hold (except in the case of oscillation) if p varies with n but is always numerically less than a fixed positive integer N; or if p varies with n in any way, so long as it is always positive.

9. Determine the least value of n0 for which it is true that (a) n2+2n>999,999(nn0),(b) n2+2n>1,000,000(nn0).

10. Determine the least value of n0 for which it is true that (a) n+(1)n>1000(nn0),(b) n+(1)n>1,000,000(nn0).

11. Determine the least value of n0 for which it is true that (a) n2+2n>Δ(nn0),(b) n+(1)n>Δ(nn0), Δ being any positive number.

[(a) n0=[Δ+1]: () n0=1+[Δ] or 2+[Δ], according as [Δ] is odd or even, i.e. n0=1+[Δ]+12{1+(1)[Δ]}.]

12. Determine the least value of n0 such that (a) n/(n2+1)<.0001,(b) (1/n)+{(1)n/n2}<.00001, when nn0. [Let us take the latter case. In the first place (1/n)+{(1)n/n2}(n+1)/n2, and it is easy to see that the least value of n0, such that (n+1)/n2<.000001 when nn0, is 1,000,002. But the inequality given is satisfied by n=1,000,001, and this is the value of n0 required.]


  1. See Bromwich’s Infinite Series, p. 485.↩︎

58-61. Definition of a limit and other definitions Main Page 63-68. General theorems concerning limits