F. T. HOWARD AND CURTIS COOPER
|
|
- Madeline Howard
- 5 years ago
- Views:
Transcription
1 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 n 1 +G n + +G n r, if n r. We will present several identities and congruences involving r-generalized Fibonacci numbers. 1. Introduction Definition 1.1. 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 n 1 +G n + +G n r, if n r. This definition is not new. According to Dickson [, p. 409], M. d Ocagne, in a series of papers from 1883 to 1890, considered (with slightly different notation) the sequence {U i } with U n = c 1 U n 1 +c U n + +c r U n r and U 0,...,U r 1 arbitrary. He also considered the sequence {u n } satisfying the same recurrence, with u i = 0 (i = 0,...,r ), u r 1 = 1, and he found a relationship between {U n } and {u n }. Evidently r and the c i s are fixed in these definitions. According to Dickson, for each sequence d Ocagne found the sum of any fixed number of consecutive terms and the limit of that sum. In one of the papers involving continued fractions each c i = 1. More recently (1960), Miles [6] used Definition 1.1 in a paper involving k k matrices with k-generalized Fibonacci numbers for elements. Kessler and Schiff [4] stated that the Miles article seems to be the oldest well-known paper on the generalized numbers. Since 1960 many more papers involving the r-generalized Fibonacci numbers have appeared, including several in The Fibonacci Quarterly. See [3] and [4] for example. Kessler and Schiff [4] gave many interesting and relevant references, and they noted that an exhaustive bibliography of these numbers would cover pages. Though Definition 1.1 is not new, the authors believe that most of the results in this paper are new, or at least not well-known. All of the proofs are original. In Section we will prove an identity that enables us to find congruences modulo k for the r-generalized Fibonacci sequence. In Section 3 we prove several identities, including a formula for the sum of the squares of the G n s. In Section 4 we find formulas for G n and G n+1, and in Section 5 we prove some miscellaneous results. A table for the r-generalized Fibonacci numbers, for r 8 can be found in Section 6. Finally, in Section 7 we present possible topics for future research. AUGUST
2 THE FIBONACCI QUARTERLY Theorem.1. For n r +1, Proof.. An Identity and Congruences for {G n } G n = G n 1 G n r 1. G n = G n 1 +G n + +G n r +0 = G n 1 +G n + +G n r +G n 1 G n G n r G n r 1 = G n 1 G n r 1. We note that Gabai [3] stated Theorem.1 without proof. Theorem.. For r n r 1, For 0 n r, G n = n r. G r+n = n+r (n+) n 1. Proof. From Theorem.1, we have, for r n r 1, We now note that G n = G n 1 = G n = = n r G r = n r. G r = G r 1 G r 1 = ( r 1 ) 1 = r 1. Assumen > 0, andassumethetheoremistrueforg r+n 1. Ifr n, thenr 1 r+n 1 r, so G r+n 1 = n 1 by the first part of Theorem.. We have G r+n = G r+n 1 G r+n 1 = [ n+r (n+1) n 1 ] n 1 = n+r (n+) n 1. In a similar way we can prove the following results. If 0 n r+1, then [( n+ G 3r+n = r+n (r +n+) r+n 1 + ) 1 ] n. If 0 n r+, then [( ) ] [( ) ] r+n+ n+ G 4r+n = 3r+n (r +n+) r+n r+n n n 3. 3 The general theorem is Theorem.3. Let m = kr +n, with 0 n r +k, and k. Then k 1 G m = m r + ( 1) j a m,j m (j+1)r j j=1 where a m,j = a m 1,j +a m r 1,j 1 with a i,0 = 1 for all i, a i,1 = 0 for i < r, and a r,1 =. 3 VOLUME 49, NUMBER 3
3 SOME IDENTITIES FOR r-fibonacci NUMBERS For example, in the Fibonacci case (r = ) the recurrence for the coefficients is a m,j = a m 1,j +a m 3,j 1 and we can construct a triangle (like Pascal s) to quickly get Theorem.4. For r and m r, G m = m r + a 10,0 = 1, a 10,1 = 8, a 10, = 14, a 10,3 =, so F 10 = G 10 = 8 (8) 5 +(14) () 1 = 55. m+r r+1 1 j=1 ( 1) j [( m rj r + j ) ( m rj r j )] m (r+1)j r. Before looking at the proof, here are some congruences we get by looking at the last term in the summation. We assume k > 1 in the proofs of congruences (.1) (.4), and we can use Theorem. to verify the cases k = 0 and k = 1. ( ) Case 1: m = (r + 1)k. Then m+r r+1 1 = k 1, and m (r +1) m+r r+1 1 r = 1. In the last term ( ) ( m kr+ k 1 m kr ) ( k 3 = k+ ) ( 3 k ) 3 = k. The exponent of in the next to last term is r +. Thus: G (r+1)k ( 1) k 1 k (mod r+ ). (.1) ( Case : m = (r+1)k+t, 0 < t < r+1. Then m+r r+1 1 = k, and m (r+1) m+r r+1 ) 1 r = t r. In the last term ( m rk r+) ( k m rk r ) k = 0 if 0 < t < r 1. In this case the exponent of in the next to last term is t+1. Thus G (r+1)k+t 0 (mod t+1 ), if 0 < t < r 1. (.) If t = r 1, then ( m rk r+) ( k m rk r ) k = (k +1) (k 1) =. Since the exponent of in the next to last term is r, we have G (r+1)k+(r 1) ( 1) k (mod r ). (.3) If t = r, then ( m rk r+) ( k m rk r ) ( k = k+ ) ( k k k ) = k +1. Thus G (r+1)k+r ( 1) k (k +1) (mod r+1 ). (.4) Proof of Theorem.4. We first prove that in Theorem.3, the upper limit of the summation, k 1, can be replaced by m+r r+1 1. Case 1: m = (r + 1)j + t, with 1 t r. In this case m = r(j + 1) + (j r + t), so k = j +1. It is easy to verify that m+r r+1 = (r+1)j+r+t r+1 = j +1 = k. Case : m = (r + 1)j. In this case, m = rj + j, so k = j. It is easy to verify that m+r r+1 = (r+1)j+r r+1 = j = k. Now we will use Theorem.3 to prove Theorem.4. Recall a n,0 = 1 for all n, and a n,1 = 0 for n < r. We know that G r = r 1 = r a r,1 1, so a r,1 =. Using the recurrence a m,j = a m 1,j +a m r 1,j 1 AUGUST
4 THE FIBONACCI QUARTERLY it is easy to see that ( ) ( ) m r + m r a m,1 = m r + = 1 1 Note that the second binomial coefficient is 0. Now we use induction on j. Suppose we know that for h = 1,...,j ( ) ( ) m rh r + m rh r a m,h =. h h Then i=j+1 (m r). a m,j+1 = a m 1,j+1 +a m r 1,j ( ) ( ) m r(j +1) r+1 m r(j +1) r 1 = a m 1,j+1 + j j ( ) ( ) m r(j +1) r+1 m r(j +1) r 1 = a m,j+1 + j j ( ) ( ) m r(j +1) r m r(j +1) r + j j m r(j+1) r+1 [( ) ( )] i i = a (j+)r+j 1,j+1 +. j j Since a (j+)r+j 1,j+1 = 0, we have a m,j+1 = m r(j+1) r+1 i=j [( ) i j Here we have used the identity ( )] i = j n i=j This completes the induction argument. ( ) i = j ( ) ( m r(j +1) r + m r(j +1) r j +1 j 1 ( ) n+1. j +1 Notice that the induction argument works in the case j = 1, since in that case we have m 3r+1 ( ) m 3r+1 i ( ) ( ) ( ) i m 3r + m 3r a m, = = 1 = i= i=1 We have used the fact that a m,j = 0 for m < (j + 1)r + (j 1). For example a m,1 = 0 if m < r; a m, = 0 if m < 3r +1, etc. This follows from the recurrence for a m,j. Note that we have used the convention ( a b) = 0 if a < b or if either a or b is negative. When r = in Theorem.4, we have the following formula for the Fibonacci numbers. Theorem.5. For m, F m = m + m+ 3 1 j=1 ( 1) j [( m j j ) ( m j j )] m 3j. 34 VOLUME 49, NUMBER 3 ).
5 SOME IDENTITIES FOR r-fibonacci NUMBERS Corresponding to (.1), (.3), (.4), the congruences for the Fibonacci numbers (for k 0) are: F 3k ( 1) k 1 k (mod 16), (.5) F 3k+1 ( 1) k (mod 4), (.6) F 3k+ ( 1) k (k +1) (mod 8). (.7) If we look at the last two terms of the summation in Theorem.5, we see that Thus, if k 0 or 3 (mod 4), If k 1 or (mod 4), F 3k+1 ( 1) k +( 1) k (10k)(k +1)(k +1) (mod 3). F 3k+1 ( 1) k (mod 8). F 3k+1 ( 1) k 5 (mod 8). The A array in Theorem.3 and Theorem.4 is interesting. For r =, the Fibonacci case, the A array is m\j a m,j for r = (Fibonacci case). For r = 3, the Tribonacci case, the Tribonacci A array is similar to the Fibonacci A array; there are just more 0 s at the top of each column. Condensing the A array in the Fibonacci case to a B array by defining b m,j = a m+3j,j we have the following B array. AUGUST
6 THE FIBONACCI QUARTERLY m\j B array. The first column of the B array is 1 and after the first entry, the first row is. Entries in the middle of the B array can be determined by adding the elements in the B array immediately to its left and directly above the entry, i.e., A closed form formula for b m,j is Here, we assume the j = 1 column is b m,j = b m,j 1 +b m 1,j. m(m+1) (m+j )(m+j 1). j! m+1. 1! The entries in the j = column of B are A in Sloane s OEIS [7]. The j = 3 column of B is A in Sloane s OEIS [7] and the j = 4 column of B is A00558 in Sloane s OEIS [7]. 3. The Sum of the Squares and Other Identities Theorem 3.1. For n r 1, r 1 G n = r 1 G n r+1 k 1 G n r k. 36 VOLUME 49, NUMBER 3
7 SOME IDENTITIES FOR r-fibonacci NUMBERS Proof. We iterate r 1 times the recurrence in Theorem.1: G n = G n 1 G n r 1 = (G n G n r ) G n r 1 = G n G n r G n r 1 = (G n 3 G n r 3 ) G n r G n r 1 = 3 G n 3 G n r 3 G n r G n r 1 r 1 = r 1 G n r+1 k 1 G n r k. Theorem 3.. For r and n r 1, r 1 G n = r 1 G n r + For the Fibonacci sequence, this identity is ( r 1 )G i 1 n r k. i=k F n = F n +F n 3. Listing this identity for r =,3,4,5, and 6 we have the resulting formulas. r = : G n = G n +G n 3 r = 3 : G n = 4G n 3 +3G n 4 +G n 5 r = 4 : G n = 8G n 4 +7G n 5 +6G n 6 +4G n 7 r = 5 : G n = 16G n 5 +15G n 6 +14G n 7 +1G n 8 +8G n 9 r = 6 : G n = 3G n 6 +31G n 7 +30G n 8 +8G n 9 +4G n G n 11. Proof of Theorem 3.. From Theorem 3.1, we have r 1 G n = r 1 G n r+1 k 1 G n r k. Thus, by Definition 1.1 applied to G n r+1, we have (note that the 1 s cancel in the first equation): r 1 r 1 G n = r 1 G n r + ( r 1 1)G n r k ( k 1 1)G n r k = r 1 G n r + = r 1 G n r + ( r 1 r 1 i=1 ( r 1 r 1 r 1 )G i 1 n r k )G i 1 n r k. i=k ( k 1 )G i 1 n r k AUGUST i=1
8 THE FIBONACCI QUARTERLY Theorem 3.3. For r, n 0, n r 1 G k + n i G k G k+i = G n G n+1. k=0 i= k=0 The special case of this identity for the Fibonacci sequence was discovered by Lucas in He discovered that for n 0, Its proof can be found in [5, pp ]. n i=1 Proof. For j = n,n 1,...,r 1, we start with and multiply by G j to get F i = F n F n+1. G j = G j+1 G j 1 G j G j r+1 G n = G ng n+1 G n G n 1 G n G n i G n G n r+1, G n 1 = G n 1 G n G n 1 G n G n 1 G n 1 i G n 1 G n r, G r 1 = G r 1 G r G r 1 G r G r 1 G r 1 i G r 1 G 0. When we add, we get n k=0 G k on the left side, and all of the nonzero terms in columns 1 and on the right side cancel except for G n G n+1. The i+1 column is n i k=0 G kg k+i and since i r 1, n r 1 G k + n i G k G k+i = G n G n+1. k=0 i= k=0 We note that Gabai [3] proved a result equivalent to Theorem 3.3. Theorem 4.1. For r, n > 0, m > 0, where A i = 4. Formulas for G n and G n+1 r G n+m = G n G m +G n G m 1 +G n 1 G m + G n+i A i, i=1 { G m+r i 1 G m+r i G m+1 (i < r ); G m+1 (i = r ). Before giving the proof, here are some applications. If we let m = n, we have: r = : F n = F n +F n 1 F n r = 3 : G n = G n +G n+1 +G n 1 G n r = 4 : G n = G n G n+1 +G n 1 G n +G n+1 G n+ r = 5 : G n = G n G n+1 +G n+ +G n 1G n G n+1 G n+ +G n+1 G n VOLUME 49, NUMBER 3
9 SOME IDENTITIES FOR r-fibonacci NUMBERS If we let m = n+1, we have (after a little manipulation) r = : F n+1 = F n +F n+1 r = 3 : G n+1 = G n +G n+1 +G n 1G n+1 +G n G n+1 r = 4 : G n+1 = G n +G n+1 +G n+ +G n 1 G n+1 +G n G n+1 r = 5 : G n+1 = G n +G n+1 G n+ +G n 1 G n+1 +G n G n+1 +G n+ G n+3. Proof. We will use Zhou s Theory of Constructing Identities (TCI) [8]. Let F r (x) = x r x r 1 x 1. Then clearly That is, modulo F r (x): m 1 F r (x) G n+i x m 1 i 0 (mod F r (x)). 0 (x r x r 1 x 1)(G n x m 1 +G n+1 x m + +G n+m r x r 1 + +G n+m 1 ) G n x m+r 1 +(G n+1 G n )x m+r +(G n+ G n+1 G n )x m+r 3 + +(G n+r G n+r 3 G n )x m+1 +(G n+r 1 G n+r G n )x m +0 x m 1 +0 x m + +0 x r (G n+m 1 +G n+m + +G n+m r )x r 1 G n+m 1. By TCI, we can replace x k by G k and congruence is changed to equality. Thus G n G m+r 1 +(G n+1 G n )G m+r +(G n+ G n+1 G n )G m+r 3 + (4.1) Notice we have used the identities +(G n+r G n+r 3 G n )G m+1 +G n 1 G m G n+m = 0. G n+r 1 G n+r G n = G n 1 (in the x m term), (G n+m 1 +G n+m + +G n+m r ) = G n+m (in the x r 1 term), G r 1 = 1; G i = 0 for i < r 1. To simplify further, use G m+r 1 = G m+r +G m+r 3 + +G m+1 +G m +G m 1 in the first term of (4.1) and notice that all the other G n terms are (G m+r +G m+r 3 + +G m+1 )G n. Thus the G n terms are reduced to G n G m +G n G m 1. Now for i = 1,...,r 3, we get all the G n+i terms together: (G m+r i 1 G m+r i+ G m+1 )G n+i and we note that the only term with G n+r is G m+1 G n+r. This completes the proof. AUGUST
10 THE FIBONACCI QUARTERLY (a) Lucas numbers. 5. Miscellaneous Results Define K n = 0 for 0 n r 3, K r = a, K r 1 = b and K n = n 1 i=n r K i if n r. Let K(x) be the generating function K(x) = K ix i. It is easy to see that K(x) = axr +(b a)x r 1 1 x x x r. Note that if a = 0 and b = 1, then K n = G n, and we use the notation K(x) = G(x). From the generating functions, it is easy to see that K n = ag n+1 +(b a)g n. In particular, if a =, b = 1, we get the Lucas sequence {L n }: which gives x Since xl(x) = G(x), we have x r x r 1 L(x) = 1 x x x r = L i x i L n = G n+1 G n. n 1 ( ) 1 n i G n = L i. (b) Relationship between G (r) n and G (r+1) n. For fixed r, write G(x) = G r (x) and G n = G (r) n ; likewise L(x) = L r (x) and L n = L (r) n. Since [ ] 1, we have which gives For example, when r = Similarly we have so G r (x) G r+1 (x) = 1 x x r+1 1 x x x r xg r (x) = G r+1 (x) x G r (x)g r+1 (x), G (r+1) n+1 = G (r) G (3) n + n 1 G (r) i G (r+1) n 1 i. n 1 n+1 = F n + F i G (3) n 1 i. L r+1 (x) = xl r (x)+x L r+1 (x)g r (x) L (r+1) n 1 n+1 = L (r) n + L (r+1) i G (r) n 1 i. 40 VOLUME 49, NUMBER 3
11 The case r = 1 gives the well-known formulas SOME IDENTITIES FOR r-fibonacci NUMBERS n 1 n 1 F n+1 = 1+ F i, L n+1 = 1+ L i. (c) Another example using Zhou s TCI. If we use Zhou s Theory of Constructing Identities on G n = G n 1 G n 1 r, we have (x r+1 x r +1)(G n x m 1 +G n+1 x m + +G n m 1 ) 0 (mod x r+1 x r +1). Simplifying as we did before, we get r 1 G n+m = G n+m r +G n G m+r G n 1 i G m+i, which could be written or r 1 G n+m+1 G n+m = G n G m+r G n 1 i G m+i, r 1 G n = G n r +G n G n+r G n 1 i G n+i. 6. Table of r-generalized Fibonacci Numbers The first few terms of the r-generalized Fibonacci sequence for r 8 are given in the following table. r-generalized Fibonacci Sequences r\n The r-generalized Fibonacci sequences for r =,3,4,5,6,7,8 can be found in Sloane [7] as sequences A000045, A000073, A000078, A001591, A00159, A1189, and A0796, respectively. AUGUST
12 THE FIBONACCI QUARTERLY 7. Topics for Future Study Many of the theorems, like Theorem 3.3, can undoubtedly be proved using combinatorial arguments in the manner of Benjamin and Quinn [1]. In fact, G n+r 1 (for n 0) counts the number of tilings of an n-board with tiles of length at most r. It would be interesting to see different approaches to our theorems. The r-generalized Lucas sequence could obviously be examined more thoroughly, and more relationships to the r-generalized Fibonacci numbers can probably be found. The more general recurrence G n = c 1 G n 1 +c G n + +c r G n r, where the c i s are constants, can certainly be studied in more detail. We leave all of these topics for future research. Acknowledgment The authors wish to express their appreciation to the anonymous referee for the careful reading and the helpful comments and suggestions that improved the quality of this paper. References [1] A. T. Benjamin and J. J. Quinn, Proofs That Really Count-The Art of Combinatorial Proof, Mathematical Association of America, Washington, DC, 003, 8 9. [] L. E. Dickson, History of the Theory of Numbers, Volume 1, Chelsea Publishing Company, New York, [3] H. Gabai, Generalized Fibonacci k-sequences, The Fibonacci Quarterly, 8.1 (1970), [4] D. Kessler and J. Schiff, A combinatoric proof and generalization of Ferguson s formula for k-generalized Fibonacci numbers, The Fibonacci Quarterly, 4.3 (004), [5] T. Koshy, Fibonacci and Lucas Numbers with Application, John Wiley & Sons, Inc., New York, 001. [6] E. P. Miles, Jr. Generalized Fibonacci numbers and associated matrices, American Mathematical Monthly, 67 (1960), [7] N. J. A. Sloane (Ed.), The On-Line Encyclopedia of Integer Sequences (008), njas/sequences/. [8] C. Zhou, Constructing identities involving kth-order F-L numbers by using the characteristic polynomial, Applications of Fibonacci Numbers, Volume 8, Edited F. T. Howard, 1999, MSC010: 11B39 Department of Mathematics, Box 7388, Reynolda Station, Wake Forest University, Winston- Salem, NC address: howard@wfu.edu Department of Mathematics and Computer Science, University of Central Missouri, Warrensburg, MO address: cooper@ucmo.edu 4 VOLUME 49, NUMBER 3
1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as
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 8 >< 0, if 0 n < r 1; G n = 1, if n = r
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 informationLinks Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers
Links Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers arxiv:1611.09181v1 [math.co] 28 Nov 2016 Denis Neiter and Amsha Proag Ecole Polytechnique Route de Saclay 91128 Palaiseau
More informationArithmetic properties of lacunary sums of binomial coefficients
Arithmetic properties of lacunary sums of binomial coefficients Tamás Mathematics Department Occidental College 29th Journées Arithmétiques JA2015, July 6-10, 2015 Arithmetic properties of lacunary sums
More informationEVERY POSITIVE K-BONACCI-LIKE SEQUENCE EVENTUALLY AGREES WITH A ROW OF THE K-ZECKENDORF ARRAY
EVERY POSITIVE K-BONACCI-LIKE SEQUENCE EVENTUALLY AGREES WITH A ROW OF THE K-ZECKENDORF ARRAY PETER G. ANDERSON AND CURTIS COOPER Abstract. For k 2, a fixed integer, we work with the k-bonacci sequence,
More informationbe a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by
THE POWER OF 2 DIVIDING THE COEFFICIENTS OF CERTAIN POWER SERIES F. T. Howard Wake Forest University, Box 7388 Reynolda Station, Winston-Salem, NC 27109 (Submitted August 1999-Final Revision January 2000)
More information#A91 INTEGERS 18 (2018) A GENERALIZED BINET FORMULA THAT COUNTS THE TILINGS OF A (2 N)-BOARD
#A91 INTEGERS 18 (2018) A GENERALIZED BINET FORMULA THAT COUNTS THE TILINGS OF A (2 N)-BOARD Reza Kahkeshani 1 Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan,
More informationCounting on Continued Fractions
appeared in: Mathematics Magazine 73(2000), pp. 98-04. Copyright the Mathematical Association of America 999. All rights reserved. Counting on Continued Fractions Arthur T. Benjamin Francis Edward Su Harvey
More informationFIBONACCI EXPRESSIONS ARISING FROM A COIN-TOSSING SCENARIO INVOLVING PAIRS OF CONSECUTIVE HEADS
FIBONACCI EXPRESSIONS ARISING FROM A COIN-TOSSING SCENARIO INVOLVING PAIRS OF CONSECUTIVE HEADS MARTIN GRIFFITHS Abstract. In this article we study a combinatorial scenario which generalizes the wellknown
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 informationarxiv: v3 [math.co] 6 Aug 2016
ANALOGUES OF A FIBONACCI-LUCAS IDENTITY GAURAV BHATNAGAR arxiv:1510.03159v3 [math.co] 6 Aug 2016 Abstract. Sury s 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and
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 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 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 informationCombinatorial proofs of Honsberger-type identities
International Journal of Mathematical Education in Science and Technology, Vol. 39, No. 6, 15 September 2008, 785 792 Combinatorial proofs of Honsberger-type identities A. Plaza* and S. Falco n Department
More informationEnumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I
Enumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I Daryl DeFord Washington State University January 28, 2013 Roadmap 1 Problem 2 Symmetry 3 LHCCRR as Vector Spaces 4 Generalized
More informationarxiv: v1 [math.co] 4 Mar 2010
NUMBER OF COMPOSITIONS AND CONVOLVED FIBONACCI NUMBERS arxiv:10030981v1 [mathco] 4 Mar 2010 MILAN JANJIĆ Abstract We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers
More informationCONVOLUTION TREES AND PASCAL-T TRIANGLES. JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 1986) 1.
JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 986). INTRODUCTION Pascal (6-66) made extensive use of the famous arithmetical triangle which now bears his name. He wrote
More informationThe Combinatorialization of Linear Recurrences
The Combinatorialization of Linear Recurrences Arthur T Benjamin Harvey Mudd College Claremont, CA, USA benjamin@hmcedu Jennifer J Quinn University of Washington Tacoma Tacoma, WA USA jjquinn@uwedu Halcyon
More informationSOME IDENTITIES INVOLVING DIFFERENCES OF PRODUCTS OF GENERALIZED FIBONACCI NUMBERS
SOME IDENTITIES INVOLVING DIFFERENCES OF PRODUCTS OF GENERALIZED FIBONACCI NUMBERS CURTIS COOPER Abstract. Melham discovered the Fibonacci identity F n+1f n+2f n+6 F 3 n+3 = 1 n F n. Melham then considered
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 informationCounting on Chebyshev Polynomials
DRAFT VOL. 8, NO., APRIL 009 1 Counting on Chebyshev Polynomials Arthur T. Benjamin Harvey Mudd College Claremont, CA 91711 benjamin@hmc.edu Daniel Walton UCLA Los Angeles, CA 90095555 waltond@ucla.edu
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 informationImpulse Response Sequences and Construction of Number Sequence Identities
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8. Impulse Response Sequences and Construction of Number Sequence Identities Tian-Xiao He Department of Mathematics Illinois Wesleyan
More informationDecomposition of Pascal s Kernels Mod p s
San Jose State University SJSU ScholarWorks Faculty Publications Mathematics January 2002 Decomposition of Pascal s Kernels Mod p s Richard P. Kubelka San Jose State University, richard.kubelka@ssu.edu
More informationSome Congruences for the Partial Bell Polynomials
3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics
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 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 informationSummation of certain infinite Fibonacci related series
arxiv:52.09033v (30 Dec 205) Summation of certain infinite Fibonacci related series Bakir Farhi Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes Université de Bejaia 06000 Bejaia Algeria
More informationEQUATIONS WHOSE ROOTS ARE T I E nth POWERS OF T I E ROOTS OF A GIVEN CUBIC EQUATION
EQUATIONS WHOSE ROOTS ARE T I E nth POWERS OF T I E ROOTS OF A GIVEN CUBIC EQUATION N. A, DRAiMand MARJORIE BICKNELL Ventura, Calif, and Wilcox High School, Santa Clara, Calif. Given the cubic equation
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 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 informationFrom Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers
Kennesaw State University DigitalCommons@Kennesaw State University Honors College Capstones and Theses Honors College Spring 5-6-2017 From Simplest Recursion to the Recursion of Generalizations of Cross
More informationREPRESENTING POSITIVE INTEGERS AS A SUM OF LINEAR RECURRENCE SEQUENCES
REPRESENTING POSITIVE INTEGERS AS A SUM OF LINEAR RECURRENCE SEQUENCES NATHAN HAMLIN AND WILLIAM A. WEBB Abstract. The Zeckendorf representation, using sums of Fibonacci numbers, is widely known. Fraenkel
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 informationRECOUNTING DETERMINANTS FOR A CLASS OF HESSENBERG MATRICES. Arthur T. Benjamin Department of Mathematics, Harvey Mudd College, Claremont, CA 91711
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A55 RECOUNTING DETERMINANTS FOR A CLASS OF HESSENBERG MATRICES Arthur T. Benjamin Department of Mathematics, Harvey Mudd College,
More informationarxiv: v2 [math.co] 29 Jun 2016
arxiv:1508.04949v2 [math.co] 29 Jun 2016 Complementary Families of the Fibonacci-Lucas Relations Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Helmut
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 informationCompositions, Bijections, and Enumerations
Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations COGS- Jack N. Averitt College of Graduate Studies Fall 2012 Compositions, Bijections, and Enumerations Charles
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 informationOn Certain Sums of Stirling Numbers with Binomial Coefficients
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015, Article 15.9.6 On Certain Sums of Stirling Numbers with Binomial Coefficients H. W. Gould Department of Mathematics West Virginia University
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 informationCOMPOSITIONS AND FIBONACCI NUMBERS
COMPOSITIONS AND FIBONACCI NUMBERS V. E. HOGGATT, JR., and D. A. LIND San Jose State College, San Jose, California and University of Cambridge, England 1, INTRODUCTION A composition of n is an ordered
More informationTILING PROOFS OF SOME FIBONACCI-LUCAS RELATIONS. Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN , USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 TILING PROOFS OF SOME FIBONACCI-LUCAS RELATIONS Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN
More informationWeek 9-10: Recurrence Relations and Generating Functions
Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably
More informationComputers and Mathematics with Applications
Computers and Mathematics with Applications 63 (0) 36 4 Contents lists available at SciVerse ScienceDirect Computers and Mathematics with Applications journal homepage: wwwelseviercom/locate/camwa A note
More informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationPrime Numbers in Generalized Pascal Triangles
Prime Numbers in Generalized Pascal Triangles G. Farkas, G. Kallós Eötvös Loránd University, H-1117, Budapest, Pázmány Péter sétány 1/C, farkasg@compalg.inf.elte.hu Széchenyi István University, H-9026,
More informationInteger Sequences Related to Compositions without 2 s
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 6 (2003), Article 03.2.3 Integer Sequences Related to Compositions without 2 s Phyllis Chinn Department of Mathematics Humboldt State University Arcata,
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 informationOn Polynomial Pairs of Integers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015), Article 15.3.5 On Polynomial Pairs of Integers Martianus Frederic Ezerman Division of Mathematical Sciences School of Physical and Mathematical
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationCATALAN DETERMINANTS A COMBINATORIAL APPROACH
CATALAN DETERMINANTS A COMBINATORIAL APPROACH ARTHUR T BENJAMIN, NAIOMI T CAMERON, JENNIFER J QUINN, AND CARL R YERGER Abstract Determinants of matrices involving the Catalan sequence have appeared throughout
More information#A5 INTEGERS 17 (2017) THE 2-ADIC ORDER OF SOME GENERALIZED FIBONACCI NUMBERS
#A5 INTEGERS 7 (207) THE 2-ADIC ORDER OF SOME GENERALIZED FIBONACCI NUMBERS Tamás Lengyel Mathematics Department, Occidental College, Los Angeles, California lengyel@oxy.edu Diego Marques Departamento
More informationMinimal multipliers for consecutive Fibonacci numbers
ACTA ARITHMETICA LXXV3 (1996) Minimal multipliers for consecutive Fibonacci numbers by K R Matthews (Brisbane) 1 Introduction The Fibonacci and Lucas numbers F n, L n (see [2]) are defined by Since F 1
More informationMath 3 Variable Manipulation Part 4 Polynomials B COMPLEX NUMBERS A Complex Number is a combination of a Real Number and an Imaginary Number:
Math 3 Variable Manipulation Part 4 Polynomials B COMPLEX NUMBERS A Complex Number is a combination of a Real Number and an Imaginary Number: 1 Examples: 1 + i 39 + 3i 0.8.i + πi + i/ A Complex Number
More informationarxiv: v1 [math.co] 13 Jul 2017
A GENERATING FUNCTION FOR THE DISTRIBUTION OF RUNS IN BINARY WORDS arxiv:1707.04351v1 [math.co] 13 Jul 2017 JAMES J. MADDEN Abstract. Let N(n, r, k) denote the number of binary words of length n that begin
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 informationarxiv: v1 [math.nt] 17 Nov 2011
On the representation of k sequences of generalized order-k numbers arxiv:11114057v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Sahin a a Department of Mathematics, Faculty of Arts Sciences, Gaziosmanpaşa
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 informationWILLIAM LOWELL PUTNAM MATHEMATICAL COMPETITION. (3k(k + 1) + 1), for n 1.
Problem A1. Find the sum n (3k(k + 1) + 1), for n 1. k=0 The simplest way to solve this problem is to use the fact that the terms of the sum are differences of consecutive cubes: 3k(k + 1) + 1 = 3k 2 +
More informationarxiv: v1 [math.co] 21 Sep 2015
Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded
More informationSPLITTING FIELDS AND PERIODS OF FIBONACCI SEQUENCES MODULO PRIMES
SPLITTING FIELDS AND PERIODS OF FIBONACCI SEQUENCES MODULO PRIMES SANJAI GUPTA, PAROUSIA ROCKSTROH, AND FRANCIS EDWARD SU 1. Introduction The Fibonacci sequence defined by F 0 = 0, F 1 = 1, F n+1 = F n
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
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 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 information{ 0! = 1 n! = n(n 1)!, n 1. n! =
Summations Question? What is the sum of the first 100 positive integers? Counting Question? In how many ways may the first three horses in a 10 horse race finish? Multiplication Principle: If an event
More informationCombinatorial Proofs and Algebraic Proofs I
Combinatorial Proofs and Algebraic Proofs I Shailesh A Shirali Shailesh A Shirali is Director of Sahyadri School (KFI), Pune, and also Head of the Community Mathematics Centre in Rishi Valley School (AP).
More informationPROPERTIES OF THE ROOTS OF TRIBONACCI-TYPE POLYNOMIALS
PROPERTIES OF THE ROOTS OF TRIBONACCI-TYPE POLYNOMIALS ALEX DURBIN AND HUEI SEARS Abstract. Consider Tribonacci-type polynomials defined by the following recurrence relation T n(x) = α(x) T n 1 (x)+β(x)
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationEnumerating Binary Strings
International Mathematical Forum, Vol. 7, 2012, no. 38, 1865-1876 Enumerating Binary Strings without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University Melbourne,
More informationON MONOCHROMATIC ASCENDING WAVES. Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 13346
INTEGERS: Electronic Journal of Combinatorial Number Theory 7(), #A3 ON MONOCHROMATIC ASCENDING WAVES Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 1336
More informationDIVISIBILITY OF BINOMIAL COEFFICIENTS AT p = 2
DIVISIBILITY OF BINOMIAL COEFFICIENTS AT p = 2 BAILEY SWINFORD Abstract. This paper will look at the binomial coefficients divisible by the prime number 2. The paper will seek to understand and explain
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
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 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 informationDYNAMICS OF THE ZEROS OF FIBONACCI POLYNOMIALS M. X. He Nova Southeastern University, Fort Lauderdale, FL. D, Simon
M. X. He Nova Southeastern University, Fort Lauderdale, FL D, Simon Nova Southeastern University, Fort Lauderdale, FL P. E. Ricci Universita degli Studi di Roma "La Sapienza," Rome, Italy (Submitted December
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 informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationOn divisibility of Narayana numbers by primes
On divisibility of Narayana numbers by primes Miklós Bóna Department of Mathematics, University of Florida Gainesville, FL 32611, USA, bona@math.ufl.edu and Bruce E. Sagan Department of Mathematics, Michigan
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationA GENERALIZATION OF STIRLING NUMBERS
Hongquan Yu Institute of Mathematical Sciences, Dalian University of Technology, Dalian 6024, China (Submitted September 996-Final Revision December 996). INTRODUCTION Let W(x), fix), g(x) be formal power
More informationNOTES ON OCT 4, 2012
NOTES ON OCT 4, 0 MIKE ZABROCKI I had planned a midterm on Oct I can t be there that day I am canceling my office hours that day and I will be available on Tuesday Oct 9 from 4-pm instead I am tempted
More informationO N T H E fc**-order F-L I D E N T I T Y
O N T H E fc**-order F-L I D E N T I T Y Chizhong Zhou Department of Computer and Information Engineering, Yueyang Normal University Yueyang, Hunan 414000, PR China email: chizhongz@yeah.net Fredric T*
More informationG E N E R A L I Z E D C O N V O L U T I O N A R R A Y S
G E N E R A L I Z E D C O N V O L U T I O N A R R A Y S V. E. HOGGATT,JR. San Jose State University, San Jose, California 00192 G. E. BERGUM South Dakota State University, Brookings, Sooth Dakota 57006
More informationπ in terms of φ via the Machin s Route
in terms of φ via the Machin s Route Hei-Chi Chan Mathematical Science Program, University of Illinois at Springfield Springfield, IL 62703-507 email: chan.hei-chi@uis.edu Abstract In this paper, we prove
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by RAYMOND E. WHITNEY Please send all communications concerning to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 17745. This department especially welcomes problems
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 informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationAlgorithmic Approach to Counting of Certain Types m-ary Partitions
Algorithmic Approach to Counting of Certain Types m-ary Partitions Valentin P. Bakoev Abstract Partitions of integers of the type m n as a sum of powers of m (the so called m-ary partitions) and their
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
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 informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationThe Membership Problem for a, b : bab 2 = ab
Semigroup Forum OF1 OF8 c 2000 Springer-Verlag New York Inc. DOI: 10.1007/s002330010009 RESEARCH ARTICLE The Membership Problem for a, b : bab 2 = ab D. A. Jackson Communicated by Gerard J. Lallement Throughout,
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 informationA CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS
A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS Gregory Tollisen Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA tollisen@oxy.edu
More informationTHE NUMBER OF PATHS IN BOUNDARY RESTRICTED PASCAL TRIANGLE
THE NUMBER OF PATHS IN BOUNDARY RESTRICTED PASCAL TRIANGLE KINGO KOBAYASHI, HAJIME SATO, AND MAMORU HOSHI Abstract In this tal, we provide several forms of the generator for counting the number of paths
More information