Εικόνες σελίδας
PDF
Ηλεκτρ. έκδοση

Of the Method by Differences.

209. Let a, b, c, d . . . . &c., represent the successive terms of a series formed according to any fixed law; then if each term be subtracted from the succeeding one, the several re mainders will form a new series called the first order of dif ferences. If we subtract each term of this series from the succeeding one, we shall form another series called the second order of differences, and so on, as exhibited in the annexed table.

[merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][ocr errors][merged small]

If, now, we designate the first terms of the first, second. third, &c. orders of differences, by d1, da, da, da, &c., we shall

[blocks in formation]

6d1⁄2

de-4d6c4b+a, whence ea + 4d1 + 6d2 + 4d + da,

[blocks in formation]

terms before it, by T, we shall find, by a continuation of

[merged small][merged small][merged small][merged small][merged small][ocr errors][merged small][merged small][merged small][merged small][ocr errors][merged small][ocr errors][merged small][merged small][merged small][merged small][merged small][ocr errors][merged small][merged small][ocr errors][merged small][merged small][merged small]

This formula enables us to find the (n + 1)th term of a series when we know the first terms of the successive orders of differences.

210. To find an expression for the sum of n terms of the series a, b, c, &c., let us take the series

[merged small][merged small][merged small][merged small][merged small][merged small][ocr errors][merged small][merged small]

Now, it is obvious that the sum of n terms of the series (3), is equal to the (n + 1)th term of the series (2).

But the first term of the first order of differences in series (2) is a; the first term of the second order of differences is the same as d in equation (1). The first term of the third order of differences is equal to d2, and so on.

Hence, making these changes in formula (1), and denoting the sum of n terms by S, we have,

[merged small][merged small][ocr errors][merged small][merged small][merged small][merged small][merged small][merged small]

When all of the terms of any order of differences become

orders of differences are 0, When there are

equal, the terms of all succeeding
and formulas (1) and (4) give exact results.

no orders of differences, whose terms become equal, then formulas do not give exact results, but approximations more or less exact according to the number of terms used.

EXAMPLES.

1. Find the sum of n terms of the series 1.2, 2.3, 3.4, 4.5, &c.

[blocks in formation]

Hence, we have, a = 2, d, 4, d1 = 2, dg, da, &c., equal

[ocr errors]

to 0.

Substituting these values for a, d1, d2, &c., in formula (4),

[blocks in formation]

2. Find the sum of n terms of the series 1.2.3, 2.3.4,

3.4.5, 4.5.6, &c.

1st order of differences, 18, 36, 60, 90,

2d order of differences,

3d order of differences,

4th order of differences,

126, &c.

[blocks in formation]

=

We find a 6, d1 = 18, d2 = 18, da 6, d1 = 0, &c.

=

Substituting in equation (4), and reducing, we find,

[blocks in formation]

3. Find the sum of n terms of the series 1, 1+2, 1+2+3, 1+2+3+4, &c.

[merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][ocr errors][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small]

4. Find the sum of n terms of the series 12, 22, 32, 42, 52, &c.

We find, a = 1, d1 = 3, d2 = 2, d2 = 0, d1 = 0, &c., &c.

Substituting these values in formula (4), and reducing, we find, n(n + 1) (2n + 1)

S=

1.2.3

1.2 3

5. Find the sum of n terms of the series,

1.(m+1), 2(m + 2), 3 (m+3), 4 (m + 4), &c.

We find, am + 1, d1 = m + 3, d2 = 2, ds = 0, &c.;

[merged small][ocr errors][merged small][merged small][merged small][merged small][merged small][ocr errors][merged small][merged small][merged small][merged small][merged small][merged small]

The last three formulas deduced, are of practical application in determining the number of balls in different shaped piles.

First, in the Triangular Pile.

[graphic]
[ocr errors]

211. A triangular pile is formed of succcessive triangular layers, such that the number of shot in each side of the layers, decreases continuously by 1 to the single shot at the top. The number of balls in a complete triangular pile is evidently equal to the sum of the series 1, 1+2, 1+ 2+ 3, 1+ 2+ 3 +4, &c. to 1+2+

on one side of the base.

+n, n denoting the number of balls

But from example 3d, last article, we find the sum of n terms of the series,

[merged small][merged small][merged small][merged small][merged small][ocr errors][merged small]

Second, in the Square Pile.

212. The square pile is formed, as shown in the figure. The number of balls in the top layer is 1; the number in the second layer is denoted by 22; in the next, by 32, and so on. Hence, the number of balls in a pile of n layers, is equal to the sum of the series, 12, 22 32,

[graphic]

c., n2, which we see, from example 4th of the last article, is

[merged small][merged small][merged small][merged small][merged small][merged small][merged small][graphic]

213. The complete oblong pile has (m+1) balls in the upper layer, 2. (m + 2) in the next layer, 3 (m+3) in the third, and so on: hence, the number of balls in the complete pile, is given by the formula deduced in example 5th of the preceding article,

S=

n. (n+1). (1+2n + 3m)

1. 2

3

(3).

214. If any of these piles is incomplete, compute the num ber of balls that it would contain if complete, and the number that would be required to complete it; the excess of the former over the latter, will be the number of balls in the pile.

The formulas (1), (2) and (3) may be written,

[merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][merged small][ocr errors][merged small][merged small][merged small][merged small][merged small]

angular face of each pile, and the next factor, the number of balls in the longest line of the base, plus the number in the side of the base opposite, plus the parallel top row, we have the following

« ΠροηγούμενηΣυνέχεια »