DIFFERENCES

differences, calculus of (_theory of finite differences_), that branch of mathematics which deals with the successive differences of the terms of a series. 1. the most important of the cases to which mathematical methods can be applied are those in which the terms of the series are the values, taken at stated intervals (regular or irregular), of a continuously varying quantity. in these cases the formulae of finite differences enable certain quantities, whose exact value depends on the law of variation (i.e. the law which governs the relative magnitude of these terms) to be calculated, often with great accuracy, from the given terms of the series, without explicit reference to the law of variation itself. the methods used may be extended to cases where the series is a double series (series of double entry), i.e. where the value of each term depends on the values of a pair of other quantities. 2. the _first differences_ of a series are obtained by subtracting from each term the term immediately preceding it. if these are treated as terms of a new series, the first differences of this series are the _second differences_ of the original series; and so on. the successive differences are also called _differences of the first, second, ... order_. the differences of successive orders are most conveniently arranged in successive columns of a table thus:-- +-----+----------+-----------+-----------------+----------------------+ |term.| 1st diff.| 2nd diff. | 3rd diff. | 4th diff. | +-----+----------+-----------+-----------------+----------------------+ | | | | | | | a | | | | | | | b - a | | | | | b | | c - 2b +a | | | | | c - b | | d - 3c + 3b - a | | | c | | d - 2c +b | | e - 4d + 6c - 4b + a | | | d - c | | e - 3d + 3c - b | | | d | | e - 2d +c | | | | | e - d | | | | | e | | | | | +-----+----------+-----------+-----------------+----------------------+ _algebra of differences and sums._ [illustration: fig. 1.] 3. the formal relations between the terms of the series and the differences may be seen by comparing the arrangements (a) and (b) in fig. 1. in (a) the various terms and differences are the same as in § 2, but placed differently. in (b) we take a new series of terms [alpha], [beta], [gamma], [delta], commencing with the same term [alpha], and take the successive sums of pairs of terms, instead of the successive differences, but place them to the left instead of to the right. it will be seen, in the first place, that the successive terms in (a), reading downwards to the right, and the successive terms in (b), reading downwards to the left, consist each of a series of terms whose coefficients follow the binomial law; i.e. the coefficients in b - a, c - 2b + a, d - 3c + 3b - a, ... and in [alpha] + [beta], [alpha] + 2[beta] + [gamma], [alpha] + 3[beta] + 3[gamma] + [delta], ... are respectively the same as in y - x, (y - x)2, (y - x)3, ... and in x + y, (x + y)2, (x + y)3,.... in the second place, it will be seen that the relations between the various terms in (a) are identical with the relations between the similarly placed terms in (b); e.g. [beta] + [gamma] is the difference of [alpha] + 2[beta] + [gamma] and [alpha] + [beta], just as c - b is the difference of c and b: and d - c is the sum of c - b and d - 2c + b, just as [beta] + 2[gamma] + [delta] is the sum of [beta] + [gamma] and [gamma] + [delta]. hence if we take [beta], [gamma], [delta], ... of (b) as being the same as b - a, c - 2b + a, d -3c + 3b - a, ... of (a), all corresponding terms in the two diagrams will be the same. thus we obtain the two principal formulae connecting terms and differences. if we provisionally describe b - a, c - 2b + a, ... as the first, second, ... differences of the particular term a (§ 7), then (i.) the nth difference of a is n·n - 1 l - nk + ... + (-1)^(n-2) ------- c + (-1)^(n-1) nb + (-1)^n a, 1·2 where l, k ... are the (n + 1)th, nth, ... terms of the series a, b, c, ...; the coefficients being those of the terms in the expansion of (y -x)^n: and (ii.) the (n + 1)th term of the series, i.e. the nth term after a, is n·n - 1 a + n[beta] + ------- [gamma] + ... 1·2 where [beta], [gamma], ... are the first, second, ... differences of a; the coefficients being those of the terms in the expansion of (x + y)^n. 4. now suppose we treat the terms a, b, c, ... as being themselves the first differences of another series. then, if the first term of this series is n, the subsequent terms are n + a, n + a + b, n + a + b + c, ...; i.e. the difference between the (n + 1)th term and the first term is the sum of the first n terms of the original series. the term n, in the diagram (a), will come above and to the left of a; and we see, by (ii.) of § 3, that the sum of the first n terms of the original series is / n·n - 1 \ n·n - 1 n·n - 1·n - 2 ( n + na + ------- [beta] + ...) - n = na + ------- [beta] + ------------- [gamma] + ... \ 1·2 / 1·2 1 · 2 · 3 5. as an example, take the arithmetical series a, a + p, a + 2p, ... the first differences are p, p, p, ... and the differences of any higher order are zero. hence, by (ii.) of § 3, the (n + 1)th term is a + np, and, by § 4, the sum of the first n terms is na + 1⁄2n(n - 1)p = 1⁄2n{2a + (n - 1)p}. 6 as another example, take the series 1, 8, 27, ... the terms of which are the cubes of 1, 2, 3, ... the first, second and third differences of the first term are 7, 12 and 6, and it may be shown (§ 14 (i.)) that all differences of a higher order are zero. hence the sum of the first n terms is n·n - 1 n·n - 1·n - 2 n·n - 1·n - 2·n - 3 n + 7 ------- + 12 ------------- + 6 ------------------- = 1·2 1·2·3 1·2·3·4 1⁄4n^4 + 1⁄2n3 + 1⁄4n2 = {1⁄2n(n + 1)}2. 7. in § 3 we have described b - a, c - 2b + a, ... as the first, second, ... differences of a. this ascription of the differences to particular terms of the series is quite arbitrary. if we read the differences in the table of § 2 upwards to the right instead of downwards to the right, we might describe e - d, e - 2d + c, ... as the first, second, ... differences of e. on the other hand, the term of greatest weight in c -2b + a, i.e. the term which has the numerically greatest coefficient, is b, and therefore c - 2b + a might properly be regarded as the second difference of b, and similarly e - 4d + 6c - 4b + a might be regarded as the fourth difference of c. these three methods of regarding the differences lead to three different systems of notation, which are described in §§ 9, 10 and 11. _notation of differences and sums._ 8. it is convenient to denote the terms a, b, c, ... of the series by u0, u1, u2, u3, ... if we merely have the terms of the series, un may be regarded as meaning the (n + 1)th term. usually, however, the terms are the values of a quantity u, which is a function of another quantity x, and the values of x, to which a, b, c, ... correspond, proceed by a constant difference h. if x0 and u0 are a pair of corresponding values of x and u, and if any other value x0 + mh of x and the corresponding value of u are denoted by xm and um, then the terms of the series will be ... u_(n-2), u_(n-1), u_n, u_(n+1), u_(n+2) ..., corresponding to values of x denoted by ... x_(n-2), x_(n-1), x_n, x_(n+1), x_(n+2).... 9. in the _advancing-difference notation_ u_(n+1) - u_n is denoted by [delta]un. the differences [delta]u0, [delta]u1, [delta]u2 ... may then be regarded as values of a function [delta]u corresponding to values of x proceeding by constant difference h; and therefore [delta]u_(n+1) -[delta]u_n denoted by [delta][delta]u_n, or, more briefly, [delta]2u_n; and so on. hence the table of differences in § 2, with the corresponding values of x and of u placed opposite each other in the ordinary manner of mathematical tables, becomes +---------+---------+----------------+-----------------+-----------------+----------------------+ | x | u | 1st diff. | 2nd diff. | 3rd diff. | 4th diff. | +---------+---------+----------------+-----------------+-----------------+----------------------+ | . | . | . | . | . | . | | . | . | . | . | . | . | | . | . | . | . | . | . | | | | | | | | | x_(n-2) | u_(n-2) | | [delta]2u_(n-3) | | [delta]^4u_(n-4) ... | | | | [delta]u_(n-2) | | [delta]3u_(n-3) | | | x_(n-1) | u_(n-1) | | [delta]2u_(n-2) | | [delta]^4u_(n-3) ... | | | | [delta]u_(n-1) | | [delta]3u_(n-2) | | | xn | u_n | | [delta]2u_(n-1) | | [delta]^4u_(n-2) ... | | | | [delta]u_n | | [delta]3u_(n-1) | | | x_(n+1) | u_(n+1) | | [delta]2u_n | | [delta]^4u_(n-1) ... | | | | [delta]u_(n+1) | | [delta]3u_n | | | x_(n+2) | u_(n+2) | | [delta]2u_(n+1) | | [delta]^4u_n ... | | . | . | . | . | . | . | | . | . | . | . | . | . | | . | . | . | . | . | . | +---------+---------+----------------+-----------------+-----------------+----------------------+ the terms of the series of which ... u_(n-1), u_n, u_(n+1), ... are the first differences are denoted by [sigma]u, with proper suffixes, so that this series is ... [sigma]u_(n-1), [sigma]u_n, [sigma]u_(n+1).... the suffixes are chosen so that we may have [delta][sigma]un = un, whatever n may be; and therefore (§ 4) [sigma]un may be regarded as being the sum of the terms of the series up to and including un-1. thus if we write [sigma]u_(n-1) = c + un-2, where c is any constant, we shall have [sigma]u_n = [sigma]u_(n-1) + [delta][sigma]u_(n-1) = c + u_(n-2) + u_(n-1), [sigma]u_(n+1) = c + u_(n-2) + u_(n-1) + u_n, and so on. this is true whatever c may be, so that the knowledge of ... u_n-1, u_n, ... gives us no knowledge of the exact value of [sigma]u_n; in other words, c is an arbitrary constant, the value of which must be supposed to be the same throughout any operations in which we are concerned with values of [sigma]_u corresponding to different suffixes. there is another symbol e, used in conjunction with u to denote the next term in the series. thus eun means u_(n+1), so that eun = u_n + [delta]u_n. 10. corresponding to the advancing-difference notation there is a _receding-difference_ notation, in which u_(n+1) - u_n is regarded as a difference of u_(n+1), and may be denoted by [delta]'u_(n+1), and similarly u_(n+1) - 2u_n + u_(n-1) may be denoted by [delta]'2u_(n+1). this notation is only required for certain special purposes, and the usage is not settled (§ 19 (ii.)). 11. the _central-difference_ notation depends on treating u_(n+1) - 2u_n -u_(n-1) as the second difference of un, and therefore as corresponding to the value x_n; but there is no settled system of notation. the following seems to be the most convenient. since un is a function of x_n, and the second difference u_(n+2) - 2u_(n+1) + u_n is a function of x_(n+1), the first difference u_(n+1) - u_n must be regarded as a function of x_(n+1⁄2), i.e. of 1⁄2{x_n + x_(n+1)}. we therefore write u_(n+1) - u_n = [delta]u_(n+1⁄2), and each difference in the table in § 9 will have the same suffix as the value of x in the same horizontal line; or, if the difference is of an odd order, its suffix will be the means of those of the two nearest values of x. this is shown in the table below. in this notation, instead of using the symbol e, we use a symbol [mu] to denote the mean of two consecutive values of u, or of two consecutive differences of the same order, the suffixes being assigned on the same principle as in the case of the differences. thus [mu]u_(n+1⁄2) = 1⁄2{u_n + u_(n+1)}, [mu][delta]u_n = 1⁄2{[delta]u_(n-1⁄2)} + [delta]u_(n+1⁄2), &c. if we take the means of the differences of odd order immediately above and below the horizontal line through any value of x, these means, with the differences of even order in that line, constitute the _central differences_ of the corresponding value of u. thus the table of central differences is as follows, the values obtained as means being placed in brackets to distinguish them from the actual differences:-- +-------+-------+---------------------+----------------+----------------------+----------------------+ | x | u | 1st diff. | 2nd diff. | 3rd diff. | 4th diff. | +-------+-------+---------------------+----------------+----------------------+----------------------+ | . | . | . | . | . | . | | . | . | . | . | . | . | | . | . | . | . | . | . | |x_(n-2)|u_(n-2)| {[mu][delta]u_(n-2)}| [delta]2u_(n-2)| {[mu][delta]3u_(n-2)}| [delta]^4u_(n-2) ... | | | | [delta]u_(n-3/2) | | [delta]3u_(n-3/2) | | |x_(n-1)|u_(n-1)| {[mu][delta]u_(n-1)}| [delta]2u_(n-1)| {[mu][delta]3u_(n-1)}| [delta]^4u_(n-1) ... | | | | [delta]u_(n-1⁄2) | | [delta]3u_(n-2 | | |x_n |u_n | ([mu][delta]u_n) | [delta]2u_n | ([mu][delta]3u_n) | [delta]^4u_n ... | | | | [delta]u_(n+1⁄2) | | [delta]3u_(n+1⁄2) | | |x_(n+1)|u_(n+1)| {[mu][delta]u_(n+1)}| [delta]2u_(n+1)| {[mu][delta]3u_(n+1)}| [delta]^4u_(n+1) ... | | | | [delta]u_(n+3/2) | | [delta]3u_(n+3/2) | | |x_(n+2)|u_(n+2)| {[mu][delta]u_(n+2)}| [delta]2u_(n+2)| {[mu][delta]3u_(n+2)}| [delta]^4u_(n+2) ... | | . | . | . | . | . | . | | . | . | . | . | . | . | | . | . | . | . | . | . | +-------+-------+---------------------+----------------+----------------------+----------------------+ similarly, by taking the means of consecutive values of u and also of consecutive differences of even order, we should get a series of terms and differences central to the intervals x_(n-2) to x_(n-1), x_(n-1) to x_n, .... the terms of the series of which the values of u are the first differences are denoted by [sigma]u, with suffixes on the same principle; the suffixes being chosen so that [delta][sigma]un shall be equal to un. thus, if [sigma]u_(n-3/2) = c + u_(n-2), then [sigma]u_(n-1⁄2) = c + u_(n-2) + u_(n-1), [sigma]_(n+1⁄2) = c + u_(n-2) + u_(n-1) + u_n, &c., and also [mu][sigma]u_(n-1) = c + u_(n-2) + 1⁄2u_(n-1), [mu][sigma]u_n = c + u_(n-2) + u_(n-1) + 1⁄2u_n, &c., c being an arbitrary constant which must remain the same throughout any series of operations. _operators and symbolic methods._ 12. there are two further stages in the use of the symbols [delta], [sigma], [delta], [sigma], &c., which are not essential for elementary treatment but lead to powerful methods of deduction. (i.) instead of treating [delta]u as a function of x, so that [delta]u_n means ([delta]u)_n, we may regard [delta] as denoting an _operation_ performed on u, and take [delta]un as meaning [delta].u_n. this applies to the other symbols e, [delta], &c., whether taken simply or in combination. thus [delta]eu_n means that we first replace un by un+1, and then replace this by u_(n+2) - u_(n+1). (ii.) the operations [delta], e, [delta], and [mu], whether performed separately or in combination, or in combination also with numerical multipliers and with the operation of differentiation denoted by d (:= d/dx), follow the ordinary rules of algebra: e.g. [delta](u_n + v_n) = [delta]u_n + [delta]v_n, [delta]du_n = d[delta]u_n, &c. hence the symbols can be separated from the functions on which the operations are performed, and treated as if they were algebraical quantities. for instance, we have e·u_n = u_(n+1) = u_n + [delta]u_n = 1·u_n + [delta]·u_n, so that we may write e = 1 + [delta], or [delta] = e - 1. the first of these is nothing more than a statement, in concise form, that if we take two quantities, subtract the first from the second, and add the result to the first, we get the second. this seems almost a truism. but, if we deduce e^n = (1 + [delta])^n, [delta]^n = (e-1)^n, and expand by the binomial theorem and then operate on u0, we get the general formulae n·n - 1 un = u0 + n[delta]u0 + ------- [delta]^2u0 + ... + [delta]^nu0, 1·2 n·n - 1 [delta]^nu0 = u_n - nu_(n-1) + ------- u_(n-2) + ... + (-1)^nu0, 1·2 which are identical with the formulae in (ii.) and (i.) of § 3. (iii.) what has been said under (ii.) applies, with certain reservations, to the operations [sigma] and [sigma], and to the operation which represents integration. the latter is sometimes denoted by d^-1; and, since [delta][sigma]un = un, and [delta][sigma]u_n = u_n, we might similarly replace [sigma] and [sigma] by [delta]^-1 and [delta]^-1. these symbols can be combined with [delta], e, &c. according to the ordinary laws of algebra, provided that proper account is taken of the arbitrary constants introduced by the operations d^-1, [delta]^-1, [delta]^-1. _applications to algebraical series._ 13. _summation of series._--if ur, denotes the (r+1)th term of a series, and if vr is a function of r such that [delta]v_r = u_r for all integral values of r, then the sum of the terms u_m, u_(m+1), ... un is v_(n+1) -v_m. thus the sum of a number of terms of a series may often be found by inspection, in the same kind of way that an integral is found. 14. _rational integral functions._--(i.) if u_r is a rational integral function of r of degree p, then [delta]ur, is a rational integral function of r of degree p-1. (ii.) a particular case is that of a _factorial_, i.e. a product of the form (r+a+1) (r+a+2) ... (r+b), each factor exceeding the preceding factor by 1. we have [delta]·(r+a+1) (r+a+2) ... (r+b) = (b-a)·(r+a+2) ... (r+b), whence, changing a into a-1, [sigma](r+a+1)(r+a+2) ... (r+b) = _const._ + (r+a)(r+a+1) ... (r+b)/(b-a+1). a similar method can be applied to the series whose (r+1)th term is of the form 1/(r+a+1) (r+a+2) ... (r+b). (iii.) any rational integral function can be converted into the sum of a number of factorials; and thus the sum of a series of which such a function is the general term can be found. for example, it may be shown in this way that the sum of the pth powers of the first n natural numbers is a rational integral function of n of degree p+1, the coefficient of n^p+1 being 1/(p+1). 15. _difference-equations._--the summation of the series ... + u_(n+2) + u_(n-1) + u_n is a solution of the _difference-equation_ [delta]v_n = u_(n+1), which may also be written (e-1)v_n = u_(n+1). this is a simple form of difference-equation. there are several forms which have been investigated; a simple form, more general than the above, is the _linear equation_ with _constant coefficients_-- v_(n+m) + a1v_(n+m-1) + a2v_(n+m-2) + ... + a_mv_n = n, where a1, a2, ... am are constants, and n is a given function of n. this may be written (e^m + a1e^(m-1) + ... + a_m)v_n = n or (e-p1)(e-p2) ... (e-p_m)v_n = n. the solution, if p1, p2, ... pm are all different, is vn = c1p1^n + c2p2^n + ... + c_mp_m^n + v_n, where c1, c2 ... are constants, and v_n = v_n is any one solution of the equation. the method of finding a value for vn depends on the form of n. certain modifications are required when two or more of the p's are equal. it should be observed, in all cases of this kind, that, in describing c1, c2 as "constants," it is meant that the value of any one, as c1, is the same for all values of n occurring in the series. a "constant" may, however, be a periodic function of n. _applications to continuous functions._ 16. the cases of greatest practical importance are those in which u is a continuous function of x. the terms u1, u2 ... of the series then represent the successive values of u corresponding to x = x1, x2.... the important applications of the theory in these cases are to (i.) relations between differences and differential coefficients, (ii.) interpolation, or the determination of intermediate values of u, and (iii.) relations between sums and integrals. 17. starting from any pair of values x0 and u0, we may suppose the interval h from x0 to x1 to be divided into q equal portions. if we suppose the corresponding values of u to be obtained, and their differences taken, the successive advancing differences of u0 being denoted by dpu0, dp2u0 ..., we have (§ 3 (ii.)) q·q - 1 u1 = u0 + qdpu0 + ------- dp2u0 + .... 1·2 when q is made indefinitely great, this (writing f(x) for u) becomes taylor's theorem (infinitesimal calculus) h2 f(x + h) = f(x) + hf'(x) + --- f"(x) + ..., 1·2 which, expressed in terms of operators, is h2 h3 e = 1 + hd + ---d2 + ----- d3 + ... = e^(hd). 1·2 1·2·3 this gives the relation between [delta] and d. also we have 2q·2q - 1 u2 = u0 + 2qdpu0 + --------- dp2u0 + ... 1·2 3q·3q - 1 u3 = u0 + 3qdpu0 + --------- dp2u0 + ... 1·2 . . . . . . and, if p is any integer, p·p - 1 u_(p/q) = u0 + pdpu0 + ------- dp2u0 + .... 1·2 from these equations up/q could be expressed in terms of u0, u1, u2, ...; this is a particular case of interpolation (q.v.). 18. _differences and differential coefficients._--the various formulae are most quickly obtained by symbolical methods; i.e. by dealing with the operators [delta], e, d, ... as if they were algebraical quantities. thus the relation e = e^(hd) (§ 17) gives hd = log_e (1 + [delta]) = [delta] - 1⁄2[delta]2 + 1/3 [delta]3 ... /du\ or h( -- ) = [delta]u0 - 1⁄2[delta]2u0 + 1/3 [delta]3u0 .... \dx/0 the formulae connecting central differences with differential coefficients are based on the relations [mu] = cosh 1⁄2hd = 1⁄2(e^ 1⁄2hd + e^ -1⁄2hd), [delta] = 2 sinh 1⁄2hd - e^ 1⁄2hd - e^ -1⁄2hd, and may be grouped as follows:-- u0 = u0 \ | [mu][delta]u0 = (hd + 1/6 h3d3 + 1/120 h^5 d^5 + ...)u0 | | [delta]2u0 = (h2d2 + 1/12 h^4 d^4 + 1/360 h^6 d^6 + ...)u0 > | [mu][delta]3u0 = (h3d3 + 1/4 h^5 d^5 + ...)u0 | | [delta]^4 u0 = (h^4 d^4 + 1/6 h^6 d^6 + ...)u0 / . . . . . . . . . [mu]u_1⁄2 = (1 + 1/8 h2d2 + 1/384 h^4 d^4 + 1/46080 h^6 d^6 + ...)u_1⁄2 \ | [delta]u_1⁄2 = (hd + 1/24 h3d3 + 1/1920 h^5 d^5 + ...)u_1⁄2 | | [mu][delta]2u_1⁄2 = (h2d2 + 5/24 h^4 d^4 + 91/5760 h^6 d^6 + ...)u_1⁄2 > | [delta]3u_1⁄2 = (h3d3 + 1/8 h^5 d^5 + ...)u_1⁄2 | | [mu][delta]^4 u_1⁄2 = (h^4 d^4 + 7/24 h^6 d^6 + ...)u_1⁄2 / . . . . . . . . . u0 = u0 \ | hdu0 = ([mu][delta] - 1/6 [mu][delta]3 + 1/30 [mu][delta]^5 - ...)u0 | | h2d2u0 = ([delta]2 - 1/12 [delta]^4 + 1/90 [delta]^6 - ...)u0 > | h3d3u0 = ([mu][delta]3 1/4 [mu][delta]^5 + ...)u0 | | h^4 d^4 u_0 = ([delta]^4 - 1/6 [delta]^6 + ...)u0 / . . . . . . . . . u_1⁄2 = ([mu] - 1/8 [mu][delta]2 + 3/128 [mu][delta]^4 - 5/1024 [mu][delta]^6 + ...)u_1⁄2 \ | hdu_1⁄2 = ([delta] - 1/24 [delta]3 + 3/640 [delta]^5 - ...)u_1⁄2 | | h2d2u_1⁄2 = ([mu][delta]2 - 5/24 [mu][delta]^ + 259/5760 [mu][delta]^6 - ...)u_1⁄2 > | h3d3u_1⁄2 = ([delta]3 - 1/8 [delta]^5 + ...)u_1⁄2 | | h^4 d^4 u_1⁄2 = ([mu][delta]^4 - 7/24 [mu][delta]^6 + ...)u_1⁄2 / . . . . . . . . . when u is a rational integral function of x, each of the above series is a terminating series. in other cases the series will be an infinite one, and may be divergent; but it may be used for purposes of approximation up to a certain point, and there will be a "remainder," the limits of whose magnitude will be determinate. 19. _sums and integrals._--the relation between a sum and an integral is usually expressed by the _euler-maclaurin formula_. the principle of this formula is that, if um and um+1, are ordinates of a curve, distant h from one another, then for a first approximation to the area of the curve between um and um+1 we have 1⁄2h(u_m + u_m+1), and the difference between this and the true value of the area can be expressed as the difference of two expressions, one of which is a function of x_m, and the other is the same function of x_m+1. denoting these by [phi](x_m) and [phi](xm+1), we have _ x_m+1 / | udx = 1⁄2h(u_m + u_m+1) + [phi](x_m+1 ) - [phi](x_m). _/x_m adding a series of similar expressions, we find _ x_n / | udx = h{1⁄2u_m + u_m+1 + u_m+2 + ... + u_n-1 + 1⁄2u_n} + [phi](x_n) - [phi](x_m). _/x_m the function [phi](x) can be expressed in terms either of differential coefficients of u or of advancing or central differences; thus there are three formulae. (i.) the euler-maclaurin formula, properly so called, (due independently to euler and maclaurin) is _ x_n / 1 du_n 1 d3u_n 1 d^5 u_n | udx = h·[mu][sigma]u_n - -- h2 ---- + --- h^4 ----- - ----- h^6 ------- + ... _/x_m 12 dx 720 dx3 30240 dx^5 b1 du_n b2 d3u_n b3 d^5u_n = h·[mu][sigma]u_n - -- h2 ---- + -- h^4 ----- - -- h^6 ------ + ..., 2! dx 4! dx3 6! dx^5 where b1, b2, b3 ... are _bernoulli's numbers_. (ii.) if we express differential coefficients in terms of advancing differences, we get a theorem which is due to laplace:-- _ x_n 1 / - | udx = [mu][sigma](u_n - u0) - 1/12 ([delta]u_n - [delta]u0) + 1/24 ( [delta]2u_n - [delta]2u0) h _/x0 - 19/720 ([delta]3u_n - [delta]3u_0) + 3/160 ([delta]^4 u_n - [delta]^4 u0) - ... for practical calculations this may more conveniently be written _ x_n 1 / - | udx = [mu][sigma](u_n - u0) + 1/12 ([delta]u0 - 1⁄2[delta]2u0 + 19/60 [delta]3u0 - ...) h _/x0 + 1/12 ([delta]'u_n - 1⁄2[delta]'2u_n + 19/60 [delta]'3u_n - ...), where accented differences denote that the values of u are read backwards from un; i.e. [delta]'un denotes u_n-1 - u_n, not (as in § 10) u_n - u_n-1. (iii.) expressed in terms of central differences this becomes _ x_n 1 / - | udx = [mu][sigma](u_n - u0) - 1/12 [mu][delta]u_n + 11/720 [mu][delta]3u_n - ... h _/x0 + 1/12 [mu][delta]u0 - 11/720 [mu][delta]3u0 + ... / 1 11 191 2497 \ / \ = [mu]([sigma] - -- [delta] + --- [delta]3 - ----- [delta]^5 + ------- [delta]^7 - ...)(u_n - u0). \ 12 720 60480 3628800 / \ / (iv.) there are variants of these formulae, due to taking hum+1⁄2 as the first approximation to the area of the curve between um and um+1; the formulae involve the sum u_1⁄2 + u_3/2 + ... + u_n-1⁄2 := [sigma](u_n - u0) (see mensuration). 20. the formulae in the last section can be obtained by symbolical methods from the relation _ 1 / 1 1 - | udx = - d^1 u = --·u. h _/ h hd thus for central differences, if we write [theta] := 1⁄2hd, we have [mu] = cosh [theta], [delta] = 2 sinh [theta], [sigma] = [delta]^-1, and the result in (iii.) corresponds to the formula / / 1 2 2·4 \ sinh [theta] = [theta] cosh [theta]/ (1 + - sinh2[theta] - --- sinh^4[theta] + ----- sinh^6[theta] - ...). / \ 3 3·5 3·5·7 / references.--there is no recent english work on the theory of finite differences as a whole. g. boole's _finite differences_ (1st ed., 1860, 2nd ed., edited by j. f. moulton, 1872) is a comprehensive treatise, in which symbolical methods are employed very early. a. a. markoff's _differenzenrechnung_ (german trans., 1896) contains general formulae. (both these works ignore central differences.) _encycl. der math. wiss._ vol. i. pt. 2, pp. 919-935, may also be consulted. an elementary treatment of the subject will be found in many text-books, e.g. g. chrystal's _algebra_ (pt. 2, ch. xxxi.). a. w. sunderland, _notes on finite differences_ (1885), is intended for actuarial students. various central-difference formulae with references are given in _proc. lond. math. soc._ xxxi. pp. 449-488. for other references see interpolation. (w. f. sh.)