On Sums of Pell Numbers 1. Introduction the Pell and Pell-Lucas Sequences Pn and Qn Are Defined by the Recurrence Relations P0 =

On Sums of Pell Numbers 1. Introduction the Pell and Pell-Lucas Sequences Pn and Qn Are Defined by the Recurrence Relations P0 =

Acc. Sc. Torino – Atti Sc. Fis. 140 (2006), xx-xx. TEORIA DEI NUMERI On sums of Pell numbers Nota di ZVONKO ČERIN1 e GIAN MARIO GIANELLA2 presentata dal Socio corrispondente Marius J. STOKA nell’adunanza del 14 Novembre 2006. Riassunto. In questa nota che è un miglioramento della nos- tra nota [6], si sono ottenute formule esplicite per somme di numeri di Pell, numeri di Pell pari e numeri di Pell dispari, per somme di quadrati di numeri di Pell, numeri di Pell pari e numeri di Pell dis- pari e somme di prodotti di numeri di Pell. Si sono pure determinate le forme alternate di queste somme. Esse hanno tutte interessanti rappresentazioni mediante numeri di Pell e di Pell-Lucas. Abstract. In this improvement of our paper [6] we give explicit formulas for sums of Pell numbers, even Pell numbers and odd Pell numbers, for sums of squares of Pell numbers, even Pell numbers and odd Pell numbers and for sums of products of even and odd Pell numbers. The alternating forms of these sums are also considered. They all have nice representations in terms of Pell and Pell-Lucas numbers. 1. Introduction The Pell and Pell-Lucas sequences Pn and Qn are defined by the recurrence relations P0 = 0, P1 = 2, Pn = 2 Pn 1 + Pn 2 for n > 2, − − and Q0 = 2, Q1 = 2, Qn = 2 Qn 1 + Qn 2 for n > 2. − − The numbers Qk make the integer sequence A002203 from [10] while the 1 numbers 2 Pk make A000129. In this paper we prove twentyfour formulas for sums of a finite number of consecutive terms of various integer sequences related to the Pell num- bers. More precisely, for any integers k 0 and m 0 we consider the sum ≥ ≥ 1Kopernikova 7, 10010 Zagreb, Croatia. E-mail: [email protected] 2Dipartimento di Matematica, Università di Torino, via C. Alberto 10, 10123 Torino, Italy. E-mail: [email protected] AMS 2000 Math. Subject Classification: Primary 11B39, 11Y55, 05A19. Key words and phrases. Pell numbers, Pell-Lucas numbers, integer sequences, sum of squares, sums of products. 2 ZVONKO ČERIN E GIAN MARIO GIANELLA m 1 1 Pk i and show that it can be evaluated as Qk m + Pk m Qk. i=0 + 2 + + − 2 PIn other words, we discover the formula for the sum of m + 1 consecutive members of the Pell sequence. Then we accomplish the same thing for even and for odd Pell numbers, for their squares and for six kinds of products of adjacent Pell numbers. Finally, we treat also the alternating sums for those m i sequences. For example, we prove that the alternating sum i=0 ( 1) Pk+i m 1 1 − is equal to ( 1) 2 Qk+m 2 Qk + Pk. P These formulas− for sums− have been discovered with the help of a PC com- puter and all algebraic identities needed for the verification of our theorems can be easily checked in either Derive, Mathematica or Maple V. Running times of all these calculations are in the range of a few seconds. Similar results for Fibonacci, Lucas and Pell-Lucas numbers have recently been discovered in papers [1], [2], [3], [4] and [5]. They improved some results in [7]. 2. Statements of results The best method to sum finitely many consecutive integers k + (k + 1) + (k +2)+ + (k + n) · · · is to group the initial number k and use the formula for the sum of the first n natural numbers. Hence, the above sum is n(n + 1) (n + 1)(2k + n) k(n +1)+ = . 2 2 In this paper our first goal is to show that the analogous explicit formula exists for the sum of finitely many consecutive members of the Pell integer sequence. In other words, we first want to find the formula for the sum m Pk i when m 0 and k 0 are integers. i=0 + ≥ ≥ PWe use the symbols N = 0, 1, 2, 3, 4, ... for all natural numbers (with zero included) and N for∗ the{ product N N} . ∗∗ ∗ × ∗ Theorem 1. For (m, k) N the following equality holds: ∈ ∗∗ m 1 1 1 Pk i = Qk m + Pk m Qk = (Qk m Qk). (2.1) + 2 + + − 2 2 + +1 − Xi=0 Next we sum up consecutive even and odd Pell numbers. Theorem 2. For (m, k) N the following equalities holds: ∈ ∗∗ ONSUMSOFPELLNUMBERS 3 m 1 P k i = [Q k m + P k m Q k + P k]= 2 +2 2 2 +2 2 +2 − 2 2 Xi=0 1 = [Q k m P k m + Q k P k] . (2.2) 2 2 +2 +2 − 2 +2 +2 2 − 2 m 1 P k i = [2 Q k m + 3 P k m P k] . (2.3) 2 +2 +1 2 2 +2 2 +2 − 2 Xi=0 The alternating sums of consecutive Pell numbers, even Pell numbers and odd Pell numbers are covered in the following theorem. Theorem 3. For (m, k) N the following equalities holds: ∈ ∗∗ m i m 1 1 ( 1) Pk i = ( 1) Qk m Qk + Pk. (2.4) − + − 2 + − 2 Xi=0 m i m 1 1 1 1 ( 1) P k i = ( 1) Q k m + P k m Q k + P k. (2.5) − 2 +2 − 4 2 +2 2 2 +2 − 4 2 2 2 Xi=0 m i m 3 1 ( 1) P k i = ( 1) Q k m + P k m + Q k. (2.6) − 2 +2 +1 − 4 2 +2 2 +2 4 2 Xi=0 The sums of squares of consecutive Pell numbers, even Pell numbers and odd Pell numbers are treated in the following theorem. Theorem 4. For (m, k) N the following equalities holds: ∈ ∗∗ m k+m k 2 1 1 1 1 ( 1) + ( 1) P = Q k m + P k m + Qk Pk − − . (2.7) k+i 4 2 +2 2 2 +2 4 − 2 − 2 Xi=0 m 2 1 3 1 3 P = Q k m + P k m + Q k P k m 1. (2.8) 2k+2i 4 4 +4 8 4 +4 4 4 − 8 4 − − Xi=0 m 2 3 17 1 P = Q k m + P k m P k + m + 1. (2.9) 2k+2i+1 2 4 +4 8 4 +4 − 8 4 Xi=0 Of course, the alternating sums of squares of consecutive Pell numbers, even Pell numbers and odd Pell numbers are next. 4 ZVONKO ČERIN E GIAN MARIO GIANELLA Theorem 5. For (m, k) N the following equalities holds: ∈ ∗∗ m ( 1)i P 2 = − k+i Xi=0 m ( 1) 1 k − [Q k m + P k m]+ [Q k P k] ( 1) (m + 1). (2.10) 4 2 +2 2 +2 4 2 − 2 − − m ( 1)i P 2 = − 2k+2i Xi=0 ( 1)m 1 − [3 Q k m + 4 P k m 6] + [3 Q k 4 P k 6] . (2.11) 12 4 +4 4 +4 − 12 4 − 4 − m ( 1)i P 2 = − 2k+2i+1 Xi=0 ( 1)m 1 1 − [17 Q + 24 P +6]+ Q + . (2.12) 12 4k+4m 4k+4m 12 4k 2 Now we shall consider six kinds of sums of products of Pell numbers. Theorem 6. For (m, k) N the following equalities holds: ∈ ∗∗ m Pk+i Pk+i+1 = Xi=0 3 1 ( 1)k + ( 1)k+m Q k m + P k m Q k − − . (2.13) 4 2 +2 2 +2 − 4 2 − 2 m Pk+2iPk+2i+1 = Xi=0 5 7 1 1 k Q k m + P k m Q k + P k ( 1) (m + 1). (2.14) 8 2 +4 8 2 +4 − 8 2 8 2 − − m P2k+2iP2k+2i+1 = Xi=0 5 7 1 1 Q k m + P k m Q k + P k m 1. (2.15) 8 4 +4 8 4 +4 − 8 4 8 4 − − m P2k+2i+1 P2k+2i+2 = Xi=0 29 41 1 1 Q k m + P k m Q k P k + m + 1. (2.16) 8 4 +4 8 4 +4 − 8 4 − 8 4 ONSUMSOFPELLNUMBERS 5 m P2k+4i P2k+4i+2 = Xi=0 35 33 1 1 Q k m + P k m + Q k P k 3(m + 1). (2.17) 24 4 +8 16 4 +8 24 4 − 16 4 − m P2k+4i+1 P2k+4i+3 = Xi=0 17 577 1 Q k m + P k m P k + 3(m + 1). (2.18) 2 4 +8 48 4 +8 − 48 4 The last six formulas cover the alternating forms of the relations from the previous theorem. Theorem 7. For (m, k) N the following equalities holds: ∈ ∗∗ m i ( 1) Pk i Pk i = − + + +1 Xi=0 m 1 3 1 k ( 1) Q k m + P k m + P k ( 1) (m + 1). (2.19) − 2 2 +2 4 2 +2 4 2 − − m i ( 1) Pk i Pk i = − +2 +2 +1 Xi=0 k m m 7 5 1 1 ( 1) (1 + ( 1) ) ( 1) Q k m + P k m Q k+ P k − − . (2.20) − 12 2 +4 6 2 +4 −12 2 6 2 − 2 m i ( 1) P k i P k i = − 2 +2 2 +2 +1 Xi=0 m m 7 5 1 1 1 + ( 1) ( 1) Q k m + P k m Q k + P k − . (2.21) − 12 4 +4 6 4 +4 − 12 4 6 4 − 2 m i ( 1) P k i P k i = − 2 +2 +1 2 +2 +2 Xi=0 m m 41 29 1 1 1 + ( 1) ( 1) Q k m + P k m + Q k+ P k+ − .

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    9 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us