On Sums of Products of Horadam Numbers
|
|
- Thomas Parks
- 5 years ago
- Views:
Transcription
1 KYUNGPOOK Math J 49(009), On Sums of Products of Horadam Numbers Zvonko ƒerin Kopernikova 7, Zagreb, Croatia, Europe cerin@mathhr Abstract In this paper we give formulae for sums of products of two Horadam type generalized Fibonacci numbers with the same recurrence equation and with possibly different initial conditions Analogous improved alternating sums are also studied as well as various derived sums when terms are multiplied either by binomial coecients or by members of the sequence of natural numbers These formulae are related to the recent work of Belbachir and Bencherif, ƒerin and ƒerin and Gianella 1 Introduction The generalized Fibonacci sequence {w n } = {w n (a 0, b 0 ; p, q)} is dened by w 0 = a 0, w 1 = b 0, w n = p w n 1 q w n (n ), where a 0, b 0, p and q are arbitrary complex numbers, with q 0 The numbers w n have been studied by Horadam (see, eg [10]) A useful and interesting special cases are {U n } = {w n (0, 1; p, q)} and {V n } = {w n (, p; p, q)} that were investigated by Lucas [11] For integers a 0, c 0, 0, b > 0 and d > 0, let P = U a+b U c+d, Q = U a+b V c+d and R = V a+b V c+d In [1] some formulae for the sums n =0 P, n =0 Q, n =0 R, n =0 ( 1) P, n =0 ( 1) Q and n =0 ( 1) R have been discovered in the special case when b = d = and q = ±1 Even in these restricted case they gave unication of earlier results by ƒerin and by ƒerin and Gianella for Fibonacci, Lucas, Pell and Pell-Lucas numbers (see [3] [9]) In [] the author eliminated all restrictions from the article [1] on b, d and q (except that q 0) Some other types of sums have also been studied like the improved alternating sums (when we multiply terms by increasing powers of a xed complex number), the sums with binomial coecients and sums in which we multiply terms by increasing natural numbers The goal in this paper is to extend these results to Horadam type generalized Fibonacci numbers Even in this more general case these sums could be evaluated using the sum of a geometric series Received May 6, 008; accepted May 6, Mathematics Subect Classication: Primary 11B39, 11Y55, 05A19 Key words and phrases: Horadam generalized Fibonacci numbers, Lucas numbers, sums of products 483
2 484 Zvonko čerin Sums of products of two Horadam numbers We rst want to nd the formula for the sum Ψ 1 = w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) =0 when a 0, b 0, c 0, d 0, p and q 0 are complex numbers and n 0, a 0, c 0, b > 0 and d > 0 are integers Let α and β be the roots of x p x + q = 0 Then α = p + and β = p, where = p 4 q Moreover, α β =, α + β = p, α β = q and the Binet forms of w n, U n and V n are w n = (b 0 a 0 β) α n + (a 0 α b 0 ) β n, U n = αn β n α β α β, V n = α n + β n, if α β, and w n = α n 1 (a 0 α + n (b 0 a 0 α)), U n = n α n 1, V n = α n, if α = β Let A 1 = b 0 a 0 α, A = d 0 c 0 α, B 1 = a 0 β b 0, B = c 0 β d 0 Let E = α b+d, F = α b β d, G = α d β b and H = β b+d Let e = α a+c B 1 B, f = α a β c A B 1, g = α c β a A 1 B and h = β a+c A 1 A When E 1, for any integer n 0, let E n = En+1 1 E 1 We similarly dene F n, G n and H n On the other hand, when α b β b, for any integer n 0, let b n = αb(n+1) β b(n+1) and α b n (α b β b b n = αb(n+1) β b(n+1) ) β b n (α b β b ) We similarly dene d n and d n For any integer n 0, let λ n = n + 1 Let T = α a+c Let C 1 = A 1 a + a 0 α, C = A c + c 0 α, K 1 = b d A 1 A, K 3 = C 1 C and K = b A 1 C + d A C 1 Let K 4 = K 1 + K + K 3 Let K, M, N and P be n ( n + 1) K n K + 6 K 3, n E n+3 ( n + n 1) E n+ + (n + 1) E n+1 E(E + 1), n E n+3 ( n + 1) E n+ + (n + 1) E n+1 + E(E 1), E n+3 E n+ + E n+1 (E 1) (n + 1) K T Theorem 1 (a) When = 0 and E = 1, then Ψ 1 = 6 (b) When = 0 and E 1, then Ψ 1 = T [ K 1 M + K N + K 3 P ] (E 1) 3 Proof (a) Recall that when = 0, then w a+b (a 0, b 0 ; p, q) = α a 1+b [ b A 1 + C 1 ]
3 On Sums of Products of Horadam Numbers 485 and w c+d (c 0, b 0 ; p, q) = α c 1+d [ d A + C ] Since, E = α b+d = 1, we see that the product is equal to =0 1 = n + 1, n =0 follows that Ψ 1 has the above value (b) Since = 0, the product is equal to =0 E = w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) T [ K 1 + K + K 3 ] n(n + 1) =, and n =0 = w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) T E [ K 1 + K + K 3 ] P (E 1), n 3 =0 E = it follows that Ψ 1 has the above value n(n + 1)( n + 1), it 6 N (E 1) 3, and n =0 E = M (E 1) 3, The following theorem covers for the sum Ψ 1 the cases when 0 It uses Table 1 that should be read as follows The symbols and in column E mean E 1 and E = 1 In column b they mean α b β b and α b = β b In columns F, G, H and d they have analogous meanings The third subcase should be read as follows: When ( 0), E = 1 and α b = β b, then G = 1 and H = F and for F 1 the product Ψ 1 is equal to λ n (e + g) + F n (f + h) Theorem When 0, then Table 1 gives the value of Ψ 1 In all other cases the product Ψ 1 is equal to λ n (e + f + g + h) Proof of row 1 When 0, we have w a+b (a 0, b 0 ; p, q) = 1 [ α a B 1 (α b ) + β a A 1 (β b ) ] and w c+d (c 0, d 0 ; p, q) = 1 [ α c B (α d ) + β c A (β d ) ] Hence, the product w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) is equal to e E + f F + g G + h H =0 E = E n, we get Ψ 1 = e E n + f F n + g G n + h H n
4 486 Zvonko čerin E F G H b d Ψ 1 1 E n e + F n f + G n g + H n h λ n e + F n f + b n g + H n h 3 F λ n (e + g) + F n (f + h) 4 λ n e + d n f + G n g + H n h 5 G λ n (e + f) + G n (g + h) 6 (see 5) 7 (see 3) 8 λ n (e + g) + d n (f + h) 9 λ n (e + h) + d n f + d n g 10 E n e + λ n f + G n g + b n h 11 E E n (e + g) + λ n (f + h) 1 d n e + λ n f + G n g + H n h 13 G λ n (e + f) + G n (g + h) 14 d n e + λ n (f + g) + d n h 15 (see 11) 16 d n (e + g) + λ n (f + h) 17 b n e + F n f + λ n g + H n h 18 F λ n (e + g) + F n (f + h) 19 E n e + F n f + λ n g + d n h 0 E E n (e + f) + λ n (g + h) 1 b n (e + f) + λ n (g + h) E n e + b n f + G n g + λ n h 3 E E n (e + g) + λ n (f + h) 4 E n e + F n f + d n g + λ n h 5 E E n (e + f) + λ n (g + h) Table 1: The product Ψ 1 when 0
5 On Sums of Products of Horadam Numbers 487 Proof of row When 0 and E = α b+d = 1, we get w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = e + ff + g ( β b α b ) + hh =0 1 = λ n, n =0 F = F n and n =0 that Ψ 1 = e λ n + f F n + g b n + h H n Proof of row 3 When 0, E = α b+d = 1 and α b = β b, then and H = β b β d = α b β d = F Hence, ( ) β b = b n (for α b β b ), it follows α b G = β b α d = α b α d = E = 1 w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = e + g + (f + h)f =0 1 = λ n and n =0 F = F n (for F 1, of course), it follows that the product Ψ 1 is equal to (e + g) λ n + (f + h) F n The missing case in the Table 1 after the third row is clearly when E = 1, α b = β b and F = 1 The above product is w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = e + f + g + h, so that Ψ 1 = λ n (e + f + g + h) The selection p = 0, q = 1, b = and d = shows that this case can actually happen Ũ n+1 Notice that α n = V n + U n and β n = V n U n for 0 and α n = β n = n + 1 = Ṽn for = 0 Hence, it is clear that each of the above expressions for the sum Ψ 1 could be transformed into an expression in Lucas numbers U n and V n (or Ũ n and Ṽn) In most cases these formulae are more complicated then the ones given above This applies also to other sums that we consider in this paper 3 Sum with binomial coecients In this section we consider the sum ( ) n Ψ = w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), =0 when a 0, b 0, c 0, d 0, p and q 0 are complex numbers and n 0, a 0, c 0, b > 0 and d > 0 are integers Let V and U be n E [(n E + 1) K 1 + (E + 1) K ] + (E + 1) K 3 and E K 4 + K 3
6 488 Zvonko čerin Theorem 3 (a) When = 0, then (b) When 0, then Proof (b) Since T K 3, if n = 0, Ψ = T U, if n = 1, T (E + 1) n V, if n, Ψ = (E + 1)n e + (F + 1) n f + (G + 1) n g + (H + 1) n h ( ) n w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = ( ) n e E + f F + g G + h H, from n ( n ) =0 E = (E + 1) n, it follows that Ψ indeed has the above value 4 The improved alternating sums, I In this section we consider the sums obtained from the sums Ψ 1 and Ψ by multiplication of their terms with the powers of a xed complex number k When k = 1 we obtain the familiar alternating sums More precisely, we study the sums Ψ 3 = Ψ 4 = =0 k w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), =0 ( ) n k w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), when a 0, b 0, c 0, d 0, p and q 0 are complex numbers and n 0, a 0, c 0, b > 0 and d > 0 are integers Let E = k α b+d, F = k α b β d, G = k α d β b and H = k β b+d When E 1, for any integer n 0, let E n = En+1 1 E 1 We similarly dene F n, G n and H n In this section we can assume that k 1 and k 0 because the case when k = 1 was treated earlier while for k = 0 all sums are equal to zero With this new meaning of the symbols E, F, G and H we have the following result Theorem 4 (a) The values given in Theorems 1 and express the sum Ψ 3 In particular, when 0, then the Table 1 gives the values of Ψ 3 In all other cases the product Ψ 3 is equal to λ n (e + f + g + h) (b) The values given in Theorem 3 for the sums Ψ express also the sum Ψ 4
7 On Sums of Products of Horadam Numbers 489 Proof (b) Since ( ) ( ) n n e E k + f F + g G + h H w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) =, from n ( n ) =0 E = (E + 1) n, it follows that Ψ 4 indeed has the same expression as the sum Ψ 5 Terms multiplied by natural numbers In this section we study the sums Ψ 5 = ( + 1) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), Ψ 6 = =0 =0 ( ) n ( + 1) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), when a 0, b 0, c 0, d 0, p and q 0 are complex numbers and n 0, a 0, c 0, b > 0 and d > 0 are integers Let E = α b+d, F = α b β d, G = α d β b, H = β b+d Let e = α a+c B 1 B, f = α a β c A B 1, g = α c β a A 1 B, h = β a+c A 1 A When E 1, for any integer n 0, let E n = (n + 1)En+ (n + )E n (E 1) We similarly dene F n, G n and H n On the other hand, when α b β b, for any integer n 0, let and b n = αb(n+) + (n + 1)β b(n+) (n + )α b β n+1 α b n (α b β b ) b n = βb(n+) + (n + 1)α b(n+) (n + )β b α n+1 β b n (α b β b ) We similarly dene d n and d (n + 1)(n + ) n For any integer n 0, let λ n = Let M and N denote n E [ n+3 n (n + 1) E ( 3 n + 6 n 1 )] + (n + ) E n+1 [ (3 n + 3 n ) E (n + 1) ] + E ( E + 1) and (E 1) [ n (n + 1) E n+3 n (n + ) E n+ +(n + ) (n + 1) E n+1 E ] Theorem 5 (a) When = 0 and E = 1, then the sum Ψ 5 is equal to λ n T [ n(3 n + 1) K n K + 6 K 3 ] 6 (b) When = 0 and E 1, then the sum Ψ 5 is equal to T (E 1) 4 [ K1 M + K N + K 3 (E 1) 4 E n ]
8 490 Zvonko čerin Proof (b) Since = 0, we have ( + 1) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = ( + 1) ( α a+b 1 [ b A 1 + C 1 ] ) ( α c+d 1 [ d A + C ] ) = ( + 1) T E [ K 1 + K + K 3 ] =0 ( + 1) E = E n, n =0 ( + 1) N E = (E 1), and 4 ( + 1) E M = (E 1) 4, =0 it follows that Ψ 5 has the above value Theorem 6 When 0, then the Table 1 gives the values of Ψ 5 In all other cases the product Ψ 5 is equal to λ n (e + f + g + h) Proof of row 1 in Table 1 for Ψ 5 When 0, we have ( + 1) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = ( + 1) ( e E = ( + 1) ( 1 [ B1 α a+b + A 1 β a+b ]) ( 1 [ B α c+d c+d + A β ]) + f F + g G + h ) H =0 ( + 1)E = E n, we get Ψ 5 = e E n + ff n + g G n + hh n For any integer n 0, let En = (n + 1) E + 1, En Fn, G n, Hn, Fn, G n and Hn similarly Let = E n (E + 1) n 1 We dene M = n E(E + 1) n 3 (E n + E n E n 1), N = n E(E + 1) n (E n + 1) Theorem 7 (a) When = 0, then T K 3, if n = 0, T E K 4 + K 3 ], if n = 1, Ψ 6 = T [ ] 3 E (K 4 + K + 3 K 1 ) + 4 E K 4 + K 3, if n =, T [ M K 1 + N K + En K 3 ], if n 3 (b) When 0, then Ψ 6 = En Proof (b) Since ( + 1) ( n e + F n f + G n g + Hn h ) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q) = 1 ( + 1) ( n ) ( e E + f F + g G + h H ),
9 On Sums of Products of Horadam Numbers 491 from n =0 ( + 1) ( ) n E = En, it follows that Ψ 6 indeed has the above value 6 The improved alternating sums, II In this section we study the following sums obtained by multiplying the terms of the sums Ψ 5 and Ψ 6 with the powers of the xed complex number k Of course, for k = 1, we get the sums Ψ 5 and Ψ 6 from the sums Ψ 7 and Ψ 8 Ψ 7 = Ψ 8 = =0 k ( + 1) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), =0 ( ) n k ( + 1) w a+b (a 0, b 0 ; p, q) w c+d (c 0, d 0 ; p, q), when a 0, b 0, c 0, d 0, p and q 0 are complex numbers and n 0, a 0, c 0, b > 0 and d > 0 are integers Let E = k α b+d, F = k α b β d, G = k α d β b and H = k β b+d When E 1, for any integer n 0, let E n = (n + 1)En+ (n + )E n We similarly dene (E 1) F n, G n and H n On the other hand, when α b β b, for any integer n 0, we dene b n and b n as in the previous section We similarly dene d n and d n In this section (n + 1)(n + ) λ n is again Theorem 8 The expressions for Ψ 5 in Theorems 5 and 6 describe also the sum Ψ 7 (with the new meaning of E, F, G and H) Theorem 9 The expressions for Ψ 6 in Theorem 7 describe also the sum Ψ 8 (with the new meaning of E, F, G and H) References [1] H Belbachir and F Bencherif, Sums of products of generalized Fibonacci and Lucas numbers, Ars Combinatoria, (to appear) [] Z ƒerin, Sums of products of generalized Fibonacci and Lucas numbers, Demonstratio Mathematica, 4() (009), [3] Z ƒerin, Properties of odd and even terms of the Fibonacci sequence, Demonstratio Mathematica, 39(1) (006), [4] Z ƒerin, On sums of squares of odd and even terms of the Lucas sequence, Proccedings of the Eleventh International Conference on Fibonacci Numbers and their Applications, Congressus Numerantium, 194(009), [5] Z ƒerin, Some alternating sums of Lucas numbers, Central European Journal of Mathematics 3(1) (005), 1-13
10 49 Zvonko čerin [6] Z ƒerin, Alternating Sums of Fibonacci Products, Atti del Seminario Matematico e Fisico dell'università di Modena e Reggio Emilia, 53(005), [7] Z ƒerin and G M Gianella, On sums of squares of Pell-Lucas numbers, INTEGERS: Electronic Journal of Combinatorial Number Theory, 6(006), A15 [8] Z ƒerin and G M Gianella, Formulas for sums of squares and products of Pell numbers, Acc Sc Torino - Atti Sci Fis, 140(006), [9] Z ƒerin and G M Gianella, On sums of Pell numbers, Acc Sc Torino - Atti Sci Fis, 141(007), 3-31 [10] A F Horadam, Generating Functions for Powers of a Certain Generalized Sequence of Numbers, Duke Math J, 3(1965), [11] E Lucas, Théorie des Fonctions Numériques Simplement Périodiques, American Journal of Mathematics 1(1878), [1] N J A Sloane, On-Line Encyclopedia of Integer Sequences,
Sums of Squares and Products of Jacobsthal Numbers
1 2 47 6 2 11 Journal of Integer Sequences, Vol. 10 2007, Article 07.2.5 Sums of Squares and Products of Jacobsthal Numbers Zvonko Čerin Department of Mathematics University of Zagreb Bijenička 0 Zagreb
More informationALTERNATING SUMS OF FIBONACCI PRODUCTS
ALTERNATING SUMS OF FIBONACCI PRODUCTS ZVONKO ČERIN Abstract. We consider alternating sums of squares of odd even terms of the Fibonacci sequence alternating sums of their products. These alternating sums
More informationFormulas for sums of squares and products of Pell numbers
Formulas for sums of squares and products of Pell numbers TEORIA DEI NUMERI Nota di Zvonko ČERIN e Gian Mario GIANELLA presentata dal socio Corrispondente Marius I. STOKA nell adunanza del 1 Giugno 2006.
More informationON SUMS OF SQUARES OF PELL-LUCAS NUMBERS. Gian Mario Gianella University of Torino, Torino, Italy, Europe.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A15 ON SUMS OF SQUARES OF PELL-LUCAS NUMBERS Zvonko Čerin University of Zagreb, Zagreb, Croatia, Europe cerin@math.hr Gian Mario Gianella
More informationAREAS OF POLYGONS WITH COORDINATES OF VERTICES FROM HORADAM AND LUCAS NUMBERS. 1. Introduction
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 179188 DOI: 10.5644/SJM.13.2.05 AREAS OF POLYGONS WITH COORDINATES OF VERTICES FROM HORADAM AND LUCAS NUMBERS ZVONKO ƒerin In memory of my dear
More informationON SUMS OF SQUARES OF ODD AND EVEN TERMS OF THE LUCAS SEQUENCE
ON SUMS OF SQUARES OF ODD AND EVEN TERMS OF THE LUCAS SEQUENCE ZVONKO ČERIN 1. Introduction The Fibonacci and Lucas sequences F n and L n are defined by the recurrence relations and F 1 = 1, F 2 = 1, F
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationG. Sburlati GENERALIZED FIBONACCI SEQUENCES AND LINEAR RECURRENCES
Rend. Sem. Mat. Univ. Pol. Torino - Vol. 65, 3 (2007) G. Sburlati GENERALIZED FIBONACCI SEQUENCES AND LINEAR RECURRENCES Abstract. We analyze the existing relations among particular classes of generalized
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationarxiv: v1 [math.co] 20 Aug 2015
arxiv:1508.04953v1 [math.co] 20 Aug 2015 On Polynomial Identities for Recursive Sequences Ivica Martinak and Iva Vrsalko Faculty of Science University of Zagreb Bienička cesta 32, HR-10000 Zagreb Croatia
More informationON IMPROVEMENTS OF THE BUTTERFLY THEOREM
ON IMPROVEMENTS OF THE BUTTERFLY THEOREM ZVONKO ČERIN AND GIAN MARIO GIANELLA Abstract. This paper explores the locus of butterfly points of a quadrangle ABCD in the plane. These are the common midpoints
More informationTHE p-adic VALUATION OF LUCAS SEQUENCES
THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each
More informationSquares from D( 4) and D(20) Triples
dvances in Pure Mathematics - doi:/apm Published Online September (http://wwwscirporg/journal/apm) Squares from D( ) D() Triples bstract Zvono Čerin Koperniova 7 Zagreb roatia E-mail: cerin@mathhr Received
More informationSome congruences concerning second order linear recurrences
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae,. (1997) pp. 9 33 Some congruences concerning second order linear recurrences JAMES P. JONES PÉTER KISS Abstract. Let U n V n (n=0,1,,...) be
More informationSeveral Generating Functions for Second-Order Recurrence Sequences
47 6 Journal of Integer Sequences, Vol. 009), Article 09..7 Several Generating Functions for Second-Order Recurrence Sequences István Mező Institute of Mathematics University of Debrecen Hungary imezo@math.lte.hu
More informationBALANCING NUMBERS : SOME IDENTITIES KABERI PARIDA. Master of Science in Mathematics. Dr. GOPAL KRISHNA PANDA
BALANCING NUMBERS : SOME IDENTITIES A report submitted by KABERI PARIDA Roll No: 1MA073 for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationTHE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS
THE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS DIEGO MARQUES Abstract. Let F n be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest
More informationSOME SUMS FORMULAE FOR PRODUCTS OF TERMS OF PELL, PELL- LUCAS AND MODIFIED PELL SEQUENCES
SOME SUMS FORMULAE FOR PRODUCTS OF TERMS OF PELL PELL- LUCAS AND MODIFIED PELL SEQUENCES Serpil HALICI Sakarya Üni. Sciences and Arts Faculty Dept. of Math. Esentepe Campus Sakarya. shalici@ssakarya.edu.tr
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationSummation of Certain Infinite Lucas-Related Series
J. Integer Sequences 22 (209) Article 9..6. Summation of Certain Infinite Lucas-Related Series arxiv:90.04336v [math.nt] Jan 209 Bakir Farhi Laboratoire de Mathématiques appliquées Faculté des Sciences
More informationTILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX
#A05 INTEGERS 9 (2009), 53-64 TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN 37996-1300 shattuck@math.utk.edu
More informationOn Some Properties of Bivariate Fibonacci and Lucas Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.2.6 On Some Properties of Bivariate Fibonacci and Lucas Polynomials Hacène Belbachir 1 and Farid Bencherif 2 USTHB/Faculty of Mathematics
More informationDIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS
PORTUGALIAE MATHEMATICA Vol. 52 Fasc. 3 1995 DIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS Andrej Dujella Abstract: Let n be an integer. A set of positive integers is said to have the
More informationA LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS
Applicable Analysis and Discrete Mathematics, 1 (27, 371 385. Available electronically at http://pefmath.etf.bg.ac.yu A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS H. W. Gould, Jocelyn
More informationA RECIPROCAL SUM RELATED TO THE RIEMANN ζ FUNCTION. 1. Introduction. 1 n s, k 2 = n 1. k 3 = 2n(n 1),
Journal of Mathematical Inequalities Volume, Number 07, 09 5 doi:0.753/jmi--0 A RECIPROCAL SUM RELATED TO THE RIEMANN ζ FUNCTION LIN XIN AND LI XIAOXUE Communicated by J. Pečarić Abstract. This paper,
More informationDiscrete Structures Lecture Sequences and Summations
Introduction Good morning. In this section we study sequences. A sequence is an ordered list of elements. Sequences are important to computing because of the iterative nature of computer programs. The
More informationBalancing sequences of matrices with application to algebra of balancing numbers
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol 20 2014 No 1 49 58 Balancing sequences of matrices with application to algebra of balancing numbers Prasanta Kumar Ray International Institute
More informationPAijpam.eu ON THE BOUNDS FOR THE NORMS OF R-CIRCULANT MATRICES WITH THE JACOBSTHAL AND JACOBSTHAL LUCAS NUMBERS Ş. Uygun 1, S.
International Journal of Pure and Applied Mathematics Volume 11 No 1 017, 3-10 ISSN: 1311-8080 (printed version); ISSN: 1314-335 (on-line version) url: http://wwwijpameu doi: 10173/ijpamv11i17 PAijpameu
More informationarxiv: v1 [math.nt] 17 Nov 2011
sequences of Generalized Van der Laan and Generalized Perrin Polynomials arxiv:11114065v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Şahin a a Department of Mathematics, Faculty of Arts and Sciences,
More informationOn arithmetic functions of balancing and Lucas-balancing numbers
MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur
More informationOn the Pell Polynomials
Applied Mathematical Sciences, Vol. 5, 2011, no. 37, 1833-1838 On the Pell Polynomials Serpil Halici Sakarya University Department of Mathematics Faculty of Arts and Sciences 54187, Sakarya, Turkey shalici@sakarya.edu.tr
More informationExamples of Finite Sequences (finite terms) Examples of Infinite Sequences (infinite terms)
Math 120 Intermediate Algebra Sec 10.1: Sequences Defn A sequence is a function whose domain is the set of positive integers. The formula for the nth term of a sequence is called the general term. Examples
More informationApplied Mathematics Letters
Applied Mathematics Letters 5 (0) 554 559 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml On the (s, t)-pell and (s, t)-pell Lucas
More informationNOTE ON FIBONACCI PRIMALITY TESTING John Brillhart University of Arizona, Tucson, AZ (Submitted August 1996-Final Revision January 1997)
John Brillhart University of Arizona, Tucson, AZ 85721 (Submitted August 1996-Final Revision January 1997) 1. INTRODUCTION One of the most effective ways of proving an integer N is prime is to show first
More informationThe generalized order-k Fibonacci Pell sequence by matrix methods
Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University
More informationThe Third Order Jacobsthal Octonions: Some Combinatorial Properties
DOI: 10.2478/auom-2018-00 An. Şt. Univ. Ovidius Constanţa Vol. 26),2018, 57 71 The Third Order Jacobsthal Octonions: Some Combinatorial Properties Gamaliel Cerda-Morales Abstract Various families of octonion
More informationTHE GENERALIZED TRIBONACCI NUMBERS WITH NEGATIVE SUBSCRIPTS
#A3 INTEGERS 14 (014) THE GENERALIZED TRIBONACCI NUMBERS WITH NEGATIVE SUBSCRIPTS Kantaphon Kuhapatanakul 1 Dept. of Mathematics, Faculty of Science, Kasetsart University, Bangkok, Thailand fscikpkk@ku.ac.th
More informationCompositions of n with no occurrence of k. Phyllis Chinn, Humboldt State University Silvia Heubach, California State University Los Angeles
Compositions of n with no occurrence of k Phyllis Chinn, Humboldt State University Silvia Heubach, California State University Los Angeles Abstract A composition of n is an ordered collection of one or
More informationTwo Identities Involving Generalized Fibonacci Numbers
Two Identities Involving Generalized Fibonacci Numbers Curtis Cooper Dept. of Math. & Comp. Sci. University of Central Missouri Warrensburg, MO 64093 U.S.A. email: cooper@ucmo.edu Abstract. Let r 2 be
More informationarxiv: v1 [math.co] 11 Aug 2015
arxiv:1508.02762v1 [math.co] 11 Aug 2015 A Family of the Zeckendorf Theorem Related Identities Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Abstract
More informationCALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p
CALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p DOMINIC VELLA AND ALFRED VELLA. Introduction The cycles that occur in the Fibonacci sequence {F n } n=0 when it is reduced
More informationCombinations. April 12, 2006
Combinations April 12, 2006 Combinations, April 12, 2006 Binomial Coecients Denition. The number of distinct subsets with j elements that can be chosen from a set with n elements is denoted by ( n j).
More informationDefinition: A sequence is a function from a subset of the integers (usually either the set
Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset
More informationSome Generalized Fibonomial Sums related with the Gaussian q Binomial sums
Bull. Math. Soc. Sci. Math. Roumanie Tome 55(103 No. 1, 01, 51 61 Some Generalized Fibonomial Sums related with the Gaussian q Binomial sums by Emrah Kilic, Iler Aus and Hideyui Ohtsua Abstract In this
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
More informationGeneralized Identities on Products of Fibonacci-Like and Lucas Numbers
Generalized Identities on Products of Fibonacci-Like and Lucas Numbers Shikha Bhatnagar School of Studies in Mathematics, Vikram University, Ujjain (M P), India suhani_bhatnagar@rediffmailcom Omrakash
More informationImpulse Response Sequences and Construction of Number Sequence Identities
Impulse Response Sequences and Construction of Number Sequence Identities Tian-Xiao He Department of Mathematics Illinois Wesleyan University Bloomington, IL 6170-900, USA Abstract As an extension of Lucas
More information4 Linear Recurrence Relations & the Fibonacci Sequence
4 Linear Recurrence Relations & the Fibonacci Sequence Recall the classic example of the Fibonacci sequence (F n ) n=1 the relations: F n+ = F n+1 + F n F 1 = F = 1 = (1, 1,, 3, 5, 8, 13, 1,...), defined
More informationFibonacci and Lucas Identities the Golden Way
Fibonacci Lucas Identities the Golden Way Kunle Adegoe adegoe00@gmail.com arxiv:1810.12115v1 [math.nt] 25 Oct 2018 Department of Physics Engineering Physics, Obafemi Awolowo University, 220005 Ile-Ife,
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationOn Linear Recursive Sequences with Coefficients in Arithmetic-Geometric Progressions
Applied Mathematical Sciences, Vol. 9, 015, no. 5, 595-607 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.015.5163 On Linear Recursive Sequences with Coefficients in Arithmetic-Geometric Progressions
More informationCertain Diophantine equations involving balancing and Lucas-balancing numbers
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 0, Number, December 016 Available online at http://acutm.math.ut.ee Certain Diophantine equations involving balancing and Lucas-balancing
More informationEvery subset of {1, 2,...,n 1} can be extended to a subset of {1, 2, 3,...,n} by either adding or not adding the element n.
11 Recurrences A recurrence equation or recurrence counts things using recursion. 11.1 Recurrence Equations We start with an example. Example 11.1. Find a recurrence for S(n), the number of subsets of
More informationCOMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS
LE MATEMATICHE Vol LXXIII 2018 Fasc I, pp 179 189 doi: 104418/201873113 COMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS MURAT SAHIN - ELIF TAN - SEMIH YILMAZ Let {a i },{b i } be real numbers for 0 i r 1,
More informationarxiv: v1 [math.nt] 20 Sep 2018
Matrix Sequences of Tribonacci Tribonacci-Lucas Numbers arxiv:1809.07809v1 [math.nt] 20 Sep 2018 Zonguldak Bülent Ecevit University, Department of Mathematics, Art Science Faculty, 67100, Zonguldak, Turkey
More informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
More informationOn identities with multinomial coefficients for Fibonacci-Narayana sequence
Annales Mathematicae et Informaticae 49 08 pp 75 84 doi: 009/ami080900 http://amiuni-eszterhazyhu On identities with multinomial coefficients for Fibonacci-Narayana sequence Taras Goy Vasyl Stefany Precarpathian
More informationON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS
Hacettepe Journal of Mathematics and Statistics Volume 8() (009), 65 75 ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS Dursun Tascı Received 09:0 :009 : Accepted 04 :05 :009 Abstract In this paper we
More informationTrigonometric Pseudo Fibonacci Sequence
Notes on Number Theory and Discrete Mathematics ISSN 30 532 Vol. 2, 205, No. 3, 70 76 Trigonometric Pseudo Fibonacci Sequence C. N. Phadte and S. P. Pethe 2 Department of Mathematics, Goa University Taleigao
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationExact Determinants of the RFPrLrR Circulant Involving Jacobsthal, Jacobsthal-Lucas, Perrin and Padovan Numbers
Tingting Xu Zhaolin Jiang Exact Determinants of the RFPrLrR Circulant Involving Jacobsthal Jacobsthal-Lucas Perrin and Padovan Numbers TINGTING XU Department of Mathematics Linyi University Shuangling
More informationCounting Palindromic Binary Strings Without r-runs of Ones
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More informationPermanents and Determinants of Tridiagonal Matrices with (s, t)-pell Numbers
International Mathematical Forum, Vol 12, 2017, no 16, 747-753 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/imf20177652 Permanents and Determinants of Tridiagonal Matrices with (s, t)-pell Numbers
More informationOn the complex k-fibonacci numbers
Falcon, Cogent Mathematics 06, 3: 0944 http://dxdoiorg/0080/33835060944 APPLIED & INTERDISCIPLINARY MATHEMATICS RESEARCH ARTICLE On the complex k-fibonacci numbers Sergio Falcon * ceived: 9 January 05
More informationOn h(x)-fibonacci octonion polynomials
Alabama Journal of Mathematics 39 (05) ISSN 373-0404 On h(x)-fibonacci octonion polynomials Ahmet İpek Karamanoğlu Mehmetbey University, Science Faculty of Kamil Özdağ, Department of Mathematics, Karaman,
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationOn Some Combinations of Non-Consecutive Terms of a Recurrence Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.3.5 On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence Eva Trojovská Department of Mathematics Faculty of Science
More informationDIOPHANTINE EQUATIONS, FIBONACCI HYPERBOLAS, AND QUADRATIC FORMS. Keith Brandt and John Koelzer
DIOPHANTINE EQUATIONS, FIBONACCI HYPERBOLAS, AND QUADRATIC FORMS Keith Brandt and John Koelzer Introduction In Mathematical Diversions 4, Hunter and Madachy ask for the ages of a boy and his mother, given
More informationADVANCED PROBLEMS AND SOLUTIONS. Edited by Raymond E. Whitney
Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 7745. This department
More informationINCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS
INCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS BIJAN KUMAR PATEL, NURETTIN IRMAK and PRASANTA KUMAR RAY Communicated by Alexandru Zaharescu The aim of this article is to establish some combinatorial
More informationLinear recurrence relations with the coefficients in progression
Annales Mathematicae et Informaticae 4 (013) pp. 119 17 http://ami.ektf.hu Linear recurrence relations with the coefficients in progression Mircea I. Cîrnu Department of Mathematics, Faculty of Applied
More information5. Sequences & Recursion
5. Sequences & Recursion Terence Sim 1 / 42 A mathematician, like a painter or poet, is a maker of patterns. Reading Sections 5.1 5.4, 5.6 5.8 of Epp. Section 2.10 of Campbell. Godfrey Harold Hardy, 1877
More informationPHYS 301 HOMEWORK #5
PHY 3 HOMEWORK #5 olutions On this homework assignment, you may use Mathematica to compute integrals, but you must submit your Mathematica output with your assignment.. For f x = -, - < x
More informationSets of MOLSs generated from a single Latin square
Sets of MOLSs generated from a single Latin square Hau Chan and Dinesh G Sarvate Abstract The aim of this note is to present an observation on the families of square matrices generated by repeated application
More informationRecurrence Relations
Recurrence Relations Recurrence Relations Reading (Epp s textbook) 5.6 5.8 1 Recurrence Relations A recurrence relation for a sequence aa 0, aa 1, aa 2, ({a n }) is a formula that relates each term a k
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More informationOn Gaussian Pell Polynomials and Their Some Properties
Palestine Journal of Mathematics Vol 712018, 251 256 Palestine Polytechnic University-PPU 2018 On Gaussian Pell Polynomials and Their Some Properties Serpil HALICI and Sinan OZ Communicated by Ayman Badawi
More information12 Sequences and Recurrences
12 Sequences and Recurrences A sequence is just what you think it is. It is often given by a formula known as a recurrence equation. 12.1 Arithmetic and Geometric Progressions An arithmetic progression
More informationarxiv: v2 [math.co] 8 Oct 2015
SOME INEQUALITIES ON THE NORMS OF SPECIAL MATRICES WITH GENERALIZED TRIBONACCI AND GENERALIZED PELL PADOVAN SEQUENCES arxiv:1071369v [mathco] 8 Oct 015 ZAHID RAZA, MUHAMMAD RIAZ, AND MUHAMMAD ASIM ALI
More informationFurther generalizations of the Fibonacci-coefficient polynomials
Annales Mathematicae et Informaticae 35 (2008) pp 123 128 http://wwwektfhu/ami Further generalizations of the Fibonacci-coefficient polynomials Ferenc Mátyás Institute of Mathematics and Informatics Eszterházy
More informationBMO Round 1 Problem 1 Generalisation
BMO 008 009 Round 1 Problem 1 Generalisation Joseph Myers December 008 1 Introduction Problem 1 is: 1. Consider a standard 8 8 chessboard consisting of 64 small squares coloured in the usual pattern, so
More informationk-jacobsthal and k-jacobsthal Lucas Matrix Sequences
International Mathematical Forum, Vol 11, 016, no 3, 145-154 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/imf0165119 k-jacobsthal and k-jacobsthal Lucas Matrix Sequences S Uygun 1 and H Eldogan Department
More informationThe Fibonacci Identities of Orthogonality
The Fibonacci Identities of Orthogonality Kyle Hawins, Ursula Hebert-Johnson and Ben Mathes January 14, 015 Abstract In even dimensions, the orthogonal projection onto the two dimensional space of second
More informationCOMBINATORIAL COUNTING
COMBINATORIAL COUNTING Our main reference is [1, Section 3] 1 Basic counting: functions and subsets Theorem 11 (Arbitrary mapping Let N be an n-element set (it may also be empty and let M be an m-element
More informations-generalized Fibonacci Numbers: Some Identities, a Generating Function and Pythagorean Triples
International Journal of Mathematical Analysis Vol. 8, 2014, no. 36, 1757-1766 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.47203 s-generalized Fibonacci Numbers: Some Identities,
More informationLucas Polynomials and Power Sums
Lucas Polynomials and Power Sums Ulrich Tamm Abstract The three term recurrence x n + y n = (x + y (x n + y n xy (x n + y n allows to express x n + y n as a polynomial in the two variables x + y and xy.
More informationA LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS
A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS C. T. L O N G and J. H. JORDAN Washington State University, Pullman, Washington -*-* Introduction,, As Is well known., a number of remarkable and interesting
More informationCOMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS. Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia
#A2 INTEGERS 9 (209) COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia imartinjak@phy.hr Helmut Prodinger Department of Mathematics,
More informationTHE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE. 1. Introduction
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 163 178 DOI: 10.5644/SJM.13.2.04 THE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE FENG-ZHEN ZHAO Abstract. In this
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationA PROOF OF MELHAM S CONJECTURE
A PROOF OF MELHAM S CONJECTRE EMRAH KILIC 1, ILKER AKKS, AND HELMT PRODINGER 3 Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationarxiv: v1 [math.nt] 6 Apr 2018
THE GEOMETRY OF SOME FIBONACCI IDENTITIES IN THE HOSOYA TRIANGLE RIGOBERTO FLÓREZ, ROBINSON A. HIGUITA, AND ANTARA MUKHERJEE arxiv:1804.02481v1 [math.nt] 6 Apr 2018 Abstract. In this paper we explore some
More informationGenerating Functions (Revised Edition)
Math 700 Fall 06 Notes Generating Functions (Revised Edition What is a generating function? An ordinary generating function for a sequence (a n n 0 is the power series A(x = a nx n. The exponential generating
More informationA MATRIX GENERALIZATION OF A THEOREM OF FINE
A MATRIX GENERALIZATION OF A THEOREM OF FINE ERIC ROWLAND To Jeff Shallit on his 60th birthday! Abstract. In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients ( n, for m
More informationNEW IDENTITIES FOR THE COMMON FACTORS OF BALANCING AND LUCAS-BALANCING NUMBERS
International Journal of Pure and Applied Mathematics Volume 85 No. 3 013, 487-494 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v85i3.5
More informationEx. Here's another one. We want to prove that the sum of the cubes of the first n natural numbers is. n = n 2 (n+1) 2 /4.
Lecture One type of mathematical proof that goes everywhere is mathematical induction (tb 147). Induction is essentially used to show something is true for all iterations, i, of a sequence, where i N.
More informationLINEAR RECURRENCES AND CHEBYSHEV POLYNOMIALS
LINEAR RECURRENCES AND CHEBYSHEV POLYNOMIALS Sergey Kitaev Matematik Chalmers tekniska högskola och Göteborgs universitet S-412 96 Göteborg Sweden e-mail: kitaev@math.chalmers.se Toufik Mansour Matematik
More informationAND OCCUPANCY PROBLEMS
COMBINATIONS, COMPOSITIONS AND OCCUPANCY PROBLEMS MORTON ABRAMSON York University, Downsview, Toronto, Canada Let r < k be positive integers,, INTRODUCTION By a composition of k into r parts (an r-composition
More informationGaussian Modified Pell Sequence and Gaussian Modified Pell Polynomial Sequence
Aksaray University Journal of Science and Engineering e-issn: 2587-1277 http://dergipark.gov.tr/asujse http://asujse.aksaray.edu.tr Aksaray J. Sci. Eng. Volume 2, Issue 1, pp. 63-72 doi: 10.29002/asujse.374128
More informationSums. ITT9131 Konkreetne Matemaatika
Sums ITT9131 Konkreetne Matemaatika Chapter Two Notation Sums and Recurrences Manipulation of Sums Multiple Sums General Methods Finite and Innite Calculus Innite Sums Contents 1 Sequences 2 Notations
More information