## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA E-mail: smarand@unm.edu In this article we will widen the concepts of ”binomial coefficients” and ”trinomial coefficients” to the concept of ”k-nomial coefficients”, and one obtains some general properties of these. As an application, we will generalize the” triangle of Pascal”. Let’s consider a natural number k ≥ 2 ; let P( x ) = 1 + x + x 2 + ... + x k −1 be the polynomial formed of k monomials of this type; we’ll call it ”k-nomial”. We will call k-nomial coefficients the coefficients of the power of x of h (1 + x + x 2 + ... + x k −1 )n , for n positive integer. We will note them Ckn with h ∈{0,1, 2,..., 2 pn}. In continuation one will build by recurrence a triangle of numbers which will be called ” triangle of the numbers of order k”. CASE 1: k = 2 p + 1 . On the first line of the triangle one writes 1 and one calls it ”line 0”. (1) It is agreed that all the cases which are to the left and to the right of the first (respectively of the last) number of each line will be consider like being 0. The lines which follow are called ”line 1”, ”line 2”, etc… Each line will contain 2 p numbers to the left of the first number, p numbers on the right of the last number of the preceding line. Numbers of the line i + 1 are obtained by using those of the line i in the following way: Ckij+1 is equal to the addition of p numbers which are to its left on the line i and of p numbers which are to the right on the line i , to the number which is above it (see. Fig. 1). One will take into account the convention 1. Fig. 1

p numbers p numbers

line i line i+1

⋅⋅⋅⋅⋅⋅⋅⋅

⋅⋅⋅⋅⋅⋅⋅⋅

⋅Ckij+1

1

Example for k = 5 :

**1 1 1 1 1 1 1 2 3 4 5 4 3 2 1 1 3 6 10 15 18 19 18 15 10 6 3 1 1 4 10 20 35 52 68 80 85 80 68 52 35 20 10 4 1 ………………..…………………………………………………………………… The number 0 C51 = 0 + 0 + 0 + 0 + 1 = 1;
**

3 C51 = 0 + 1 + 0 + 0 + 0 = 1; 3 C5 2 = 0 + 1 + 1 + 1 + 1 = 4;

C5 7 = 4 + 5 + 4 + 3 + 2 = 18; 3 etc. Properties of the triangle of numbers of order k:

**1) The line i has 2 pi + 1 elements. 2)
**

t h h −i Ckn = ∑ Ckn −1 where by convention Ckn = 0 for i=0 2p

⎧t < 0 and ⎨ ⎩t > 2 pr This is obvious taking into account the construction of the triangle. 3) Each line is symmetrical relative to the central element. 4) First elements of the line i are 1 and i . 5) The line i of the triangle of numbers of order k represent the k-nomial coefficients of (1 + x + x 2 + ... + x k −1 )i . The demonstration is done by recurrence on i of * : a) For i = 1 it is obvious; (in fact the property would be still true for i = 0 ). b) Let’s suppose the property true for n . Then (1 + x + x 2 + ... + x k −1 )n +1 = (1 + x + x 2 + ... + x k −1 )(1 + x + x 2 + ... + x k −1 )n = = (1 + x + x 2 + ... + x 2 p ) ⋅ ∑ Cknj ⋅ x j =

j=0

2 pn

=

2 p ( n + 1)

t=0

∑ ∑ ∑

t=0

i Ckn ⋅ x i ⋅ x j =

i + j =t 0≤ j ≤2 p 0 ≤i ≤ 2 pn

=

2 p ( n + 1)

⎛ 2 p t − j ⎞ t 2 p ( n+1) t t ⎜ ∑ Ckn ⎟ x = ∑ Ckn+1 ⋅ x . ⎝ j=0 ⎠ t =0

6) The sum of the elements locate on line n is equal to k n .

2

The first method of demonstration uses the reasoning by recurrence. For n = 1 the assertion is obvious. One supposes the property truth for n , i.e. the sum of the elements located on the line n is equal to k n . The line n + 1 is calculated using the elements of the line n . Each element of the line n uses the sum which calculates each of p elements locate to its left on the line n + 1 , each of p elements locate to its right on the line n + 1 and that which is located below: thus it is used to calculate k numbers of the line n + 1 . Thus the sum of the elements of the line n + 1 is k times larger than the sum of those of the line n , therefore it is equal to k n +1 . 7) The difference between the sum of the k-nomial coefficients of an even rank and the sum of the k-nomial coefficients of an odd rank located on the same line 0 1 2 3 Ckn − Ckn + Ckn − Ckn + ... is equal to 1.

(

)

One obtains it if in (1 + x + x 2 + ... + x k −1 )n one takes x = −1 . 0 h 1 h 0 8) Ckn ⋅ Ckm + Ckn ⋅ Ckm−1 + ... + Cknh ⋅ Ckm = Cknh+ m This results from the fact that, in the identity (1 + x + x 2 + ... + x k −1 )n ⋅ (1 + x + x 2 + ... + x k −1 )m = (1 + x + x 2 + ... + x k −1 )n + m

**the coefficient of x h in the member from the left is
**

h n+m

∑ Ck

i=0

h

i n

h− ⋅ Ckm i and that of x h on the

right is Ck . 9) The sum of the squares of the k-nomial coefficients locate on the line n is equal to the k-nomial coefficient located in the middle of the line 2n . For the proof one takes n = m = h in the property 8. One can find many properties and applications of these k-nomial coefficients because they widen the binomial coefficients whose applications are known. CASE 2: k = 2 p . The construction of the triangle of numbers of order k is similar: On the first line one writes 1; it is called line 0 The lines which follow are called line 1, line 2, etc. Each line will have 2 p − 1 elements more than the preceding one; because 2 p − 1 is an odd number, the elements of each line will be placed between the elements of the preceding line (which is different from the case 1 where they are placed below). The elements locate on the line i + 1 are obtained by using those of the line i in the following way: Ckij+1 is equal to the sum of p elements located to its left on the line i with p elements located to its right on the line i .

3

Fig. 2

p numbers p numbers

line i line i+1 Example for k = 4 :

⋅⋅⋅⋅⋅⋅⋅⋅

⋅⋅⋅⋅⋅⋅⋅⋅

⋅Ckij+1

1 1 1 1 1 1 2 3 4 3 2 1 1 3 6 10 12 12 10 6 3 1 1 4 10 20 31 40 44 40 31 20 10 4 1 …………………………………………………………….

h From the property 1': Ckn = 2 p −1 i=0

∑ Ck

h −i n −1 k −1

h h −i By joining together properties 1 and 1': Ckn = ∑ Ckn −1 i=0

The other properties of Case 1 are preserved in Case 2, with similar profs. However in the property 7, one sees that the difference between the sum of the k-nomial coefficients of even rank and that of the k-nomial coefficients of odd rank locate on the same line is equal to 0.

4

- Examville.com - Precalcuus - Fudamentals of Algebra
- Pascals Triangle
- Supplementary Note 7
- Algebra 3.docx
- 16-6
- Number_theory.pdf
- C1 Rev 1-2
- 180 Notes
- ￼￼Partitions of Multisets 1-s2.0-0012365X74900764-main
- Generating Function
- 100 Number Theory Problems
- ON THE PRIMITIVE NUMBERS OF POWER P AND ITS ASYMPTOTIC PROPERTY
- SSMO Marking Scheme
- 9 2 9 3 multiplying polynomials notes
- 10th National ISMO Class 6 Question Paper.pdf
- Prob510
- BOOK 3
- Number Theory Problems
- mh-354-sol
- CAT Syllabus
- 2013 Math Challenge Review
- Exercise 3 - FEM for 2D Problems (Correct)
- 2015 HS Problems
- zhao
- 11-12 final srg2
- Gauss
- Test Papers
- 253 Supp
- History of Maths
- AdMath8A GCF1

- Ed. Magazine, Summer 2010
- Ttr Burris Brookings Algebra Final
- UT Dallas Syllabus for math5320.081 05u taught by Thomas Butts (tbutts)
- tmpEDD5.tmp
- tmp3B14.tmp
- UT Dallas Syllabus for math1314.0s1.07u taught by William Scott (wms016100)
- MoCo
- UT Dallas Syllabus for econ7391.051.10f taught by Kruti Dholakia (kruti)
- UT Dallas Syllabus for math2418.001 06s taught by Paul Stanford (phs031000)
- Algebra II/Trigonometry Regents exam
- UT Dallas Syllabus for math2418.501 06s taught by Paul Stanford (phs031000)
- UT Dallas Syllabus for math2333.022 05u taught by H Stone (estone)
- UT Dallas Syllabus for dmth0v93.002 06s taught by Mehrdad Panahi (mpanahi)
- UT Dallas Syllabus for mthe5320.081.09u taught by Thomas Butts (tbutts)
- Many Routes Through & Around College Prep
- UT Dallas Syllabus for math1314.502 05f taught by William Donnell (wxd022000)
- UT Dallas Syllabus for math2418.501.10s taught by Istvan Ozsvath (ozsvath)
- UT Dallas Syllabus for dmth0v93.004.07s taught by Mehrdad Panahi (mpanahi)
- The Gap

- Chinese Math, Vol. 3 (in Chinese language)
- Sci en Ti Am Agn a 2 No 3
- Paradoxist Distiches, by Florentin Smarandache
- Scientia Magna, Vol. 2, No. 2
- Paradoxism and Postmodernism, by Ion Soare
- Neutrosophy in Arabic Philosophy [in Arabic language], by Florentin Smarandache & Salah Osman
- Estetica Paradoxismului - Titu Popescu
- Outer Art, Vol. 2, by Florentin Smarandache
- Chinese Math, Vol. 4 (in Chinese language)
- The Art of Antiwar, by Florentin Smarandache
- Scientia Magna, Vol. 2, No. 1
- Definitions, Solved and Unsolved Problems, Conjectures and Theorems in Number Theory and Geometry, by Florentin Smarandache, edited by M. Perez
- Trickster's Famous Deeds, children plays by Florentin Smarandache
- Scientia Magna 1/1
- NonPoems, by Florentin Smarandache
- Generalization of Andrica's Conjecture, by Florentin Smarandache
- Chinese Math, Vol. 2 (in Chinese language)
- Chinese Math, Vol. 1 (in Chinese language)
- Solving Diophantine Quadratic Equations, by Florentin Smarandache
- Diophantine Equations in N Variables, by Florentin Smarandache
- Generalizations Of Ceva Theorem, by Florentin Smarandache
- Generalization Of Euler Theorem, by Florentin Smarandache
- Partitions of Integers, by Florentin Smarandache
- Smarandache's Codification
- Set of Sequences, by Florentin Smarandache
- New Functions in Number Theory, by Florentin Smarandache
- GeneralizationsOfCeva
- Sequences and Sieves, by Florentin Smarandache
- Generalization of Jung Theorem, by Florentin Smarandache

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading