Arithmetic Triangle. Luís Dias Ferreira 1

Transcription

1 Arithmetic Triangle Luís Dias Ferreira Colégio Valsassina, Av. Teixeira da Mota, Quinta das Teresinhas, Lisboa, Portugal Journal of Mathematics Research; Vol. 9, No. 2; April 207 ISSN E-ISSN Published by Canadian Center of Science and Education Correspondence: Luís Dias Ferreira, Av. Teixeira da Mota, Quinta das Teresinhas, Lisboa, Portugal. Tel: Received: February 0, 207 Accepted: March 7, 207 Online Published: March 2, 207 doi:0.5539/jmr.v9n2p00 Abstract URL: The product of the first n terms of an arithmetic progression may be developed in a polynomial of n terms. Each one of them presents a coefficient C nk that is independent from the initial term and the common difference of the progression. The most interesting point is that one may construct an Arithmetic Triangle, displaying these coefficients, in a similar way one does with Pascal s Triangle. Moreover, some remarkable properties, mainly concerning factorials, characterize the Triangle. Other related triangles eventually treated as matrices also display curious facts, in their linear modus operandi, such as successive descendances. Keywords: arithmetic progression, factorials of order k, arithmetic triangle, descendant matrices, progressive matrix, matrix column product, harmonic numbers.. Introduction What is the product of the first n terms of an arithmetic progression? Contrary to geometrical progressions, where simple equations allow to calculate the sum or the product of its first n terms, the issue concerning the product for an arithmetic progression is not so easy. However, its study brings some fascinating results and, to my knowledge, new concepts in Linear Algebra. I propose a little journey on this subject. First of all, I discovered that it relates to the starting point of a paper of mine, on Integer Binomial Plan, published in this same journal, in August 200 (Ferreira), presenting a generalization on factorials and binomial coefficients to all integers. Since then I never returned to the subject till recently, when a student asked me if I knew a formula for the product of the first n terms of an arithmetic progression: a, a 2 = a + d, a 3 = a + 2d,..., a n = a + (n ) d,.... () I didn t; but then we began thinking on the problem. Let P n = a a 2... a n. Following a simple procedure, remarking that P n = P n [a + (n )d] and beginning with P = a, we soon found out that P n may be expressed by a sum of n terms concerning powers of a and d multiplied by n coefficients, which are independent from those variables. We followed the procedure up to n = 5: P = a P 2 = a 2 + a d P 3 = a a2 d + 2 a d 2 P 4 = a a3 d + a2 d2 + 6 a d 3 P 5 = a a4 d + 35 a3 d a 2 d a d 4, so we could establish the coefficients triangle

2 This reminds Newton s Binomial and Pascal s Triangle. The question which naturally arises is: may one built this Arithmetic Triangle in a similar way one does with binomial coefficients? To eventually achieve this goal, one must find and understand the pattern underneath, which is not self-evident. But the answer to the question is affirmative. In fact, later that day, I found out that we may indeed construct the triangle progressively, in a similar way we do with Pascal s triangle. To my surprise, however, this issue brought back complete and incomplete factorials. The search for an answer and some collateral results are the subject of this article. I must point out that also surprisingly the solution found corresponds closely to the unsigned Stirling numbers of the first kind, which I didn t know. Several papers have been recently produced concerning Stirling numbers and cyclic groups, for instance (Broder, 984) and (Deveci & Akuzum, 204); or Pascal matrices (Deveci & Karaduman, 202) and (Hiller, 206). But they don t seem especially relevant to this article, which essentially deals with basic stuff. 2.. Factorial of Order k Consider a real number x and an integer k, along with the special case 0! = ; the x factorial of order k is defined by (read x k factorial ) x! x (k)! = (x k)!, (2) or, for k > 0, x (k)! = k (x i + ) = x (x )... (x k + ) ; (2.a) in this case, x (k)! is an incomplete factorial, the product of the k major values of x!. We assume that the definition above may be extended to negative order numbers; but then we conclude that Remark that x ( k)! = x (0)! = x (x)! = x! (x + k) (k)!. (3) x ()! = x, for x 0 x ( )! = x+, for x. This proofs to be quite consistent. Generally speaking, as I explained in (Ferreira), factorials of order k must be seen as limits of a quotient. Besides, as presupposed in the generalization of x (k)! from positive to negative numbers x, if k > 0 this factorial represents the product of the k values presented in equation (2.a) even for x < 0, where x! =. For instance, ( 8) (3)! = ( 8)! ( 8) ( 9) ( 0) ( )! = = ( 8) ( 9) ( 0) = 720 ; ( )! ( )! if k < 0, then, according to (3), n (k)! represents the inverse of a product of k factors: In these terms, of course ( 8) ( 3)! = ( 5) (3)! = ( 5) ( 6) ( 7) = 20. ( n k ) = n (k)! k! is a generalized binomial coefficient and so, the development in MacLaurin series of the function y = ( + x) n may be written as + ( ) n + ( + x) n =. x k k n (k)! = k! xk. 2.2 Rising and Falling Factorials k=0 In a rapid web research, these days, I found out that the concept of x (k)! was already known, with other name and symbol(s), since the end of the 9th Century; it has been introduced by Leo A. Pochhammer with the notation (x) k. I was quite surprised but, anyway, Pochhammer doesn t consider negative integers for k. k=0 (4) 0

3 I also discovered the useful concept of rising factorial in contrast with falling factorial, this is, x (k)!, which I ll note by x (k)! ; for x 0 and positive integer k: It s easy to see that x (k)! = k (x + i ) = x (x + )... (x + k ). (5) x (k)! = (x + k ) (k)! or x (k)! = (x k + ) (k)! ; (5.a) For instance, 7 (4)! = 0 (4)! = Based on the assumption that the equality (5.a) must stand for any values of x and k and keeping in mind the equation (2), we ll generically define the rising factorial x (k)! by x (k)! = (x + k )!. (6) (x )! Therefore, as particular cases, we obtain x (0)! = (k)! = k!. Besides, we ll consider (5.a) also valid for negative order number k; but then, according to (3): x ( k)! = (x ) (k)!. (7) Finally: to simplify, we may read x (k)! and x (k)! respectively as x down k factorial and x up k factorial. 2.3 New Generalization on Factorials Let s resume the arithmetic progression a = a, a 2 = a + d, a 3 = a + 2d,..., a n = a + (n ) d,..., where a is the initial term. The constant d is usually known as the common difference of successive members; I will call it the increment of the progression. Let P n be the product of the first n terms of this arithmetic progression. It s quite evident that: for a = d = : P n = n! ; We ll say that this is an unitary arithmetic progression (u.a.p.) on basis (its initial term). for a = a and d = : P n = a (n)! = (a + n ) (n)!. Now, we may put the n-th term of the progression above in the form [ a ] a n = d d + (n ) and the expression between brackets corresponds to an u.a.p. on basis a/d. In this case, P n = n a i = d n n [ a ] d + (i ) and we ll identify P n with the a rising factorial of increment d and order n, noted by a (d ; n)! (read a up d n factorial ): a (d ; n)! = d n ( a d ) (n)!. (8) This relates to the a falling factorial of increment d and order n, noted by a (d ; n)! (read a down d n factorial ) as follows: ( a ) a (d ; n)! = d n!, (9) d (n) 02

4 in such a way that As a particular case, from (8): a (d ; n)! = [a (n ) d] (d ; n)! and a (d ; n)! = [a + (n ) d] (d ; n)!, a = d a (a ; n)! = a n (n)! = a n n!. Of course, making d =, we recover the simple rising and falling factorials a ( ; n)! = a (n)! and a ( ; n)! = a (n)!. 3. Arithmetic Coefficients The key point to discover the rule for building the Arithmetic Triangle is to notice that, because of the linear nature of an arithmetic progression, each P n proceeds from the precedent P n in a similar linear way. Our goal is to discover the n coefficients C nk (or C n;k ) that allow us to write, making a = a, the product P n as P n = n C nk a n k+ d k = C n a n d 0 + C n2 a n d + + C nk a n k+ d k + + C nn a d n. (0) k= We ll call these C nk the arithmetic coefficients for the product P n. Since the coefficients C nk are independent from a and d, we ll make d = in the following deduction [the numbers in bold correspond to n in each case]. P = a C =. P 2 = C a a + }{{} n = C C a 2 2 = C = + C a C 22 = (n ) C P 3 = ( C 2 a 2 + C 22 a ) a + }{{} n 2 = C 2 a 3 + (2 C 2 + C 22 ) a C 22 a P 4 = ( C 3 a 3 + C 32 a 2 + C 33 a ) a + }{{} n 3 = C 3 a 4 + (3 C 3 + C 32 ) a 3 + (3 C 32 + C 33 ) a C 33 a C 3 = C 2 = C 32 = (n ) C 2 + C 22 C 33 = (n ) C 22 C 4 = C 3 = C 42 = (n ) C 3 + C 32 C 43 = (n ) C 32 + C 33 C 44 = (n ) C 33. This is enough to recognize the pattern. We see that C n =, for every n, and we obtain the general rule: C n = C nk = (n ) C n ; k + C n ; k C nn = (n ) C n ; n, for n >. () A more formal demonstration follows the same path, as we ll see in the sequence. As a matter of fact, the single line is sufficient if we understand that it must be C nk = (n ) C n ; k + C n ; k C nk = 0 for k < or k > n. (2) This is because k < corresponds to the left wing this is, the negative-increment terms and k > n to upper terms in the progression; in both cases, these terms are out of the product P n. The last condition also corresponds to the empty spaces in the Arithmetic Triangle. Furthermore, we ll generalize C n = to n = 0, resulting C = 0 C } {{ 00 + C } 0 =. }{{} 0 03

5 Theorem. If P n is the product of the first n terms of the arithmetic progression given by a k = a + (n ) k, then P n = n k= C nk a n k+ d k with C nk = (n ) C n ; k + C n ; k. (3) Proof. It s a proof by induction: ) The equation above is obviously valid for P = a. 2) Let P n = n k= C n ; k a n k d k. 3) Then, P n = P n [a (n ) d] For each k in the resulting sum, we ll have two terms: C n ; k a n k+ d k + C n ; k a n k d k So, if we make k = i and k = i, we ll get k = i : C n ; i a n +2 d 2 + (n ) C n ; i a n i+ d i k = i : C n ; i a n i+ d i + (n ) C n ; i a n i d i Remark that the second term for (i ) combines with the first one for i : [ (n ) Cn ; i + C n ; i ] a n i+ d i This is valid for every i, therefore for every k ; but the indexes of C nk relates to the product a n k+ d k and, so, the expression between brackets corresponds to C nk, which means that C nk = (n ) C n ; k + C n ; k. Based on (3) or (), one can progressively construct the Arithmetic Triangle: n= n=2 n=3 3 2 n=4 6 6 n= n= n= n= n= n= (4) Each set of Arithmetic Coefficients this is, for each value of n displays the following remarkable properties: n k= C nk = n! C nn = (n )! For n > : n k= C nk = n! (n )! = (n ) (n )! For n > : n k= ( )(k ) C nk = 0. The first equality is self-evident because, as we have seen, making a = d = (u.a.p. on basis ), P n is the product of the n integers from to n, this is, n factorial. The second comes from a recurrence relation: from (3) and (2), remembering 04

6 that C = = 0!, we get, for n >, since C n ; n = 0: C nn = (n ) C n ; n ; so, C 22 = C =! C 33 = 2 C 22 = 2! = 2! C 44 = 3 C 33 = 3 2! = 3!... C nn = (n ) C n ; n = (n )!. The third equality results from combining the previous two. Finally, the fourth equality which we may call an alternate sum comes from the fact that, if we consider the left wing of the u.a.p. on basis (by simply making d = ), it results a 2 = 0 and, so, for n >, each product P n includes the zero. For instance, making n = 6: 6 k= C 6k = = 720 = 6! C 66 = 5! = 20 5 k= C 6k = = 600 = 5 5! 6 k= ( )(k ) C 6k = = 0. An important feature here is that the use of the Arithmetic Coefficients transform products, n!, into sums, both with n terms. Concerning these coefficients, here s another interesting fact: n k= C kk = n k= (n k)! = n k= k!. This is the product of the diagonal terms of the Arithmetic Triangle up from to n. Following Neil Sloane and Simon Plouffe, it may be useful to define, for a positive integer n, the n superfactorial I ll note n! instead of sf(n) as n! = n! (n )! = n k= k! = n! (n )! (n 2)!... 2!!, (5) which is equivalent to n! = n k n k+ = n (n ) 2 (n 2) n n. This last equality also results from a recurrence relation; informally: 2! = 2!! 3! = 3! }{{} 3 2! k= 2!! = 3 (2!) 2! = 3 ( 2! }{{} 2! ) 2! = ! = }{{} 4! 3! = 4 (3 2 ) ( ) = !... n! = }{{} n! (n )! = n (n )! (n )! = n (n ) 2 (n 2) n n. n (n )! (5.a) We may write, then: n k= C kk = (n )! For instance, for n = 6: 6 k= C kk = 5! = = Consider now some other cases for the arithmetic progression:. a = d : a n k+ d k = a n and P n = a n n k= C nk = a n n!. 2. As a particular case, a = d = : P n = ( ) n n k= C nk = ( ) n n! = ( ) (n)! = ( n) (n)! according to Theorem 2 in (Ferreira) and equation (5.a) above. 05

7 3. As another particular case, a = d = 2 : k... ; this is the set of even numbers and it results 2 (2;n)! = (2n)!! = P n = 2 n n k= C nk = 2 n n! [where (2n)!! is the double factorial of m = 2n]. For instance, 8!! = P 4 = 2 4 ( ) = 2 4 4! = 6 24 = a = and d = 2 : k... ; this is now the set of odd numbers and it results (2;n)! = (2n )!! = P n = n k= 2k C nk [where (2n )!! is the double factorial of m = 2n ]. For instance, 9!! = P 5 = = = Making d = : P n = n C ni a n i+ = a n (n)! = a (n)!, for a given a or a n = a + n. For instance, making a 5 = 0, then a = 6, this corresponding to the progression , then P 5 = 5 C 5i 6 6 i = = = 0 (5)! = 6 (5)! 4. Direct Determination of Arithmetic Coefficients 4. Sum-factorials My goal here was to establish an explicit equation (or equations) allowing to directly obtain whatever coefficient C nk, independently from the Arithmetic Triangle (as one does with binomial numbers). Unfortunately, I haven t been able to induce a simple formula; in the end, for k > 4, we stumble on a recursive method of the kind. Anyway, some interesting results appear. So, first of all, it is convenient to define the x sum-factorial (also known as x-th triangular number ) as x x = i = (x ) + x = (x + ) (2)!, (6) 2 or x = x + (x ), together with the special case 0 = 0; and, for a non-negative integer k, the x sum-factorial of order k as x (k) = x (x k) = k (x i + ) = x + (x ) + + (x k + ) = k 2 (2x k + ), (7) this is, the sum of the k major values of x. As for product-factorials x (k)!, we ll consider that the definition of x (k) also stands for negative integers k; the result is x ( k) = [(x + k) x ] = (x + k) (k) = k 2 (2x + k + ). (8) It s easy to see that, as particular cases, The infinite sequence of u j = j is x (0) = 0 x (x) = x x () = x x ( ) = (x + ) Finally, as a curiosity, if we consider x (k) as a falling sum-factorial, then the x rising sum-factorial is x (k) = k (x + i ) = x + (x + ) + + (x + k ) = k 2 (2x + k ). (9) 06

8 4.2 Obtaining Arithmetic Coefficients Coming back to the C nk issue, rather than providing exhaustive proofs, we ll take an inductive path. This, I think, is enough for the moment and more instructive. We ll proceed step by step, each column at a time, increasing the value of k, always keeping in mind that C nk = 0 for k > n and the recursive relation C nk = (n ) C n ; k + C n ; k.. First of all, we know that C n =. Then, it s easy to conclude that, for k = 2: C 22 = + 0 = C 32 = 2 C 2 + C 22 = 2 + C 42 = 3 C 3 + C 32 = C 52 = 4 C 4 + C 42 = , this is, C n2 = (n ) = n 2 ( + n ) C n2 = 2 n (2)! = n 2. (20) 2. We ll proceed in the same way for k = 3: C 23 = 0 C 33 = 2 C 22 + C 23 = (2)! C 43 = 3 C 32 + C 33 = [ 2 3 3(2)! (2)! ] C 53 = 4 C 42 + C 43 = [ 2 4 4(2)! (2)! (2)! ]..., this is, where C n3 = 2 n j=2 j j (2)! = n j=2 F j, (2) F j = 2 j j (2)! = j j 2. (22) These are the values for the F j, j from to 2: F = 0 F 2 = 2 F 3 = 9 F 4 = 24 F 5 = 50 F 6 = 90 F 7 = 42 F 8 = 224 F 9 = 324 F 0 = 450 F = 605 F 2 = 792. (22.a) So, for instance, C 73 = 6 j=2 F j = = Let s examine now the case of k = 4: C 34 = 0 C 44 = 3 C 33 + C 34 = 3F 2 C 54 = 4 C 43 + C 44 = 4F 3 + (4 + 3) F 2 = 4 () F (2) F 2 C 64 = 5 C 53 + C 54 = 5 () F (2) F (3) F 2..., this is, We ll write this as C n4 = n 3 (n ) (i) F n i. (23) n 3 C n4 = A i n4 F n i ; (23.a) 07

9 making A i n4 = (n ) (i) = i (2n i ). (24) 2 where i is not an exponent but an upper index. Remark that The values for A i n4 (where i n 3) are: A 0 n4 = 0, A n4 = n and, for n > 4, Ai n4 = Ai n4 + (n i). i n=4 3 n=5 4 7 n= n= n= n= n= n= n= (25) For instance, making n = 8, we get C 84 = 5 Ai 84 F n i = A 84 F 6 + A 2 84 F 5 + A 3 84 F 4 + A 4 84 F 3 + A 5 84 F 2 = = 960. OBS.: we ll necessarily note C n;k or A i n;k in the case of n or k being two digits numbers, like A5 2; 4 = Following a similar path, we ll come now to k = 5; and then generalize the result to k 4. C 45 = 0 C 55 = 4 C 44 + C 45 = 4A 44 F 2 C 65 = 5 C 54 + C 55 = 5A 54 F 3 + ( 5A ) 4A F2 C 75 = 6 C 64 + C 65 = 6A 64 F 4 + ( 6A ) 5A F3 + ( 6A A ) 4A F2.... Take for instance, n = 7; if we put A 75 = 6A 64 A 2 75 = 6A A 54 A 3 75 = 6A A A 44, this corresponding to diagonal product/sums of i terms in the table (25), we ll write C 75 = A 75 F 4 + A 2 75 F 3 + A 3 75 F 2, which is an analogous equation to (23.a). We deal here with a recursive process; so, for k 5, it must be A i nk = i j= i j+ (n j) An j ; k. (26) 08

10 Remark that the number of terms for C nk is always equal to n k + ; on the other hand, the smallest term of the F b is F 2 and, so, the biggest one is F n k+2. We are therefore able to write a general recursive equation, for k 4: C nk = n k+ A i nk F (n k+3) i = A nk F n k+2 + A 2 nk F (27) n k+ + + A n k+ nk F 2. Because of its recursive nature, this is mainly of theoretical interest, from an algebraic point of view. Its application to real cases becomes quite fastidious, as k increases. Consider, for instance, the above-mentioned case C 75 ; the first step is easy, deriving directly from table (25): A 75 = 6 5 = 30 A 2 75 = = 74 C 75 = = 624. A 3 75 = = 9 Now, for k = 6, to compute the two A i 76, we are obliged to previously calculate A 65, A2 65 and A 55 because A 76 = 6A 65 A 2 76 = 6A A 55. We get so, finally: A 65 = 5A 54 = 5 4 = 20 A 2 65 = 5A2 54 = = 47 A 55 = 4A 44 = 4 3 = 2 A 76 A 2 76 = 6 20 = 20 = = 342; C 76 = A 76 F 3 + A 2 76 F 2 = = 764. For the last term, C 77, there is a single A: but A 77 = 6 A 66 }{{} 5A 55 C 77 = A 77 F 2 ; }{{} 2 which means that C 77 = 6 (4)! 2 = 6!, as we already knew. 4.3 Matrix Calculation = 6 (2)! A 55 = 6 (3)! 4 = 6 (4)!, }{{} 4A 44 Of course, the calculus of a certain C nk becomes less fastidious if one previously (and automatically) calculates the several A i nk by means of appropriate definitions and rules. Let A k be an infinite square matrix, where we ll put A i nk for its entry in the supposed n-th row and the supposed i-th column; supposed because we ll make A i nk = Ai 0+ i n 0 + n ; k, where n and i are integers we ll call row and column increments respectively; n 0 and i 0 are the effective row and column numbers. For our purposes, we ll make n = 3 and i = 0; therefore, A 4k is the entry in the effective first row and first column. We ll define A k+ as the (first) diagonal descendant matrix of A k which is its diagonal ascendant if A i n; k+ = i j= i j+ (n j) An j ; k. (28) This is an equivalent equation to (26). The idea is to present A 5 as the descendant of A 4 [the matrix corresponding to the table (25)]. Naturally, the second diagonal descendant of A k is A k+2, the descendant of A k+ ; generally speaking, A k+r is the r-th diagonal descendant of A k. 09

11 So, if we define the matrix A 4 following the equation (24), just like the table (25), in which we ll make all empty entries equal to zero, we get A 4 = (29) The first diagonal descendant of A 4 is, then, the matrix A 5 = (30) The modus operandi, for A 2 75 and A3 75, as we saw before, is signalized respectively by the box and the double box on both matrices. Using the same simple routine, we obtain the second diagonal descendant: A 6 = ; (3) and so on. We see that the null rows increase from the top, one by one, as we descend from the original matrix; related to that, at the same time the number of non-null entries diminishes in each row. As an example, with a spreadsheet, we may use the matrix A 6 to (automatically) compute C 76 and C 96 : C 76 = 2 A i 76 F 4 i = = 764 C 96 = 4 A i 96 F 6 i = =

12 5. Stirling and Harmonic Numbers Some days after obtaining most of the precedent results (this is, except all the previous section), I learned about the so-called Stirling numbers. Then I found out that the arithmetic coefficients are equivalent to the unsigned Stirling numbers of the first kind n as follows: k n k = C n; n k+ or C nk = n n k + (32) and that one may generate a triangle formed by these numbers, using a similar recurrence relation to the one established by theorem, which is essentially symmetrical to the Arithmetic Triangle! I discovered these peculiar numbers concerning permutations according to their number of cycles by chance, related to the n-th harmonic number H n, this is, the sum of the reciprocals of the first n natural numbers: H n = n = And I looked for harmonic numbers precisely because they corresponds to the sequence of the reciprocals of natural numbers and I had just proved the following theorem, which I found interesting. Theorem 2. If H n is the n-th harmonic number, then, for n >, C n+; n n k= k. H n = = C n+; n. (33) C n+; n+ n! Proof. It is, once again, a proof by induction: ) The equation is valid for n = 2: H 2 = + 2 = 3 2 = C 32 C 33. 2) Suppose H n = C n; n C n; n 3) Then, according to theorem. = C n; n (n )!. H n = H n + n = n C n; n + C nn n! = C n+; n C n+; n+, For instance, H 5 = C 65 C 66 = = = 2, It has been proved that the harmonic series roughly approximate the natural logarithm function (Harmonic). In fact, it is quite simple to prove, using the MacLaurin-Cauchy integral test, that the series is divergent. But this means that lim n H n = lim n C n; n C nn + lim }{{} n 0 n = lim n C n; n C nn =, which is coherently obvious since the last quotient represents H n. But one may also understand that this means that C n; n grows faster then C nn ; and this is because of the double recurrence relation: C n; n = (n ) C } {{ n ; n 2 + C } n ; n ; and } {{ } 0 0 C nn = (n ) C } {{ n ; n } 0 C n; n C + C } {{ n ; } n = (n ) C n; n n ; n 0 = C n ; n 2 C n ; n + n. The last equation correspond to H n = H n 2 + n, this is, (33) applied to H n. But one clearly sees that there is a surplus of n for C n; n C n; n in relation to C n ; n 2 C n ; n. This generically makes C n; n grow faster then C nn, with n. On the other hand, the growth is attenuated as n increases because the same happens with /n.

13 6. Further Matrix Representation If we form a lower triangular matrix of order n with the C i j, i, j n, C n = C n2 C n3... C nn (34) then n C ii = (n )! is its determinant. We may use a matrix representation for the first equation in (3), either in the individual form (for each n) P n = C nn A n this is, [P n ] = [ ] a n d C n C n2... C nn,... or using the square matrix C n above. For this purpose, however, we must introduce the concepts of progressive matrix and matrix column product. a n ad n. A progressive matrix ˇM n on variables x and y is an upper triangular matrix of order n defined by ˇM i j = x j i y i for j i ; ˇM i j = 0 for j < i. (35) Explicitly: ˇM n = x x 2 x 3... x n 0 y xy x 2 y... x n 2 y 0 0 y 2 xy 2... x n 3 y y 3... x n 4 y y n (6.a) We see that the determinant of this matrix is given by ˇM = n i=0 y i = y n (2)! 2. Two special cases deserve attention: (a) For x = 0 and y =, ˇM n turns into the identity matrix of order n. (b) Making x = y =, we obtain Ľ n : Ľ i j = for j i ; Ľ i j = 0 for j < i. 2. Given two square matrices of the same order n, B and A, the column product B A is the n matrix given by n (B A) i = B i j A ji. (36) This means that each row i of B doesn t multiply but the column of the same order i of A, thus producing a column matrix. Now, coming back to the use of the Arithmetic Triangle in the form of C n, we ll make x = a and y = d; furthermore, we ll multiply the matrix ˇM n by the initial term a, in such a way that we ll write for the n matrix P n, which elements are P i ( i n): P n = C n a ˇM n, (37) j= 2

14 keeping in mind that On the other hand: a ˇM i j = a j i+ a j i d a j i d 2... ad j C n Ľ n = [i!] n. (38) As an example, let a = 2 and d = 3; well have the progression and, for limit n = 6, P 6 = = Remark that these concepts of progressive matrix and matrix column product are quite useful, for example, to represent Newtons binomial, S n = (x + y) n, as S n = B n+ ˇM n+, ( ) n where B n+ is the (n + ) (n + ) matrix of the binomial coefficients = B k n+; k+, called Pascal matrix of order n + ; or yet to express the equality, for n > 0, Q n = x n y n = (x y) as Q n = [ x y ] n ˇM n, [ ] x y n being the n n matrix which elements are all equal to x y. 7. Conclusion n x n i y i The study of the product of the first n terms of an arithmetic progression leads to an infinite numerical triangle called Arithmetic Triangle formed by certain coefficients, C nk and which may be progressively built. One discovers that the C nk correspond to the so-called Unsigned Stirling Numbers of the First Kind, which also generate a numerical triangle, essentially symmetrical to the one displaying the C nk. We established several proprieties and propositions concerning the Arithmetic Triangle and factorials. On the way, we generalized the concepts of factorial of order k, rising and falling factorials, and introduced the concepts of sum-factorial, descendant matrix, progressive matrix and matrix column product. Aknowledgment I wish to thank my pupil Tomás Pacheco for bringing up this issue and also for showing all the willingness and enthusiasm of youth. It is quite refreshing! 3

15 References Ferreira, Luís D. (200). Integer Binomial Plan: a generalization on Factorials and Binomial Coefficients. Journal of Mathematics Research, 2(3), Broder, Andrei Z. (984). The r-stirling numbers. Discrete Mathematics 49(3), Deveci O., & Akuzum Y. (204), The Cyclic Groups and the Semigroups via MacWilliams and Chebyshev Matrices. Journal of Mathematics Research, 6(2), Deveci O., & Karaduman E. (202), The cyclic groups via the Pascal matrices and the generalized Pascal matrices. Linear Algebra and its Applications, 437, Hiller, J. (206). Old Friends in Unexpected Places: Pascal (and Other) Matrices in GLn(C). The American Mathematical Monthly, Copyrights Copyright for this article is retained by the author(s), with first publication rights granted to the journal. This is an open-access article distributed under the terms and conditions of the Creative Commons Attribution license ( 4