#A40 INTEGERS 13 (2013) FINITE SUMS THAT INVOLVE RECIPROCALS OF PRODUCTS OF GENERALIZED FIBONACCI NUMBERS
|
|
- Arline Davis
- 5 years ago
- Views:
Transcription
1 #A40 INTEGERS 3 (203) FINITE SUMS THAT INVOLVE RECIPROCALS OF PRODUCTS OF GENERALIZED FIBONACCI NUMBERS R S Melham School of Mathematical Sciences, University of Technology, Sydney, Australia raymelham@utseduau Received: 2/4/2, Accepted: 4/30/3, Published: 6/24/3 Abstract In this paper we find closed forms for certain finite sums In each case the denominator of the summand consists of products of generalized Fibonacci numbers Furthermore, we express each closed form in terms of rational numbers Introduction The Fibonacci and Lucas numbers are defined, respectively, for all integers n, by F n = F + F n 2, F 0 = 0, F =, L n = L + L n 2, L 0 = 2, L = Define, for all integers n, the sequences {U n } and {V n } by U n = pu + U n 2, U 0 = 0, U =, () V n = pv + V n 2, V 0 = 2, V = p, (2) in which p is a positive integer Then {U n } and {V n } are integer sequences that generalize the Fibonacci and Lucas numbers, respectively Throughout this paper p is taken to be a positive integer Let = p Then with the use of standard difference techniques it can be shown that the closed forms (the Binet forms) for U n and V n are U n = αn β n α β, V n = α n + β n, (3) where α = p + /2, and β = p /2 Next we define, for all integers n, the sequence {W n } by W n = pw + W n 2, W 0 = a, W = b, (4) I dedicate this paper to my mother Maria She continues to be a fountain of love and support
2 INTEGERS: 3 (203) 2 where a 0 and b 0 are integers with (a, b) = (0, 0) These conditions on a and b, together with the fact that p is assumed to be a positive integer, ensure that each of the reciprocal sums in this paper is well defined It can be shown that W n = Aαn Bβ n, (5) α β where A = b aβ and B = b aα Associated with {W n } is the constant e W = AB = b 2 pab a 2, which occurs in the sequel Accordingly, e F = and e L = 5 An identity linking the Fibonacci and Lucas numbers is L n = F + F n+, and a similar identity links the sequences {U n } and {V n } Motivated by this we define a companion sequence W n of {Wn } by W n = W + W n+ With the use of (5) we see that W n = Aα n + Bβ n (6) The sequences {W n } and W n generalize the sequences {Un } and {V n }, respectively Furthermore U n = V n, and V n = U n, so that F n = L n, and L n = 5F n Let k, m 0, and n 2 be integers In this paper (in Section 3) we give a closed expression, in terms of rational numbers, for each of the following sums: S (k, m, n) = T (k, m, n) = T 2 (k, m, n) = T 3 (k, m, n) = X (k, m, n) = ( ) ki W ki+m W k(i+)+m, (7) ( ) ki U k(i+)+m W ki+m W k(i+)+m W k(i+2)+m, (8) ( ) ki V k(i+)+m W ki+m W k(i+)+m W k(i+2)+m, (9) ( ) ki W k(i+)+m W ki+m W k(i+)+m W k(i+2)+m, (0) W ki+m W k(i+)+m W k(i+2)+m W k(i+3)+m () In Section 2 we present some background and motivation for our study In Section 3 we present our main results, and in Section 4 we present a detailed proof of one of our results The method of proof that we outline can be used to prove all the results in this paper It is reasonable to surmise that there are sums, analogous to (7)-(), with longer products in their denominators, for which closed forms can be found In Sections 5, 6, and 7 we select some of (7)-() and show that this is the case
3 INTEGERS: 3 (203) 3 2 Background and Motivation The broad question of summation of reciprocals that involve Fibonacci or generalized Fibonacci numbers has a long history In this short paper it is not our intention to give this history Instead, in the next few paragraphs, we give a brief commentary on work that we have cited on reciprocal sums that involve the summands in (7)-() After this, we indicate the motivation for the present paper André-Jeannin [] considered the summand in (7) for the particular cases W n = U n and W n = V n Taking m = 0 and k an odd integer, he expressed the infinite sums in terms of the Lambert Series L(x) = x i, x < xi Inspired by the work of André-Jeannin [], the authors in [5] considered the analogues of U n and V n for the recurrence W n = pw W n 2, and obtained analogues of André-Jeannin s results for these sequences The authors first obtained two finite sums in terms of the irrational roots of x 2 px + = 0 They then took the appropriate limits to obtain the corresponding infinite sums Interestingly, these infinite sums did not involve the Lambert Series, but were expressed in terms of the irrational roots of x 2 px + = 0 Filipponi [3] considered the summand in (7) for the particular cases W n = U n and W n = V n Taking m = 0 and k an even integer, he expressed the infinite sums in terms of α and β André-Jeannin [2] considered the more general sequence of integers defined by W n = pw qw n 2, in which the initial values W 0 and W are integers, and p and q are integers with pq = 0 For this sequence he studied the sums W ki+m W k(i+i0)+m and q ki+m, (2) W ki+m W k(i+i0)+m for integers k, m 0, and i 0 In the course of his analysis, André- Jeannin expressed any finite sums in terms of one of the roots of x 2 px + q = 0 Furthermore, in (2), he evaluated only the sum on the right in terms of rational numbers In [6] we studied the infinite sums W k(i+m) W ki W k(i+m) W k(i+2m), (3) and ( ) i W ki W k(i+m) W k(i+2m) W k(i+3m), (4)
4 INTEGERS: 3 (203) 4 in which k and m are odd integers In [7] we studied the infinite sums and W k(i+m) W ki W k(i+m) W k(i+2m), (5) W ki W k(i+m) W k(i+2m) W k(i+3m), (6) in which k and m are integers with k even For (3)-(6) it was only in the case of (5) that we managed to express the infinite sum as a finite sum of rational numbers Reflecting upon the results in the foregoing paragraphs, we realized that sums (finite or infinite) involving summands that are similar to those in (7)-() are not usually evaluated in terms of rational numbers It was this realization that prompted us to embark upon the investigation that led to the present paper We list two finite sums (see [8]) that we recently evaluated in terms of rational numbers F ki+m F k(i+)+m = where k > 0 is an even integer, and m > 0 is any integer L ki+m L k(i+)+m = F k() F k F k+m F kn+m, n >, (7) F k() F k L k+m L kn+m, n >, (8) where k = 0 is an even integer, and m is any integer In the present paper our evaluation of S (k, m, n) generalizes both (7) and (8) 3 The Main Results We now state our main results As stated in Section, in (9)-(23) k, m 0, and n 2 are assumed to be integers We have U k W k+m S (k, m, n) = ( )k U k() W kn+m, (9) e W U 2k W k+m T (k, m, n) = U k W k U k() W kn+m + ( )k+ W k U kn W k(n+)+m + ( )k+ W k W 2k+m, (20)
5 INTEGERS: 3 (203) 5 e W U 2k W k+m T 2 (k, m, n) = U k W k U k() W kn+m + ( )k+ W k U kn W k(n+)+m + ( )k W k W 2k+m, (2) U k W k+m T 3 (k, m, n) = ( )k ( )kn W k+m, (22) W 2k+m W kn+m W k(n+)+m e W V k U 3k W k+m X (k, m, n) = ( )m W 4k+m + ( )k+m Uk() W 2k+m W 3k+m Uk 2 W kn+m + ( )k+ V 2k U kn W k(n+)+m + U k(n+) W k(n+2)+m (23) To illustrate, we present two examples of (23) Let k = and m = 0 Then for W n = F n (23) becomes = 7 F i F i+ F i+2 F i+3 4 F + 3F n + F n+ (24) 2 F n F n+ F n+2 Let k = 2 and m = 0 Then for W n = L n (23) becomes = L 2i L 2(i+) L 2(i+2) L 2(i+3) 432 F2() 7F 2n + F 2(n+) 360 L 2n L 2(n+) L 2(n+2) (25) 4 The Method of Proof In this section, to illustrate our method of proof, we prove (23) in detail We require the following four identities, which can be proved with the use of the closed forms: and U kn W kn+m U k() W k(n+)+m = ( ) k(n+) U k W k+m, (26) U 4k W 2k+m ( ) k U k W 3k+m U 2 k W 4k+m = ( ) k U 3k W k+m, (27) W 2k+m W 3k+m W k+m W 4k+m = ( ) k+m e W U 2 k V k, (28) W kn+m W k(n+)+m V 2k W kn+m W k(n+3)+m (29) + W k(n+2)+m W k(n+3)+m = ( ) kn+m e W U k V k U 3k
6 INTEGERS: 3 (203) 6 For n 2 denote the right side of (23) by R (k, m, n) Then R (k, m, n + ) R (k, m, n) = ( )k+m U kn Uk 2 U k() W k(n+)+m W kn+m + ( )m+ V 2k Uk(n+) Uk 2 W k(n+2)+m + ( )k+m Uk(n+2) Uk 2 W k(n+3)+m With the use of (26) the right side becomes ( ) kn+m W k+m U k W kn+m W k(n+)+m and with the use of (29) we see that (30) simplifies to V 2k U kn W k(n+)+m U k(n+) W k(n+2)+m W k(n+)+m W k(n+2)+m + W k(n+2)+m W k(n+3)+m, (30) Thus Next, e W V k U 3k W k+m W kn+m W k(n+)+m W k(n+2)+m W k(n+3)+m (3) R (k, m, n + ) R (k, m, n) (32) = e W V k U 3k W k+m (X (k, m, n + ) X (k, m, n)) R (k, m, 2) = ( )k+m U 2 k Uk + ( )k+ U 4k + U 3k W 2k+m W 3k+m W 4k+m (33) + ( )m W 4k+m W 2k+m W 3k+m Expressing the right side of (33) as a fraction with denominator U 2 k W 2k+mW 3k+m W 4k+m, the numerator is ( ) m+ W 4k+m U4k W 2k+m ( ) k U k W 3k+m U 2 k W 4k+m + ( ) k+m U 3k W 2k+m W 3k+m Then, with the use of (27) and (28), we see that (34) R (k, m, 2) = ( )k+m U 3k (W 2k+m W 3k+m W k+m W 4k+m ) U 2 k W 2k+mW 3k+m W 4k+m (35) e W Uk 2 = V ku 3k Uk 2W 2k+mW 3k+m W 4k+m e W V k U 3k = W 2k+m W 3k+m W 4k+m = e W V k U 3k W k+m X (k, m, 2)
7 INTEGERS: 3 (203) 7 Taken together, (32) and (35) show that (23) is true We remark that all the results in this paper can be proved in a similar manner Above we made use of identities (26)-(29) to assist in the proof An alternative method is to simply use brute force Specifically, to prove that two quantities are equal we substitute the closed forms of the sequences in question and expand with the use of a computer algebra system All of the results in this paper can be proved with this method With this method any occurrence of e W is replaced by AB 5 Sums that Belong to the Same Family as T 3 (k, m, n) Throughout the remainder of this paper k, m 0, and n 2 are assumed to be integers Let us write (22) as U k W k+m W 2k+m T 3 (k, m, n) = ( ) k ( )kn W k+m W 2k+m W kn+m W k(n+)+m (36) Now define the following sum, where the denominator of the summand consists of seven factors T 7 (k, m, n) = ( ) ki W k(i+3)+m W ki+m W k(i+)+m W k(i+6)+m (37) In (37) we have modified our notation to make it more suggestive Specifically, the number 7 in the subscript of T 7 denotes seven factors in the denominator of the summand We continue this convention in what follows Next, define the following sum, where the denominator of the summand consists of eleven factors T (k, m, n) = ( ) ki W k(i+5)+m W ki+m W k(i+)+m W k(i+0)+m (38) Finally, define the following sum, where the denominator of the summand consists of fifteen factors T 5 (k, m, n) = ( ) ki W k(i+7)+m W ki+m W k(i+)+m W k(i+4)+m (39) In each of (37)-(39) the analogy with (0) is clear Furthermore, the pattern in (36) can be extended to yield U 3k W k+m W 6k+m T 7 (k, m, n) = ( ) k ( )kn W k+m W 6k+m W kn+m W k(n+5)+m, (40)
8 INTEGERS: 3 (203) 8 and U 5k W k+m W 0k+m T (k, m, n) = ( ) k ( )kn W k+m W 0k+m W kn+m W k(n+9)+m, (4) U 7k W k+m W 4k+m T 5 (k, m, n) = ( ) k ( )kn W k+m W 4k+m W kn+m W k(n+3)+m (42) The lists of formulas (37)-(39) and (40)-(42) have clearly defined patterns and can easily be extended by the reader Are there similar sums, for which closed forms exist, that have 5, 9, 3, factors in the denominator of the summand? We have discovered such sums The first few representatives of these sums are t 5 (k, m, n) = t 9 (k, m, n) = t 3 (k, m, n) = W k(i+2)+m W ki+m W k(i+)+m W k(i+4)+m, (43) W k(i+4)+m W ki+m W k(i+)+m W k(i+8)+m, (44) W k(i+6)+m W ki+m W k(i+)+m W k(i+2)+m (45) We have found that U 2k W k+m W 4k+m t 5 (k, m, n) = W k+m W 4k+m W kn+m W k(n+3)+m, (46) U 4k W k+m W 8k+m t 9 (k, m, n) = W k+m W 8k+m W kn+m W k(n+7)+m, (47) U 6k W k+m W 2k+m t 3 (k, m, n) = W k+m W 2k+m W kn+m W k(n+)+m (48) We have not been able to find closed forms for those counterparts to (43)-(45) where each summand is multiplied by ( ) ki The sums (43)-(45) together with their respective closed forms (46)-(48) have clearly defined patterns and can easily be extended by the reader Let k = 2 and m = 0 Then for W n = F n (40) becomes L 2(i+3) F 2i F 2(i+) F 2(i+6) = Let k = and m = 0 Then for W n = L n (40) becomes ( ) i F i+3 L i L i+ L i+6 = F 2n F 2(n+) F 2(n+5) (49) 6632( )n L n L n+ L n+5 (50)
9 INTEGERS: 3 (203) 9 6 Sums that Belong to the Same Family as S (k, m, n) Define the following sum, where the denominator of the summand consists of six factors ( ) ki S 6 (k, m, n) = (5) W ki+m W k(i+)+m W k(i+5)+m We have managed to find a closed form for (5) To present this closed form succinctly we define three quantities c i = c i (k) as follows: Then c 0 =, c = ( ) k+ V k V 3k, c 2 = ( )k V 6k + V 2k + 2( ) k 2 U k(n 2) i=0 e 2 W U k U 5k (S 6 (k, m, n) S 6 (k, m, 2)) = (52) 2 c i + W (2+i)k+m W (n+i)k+m W (6 i)k+m W (n+4 i)k+m Indeed, numerical evidence suggests that a similar closed form exists for the analogous sum S 0 (k, m, n) with ten factors in the denominator of the summand, and for the analogous sum S 4 (k, m, n) with fourteen factors in the denominator of the summand Numerical evidence also suggests that similar closed forms exist for analogous sums that have 8, 22, 26, factors in the denominator of the summand Let k = 2 and m = 0 Then for W n = F n (52) becomes F 2i F 2(i+) F 2(i+5) 44 = F 2(n 2) 3F 2n 27 4F 2(n+) F 2(n+2) 55F 2(n+3) + (53) 44F 2(n+4) Let k = and m = 0 Then for W n = L n (52) becomes ( ) i L i L i+ L i = F n 2 3L n + L n L n+3 + 8L n+4 7L n+2 (54)
10 INTEGERS: 3 (203) 0 7 Sums that Belong to the Same Family as X (k, m, n) Define the following sum, where the denominator of the summand consists of eight factors X 8 (k, m, n) = (55) W ki+m W k(i+)+m W k(i+7)+m We have managed to find a closed form for (55) In order to present this closed form we define four quantities f i = f i (k) as follows: Then f 0 =, f = U 3kV 4k U k, f 2 = ( )k U 3k V8k + ( ) k V 2k +, U k f 3 = ( )k+ V 4k V8k + V 4k + 2( ) k V 2k e 3 W U k U 7k (X 8 (k, m, n) X 8 (k, m, 2)) = (56) 3 ( ) m U k(n 2) f i + W (2+i)k+m W (n+i)k+m W (8 i)k+m W (n+6 i)k+m i=0 Numerical evidence suggests that similar closed forms exist for analogous sums that have 2, 6, 20, factors in the denominator of the summand Let k = and m = 0 Then for W n = F n (56) becomes 320 F i F i+ F i+7 2 = F n 2 F n 7 F n+ 30 F n F n+4 4 3F n+5 + 2F n+6 F n+3 (57) 8 Concluding Comments We have discovered closed forms for variants of (8)-(0) that we do not present here For instance, we have discovered a closed form for ( ) ki U ki+m W ki+m W k(i+)+m W k(i+2)+m (58) Furthermore, in the spirit of Sections 5-7, we have discovered lengthier analogues of these variants The possibilities seem endless
11 INTEGERS: 3 (203) Acknowledgment of priority: Just prior to submitting this article I was made aware of Theorem in [4] In fact our result (9) is a consequence of Theorem in [4], as is our main result in [8] I thank Zhi-Wei Sun for alerting me to [4] References [] R André-Jeannin, Lambert series and the summation of reciprocals in certain Fibonacci- Lucas-type sequences, Fibonacci Quart 28 (990), [2] R André-Jeannin, Summation of reciprocals in certain second-order recurring sequences, Fibonacci Quart 35 (997), [3] P Filipponi, A note on two theorems of Melham and Shannon, Fibonacci Quart 36 (998), [4] Hong Hu, Zhi-Wei Sun & Jian-Xin Liu, Reciprocal sums of second-order recurrent sequences, Fibonacci Quart 39 (200), [5] R S Melham & A G Shannon, On reciprocal sums of Chebyshev related sequences, Fibonacci Quart 33 (995), [6] R S Melham, Summation of reciprocals which involve products of terms from generalized Fibonacci sequences, Fibonacci Quart 38 (2000), [7] R S Melham, Summation of reciprocals which involve products of terms from generalized Fibonacci sequences-part II, Fibonacci Quart 39 (200), [8] R S Melham, On finite sums of Good and Shar that involve reciprocals of Fibonacci numbers, Integers 2 (202), #A6
#A61 INTEGERS 12 (2012) ON FINITE SUMS OF GOOD AND SHAR THAT INVOLVE RECIPROCALS OF FIBONACCI NUMBERS
#A6 INTEGERS 2 (202) ON INITE SUMS O GOOD AND SHAR THAT INVOLVE RECIPROCALS O IBONACCI NUMBERS R. S. Melham School of Mathematical Sciences, University of Technology, Sydney, Australia ray.melham@uts.edu.au
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 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 information1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)
CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,
More informationOn Two New Classes of Fibonacci and Lucas Reciprocal Sums with Subscripts in Arithmetic Progression
Applied Mathematical Sciences Vol. 207 no. 25 2-29 HIKARI Ltd www.m-hikari.com https://doi.org/0.2988/ams.207.7392 On Two New Classes of Fibonacci Lucas Reciprocal Sums with Subscripts in Arithmetic Progression
More informationReciprocal Sums of Elements Satisfying Second Order Linear Recurrences
Chamchuri Journal of Mathematics Volume 00 Number, 93 00 http://wwwmathscchulaacth/cjm Reciprocal Sums of Elements Satisfying Second Order Linear Recurrences Kantaphon Kuhapatanakul and Vichian Laohakosol
More informationREDUCTION FORMULAS FOR THE SUMMATION OF RECIPROCALS IN CERTAIN SECOND-ORDER RECURRING SEQUENCES
REDUCTION FORMULAS FOR THE SUMMATION OF RECIPROCALS IN CERTAIN SECOND-ORDER RECURRING SEQUENCES R. S. Melham Department of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway, NSW
More information1. INTRODUCTION. Ll-5F 2 = 4(-l)" (1.1)
Ray Melham School of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway, NSW 2007, Australia (Submitted April 1997) Long [4] considered the identity 1. INTRODUCTION Ll-5F 2 =
More information(Submitted November 1999) 1. INTRODUCTION - F. n+k 2. n=1f" n+k l. <... < k m
REDUCTION FORMULAS FOR THE SUMMATION OF RECIPROCALS IN CERTAIN SECOND-ORDER RECURRING SEQUENCES R. S. Melham Department of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway,
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 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 informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationClosed-form evaluations of Fibonacci Lucas reciprocal sums with three factors
Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank
More information-P" -p. and V n = a n + ft\ (1.2)
R. S. Melham School of Mathematical Sciences, University of Technology, Sydney, PO Box 123, Broadway, NSW 27 Australia {Submitted November 1997-Final Revision April 1998) 1. INTRODUCTION Define the sequences
More informationGENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1041 1054 http://dx.doi.org/10.4134/bkms.2014.51.4.1041 GENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1 Ref ik Kesk in Abstract. Let P
More informationClass 8: Numbers Exercise 3B
Class : Numbers Exercise B 1. Compare the following pairs of rational numbers: 1 1 i First take the LCM of. LCM = 96 Therefore: 1 = 96 Hence we see that < 6 96 96 1 1 1 1 = 6 96 1 or we can say that
More informationL U C A S SEQUENCES AND FUNCTIONS O F A 3-BY-3 M A T R I X
L U C A S SEQUENCES AND FUNCTIONS O F A 3-BY-3 M A T R I X R. S. Melham School of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway, NSW 2007 Australia {SubmittedMay 1997-Final
More informationarxiv: v1 [math.ra] 30 Nov 2016
arxiv:1611.10143v1 [math.ra] 30 Nov 2016 HORADAM OCTONIONS Adnan KARATAŞ and Serpil HALICI Abstract. In this paper, first we define Horadam octonions by Horadam sequence which is a generalization of second
More informationSteve Fairgrieve Department of Mathematics, West Virginia University, PO Box 6310, Morgantown, WV
PRODUCT DIFFERENCE FIBONACCI IDENTITIES OF SIMSON, GELIN-CESARO, TAGIURI AND GENERALIZATIONS Steve Fairgrieve Department of Mathematics, West Virginia University, PO Box 6310, Morgantown, WV 26506-6310
More informationGENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2
Bull. Korean Math. Soc. 52 (2015), No. 5, pp. 1467 1480 http://dx.doi.org/10.4134/bkms.2015.52.5.1467 GENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2 Olcay Karaatlı and Ref ik Kesk in Abstract. Generalized
More informationA number that can be written as, where p and q are integers and q Number.
RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.
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 informationF A M I L I E S OF IDENTITIES INVOLVING SUMS OF POWERS OF THE FIBONACCI AND LUCAS NUMBERS
F A M I L I E S OF IDENTITIES INVOLVING SUMS OF POWERS OF THE FIBONACCI AND LUCAS NUMBERS R. S. Melham School of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway, NSW 2007 Australia
More informationSums 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 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 informationUNIT 4 NOTES: PROPERTIES & EXPRESSIONS
UNIT 4 NOTES: PROPERTIES & EXPRESSIONS Vocabulary Mathematics: (from Greek mathema, knowledge, study, learning ) Is the study of quantity, structure, space, and change. Algebra: Is the branch of mathematics
More informationOn the Shifted Product of Binary Recurrences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), rticle 10.6.1 On the Shifted Product of Binary Recurrences Omar Khadir epartment of Mathematics University of Hassan II Mohammedia, Morocco
More informationON SOME RECIPROCAL SUMS OF BROUSSEAU: AN ALTERNATIVE APPROACH TO THAT OF CARLITZ
ON SOME RECIPROCAL SUMS OF BROUSSEAU: AN ALTERNATIVE APPROACH TO THAT OF CARLITZ In [2], it was shown that R. S. Melham Department of Math. Sciences, University oftechnology, Sydney PO Box 123, Broadway,
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 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 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 informationOn The Discriminator of Lucas Sequences
On The Discriminator of Lucas Sequences Bernadette Faye Ph.D Student FraZA, Bordeaux November 8, 2017 The Discriminator Let a = {a n } n 1 be a sequence of distinct integers. The Discriminator is defined
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
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 informationSect Addition, Subtraction, Multiplication, and Division Properties of Equality
Sect.1 - Addition, Subtraction, Multiplication, and Division Properties of Equality Concept #1 Definition of a Linear Equation in One Variable An equation is a statement that two quantities are equal.
More informationBalancing And Lucas-balancing Numbers With Real Indices
Balancing And Lucas-balancing Numbers With Real Indices A thesis submitted by SEPHALI TANTY Roll No. 413MA2076 for the partial fulfilment for the award of the degree Master Of Science Under the supervision
More informationSection 4.1: Sequences and Series
Section 4.1: Sequences and Series In this section, we shall introduce the idea of sequences and series as a necessary tool to develop the proof technique called mathematical induction. Most of the material
More informationON SUMS AND RECIPROCAL SUM OF GENERALIZED FIBONACCI NUMBERS BISHNU PADA MANDAL. Master of Science in Mathematics
ON SUMS AND RECIPROCAL SUM OF GENERALIZED FIBONACCI NUMBERS A report submitted by BISHNU PADA MANDAL Roll No: 42MA2069 for the partial fulfilment for the award of the degree of Master of Science in Mathematics
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 informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationSums of fourth powers of Fibonacci and Lucas numbers
Sums of fourth powers of Fibonacci Lucas numbers arxiv:1706.00407v1 [math.nt] 28 May 2017 Kunle Adegoke Department of Physics Engineering Physics, Obafemi Awolowo University, Ile-Ife, Nigeria Abstract
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More information1. Revision Description Reflect and Review Teasers Answers Recall of Rational Numbers:
1. Revision Description Reflect Review Teasers Answers Recall of Rational Numbers: A rational number is of the form, where p q are integers q 0. Addition or subtraction of rational numbers is possible
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More informationIntroduction to Lucas Sequences
A talk given at Liaoning Normal Univ. (Dec. 14, 017) Introduction to Lucas Sequences Zhi-Wei Sun Nanjing University Nanjing 10093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun Dec. 14, 017
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 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 informationarxiv: v4 [math.nt] 3 Jul 2017
PRIME POWERS IN SUMS OF TERMS OF BINARY RECURRENCE SEQUENCES arxiv:161002774v4 [mathnt] 3 Jul 2017 ESHITA MAZUMDAR AND S S ROUT Abstract Let {u n } n 0 be a non-degeneratebinaryrecurrencesequence with
More informationPrecalculus Prerequisite Skills Review
Precalculus Prerequisite Skills Review The following exercises will give you an opportunity to refresh your prior knowledge and skills from Algebra and Geometry and Algebra II, in preparation for Pre-calculus.
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 informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More information(i) 2-5 (ii) (3 + 23) - 23 (v) 2π
Number System - Worksheet Question 1: Express the following in the form p/q, where p and q are integers and q 0. Question 2: Express 0.99999... in the form p/q. Are you surprised by your answer? With your
More informationSOME SUMMATION IDENTITIES USING GENERALIZED g-matrices
SOME SUMMATION IDENTITIES USING GENERALIZED g-matrices R. S. Melham and A. G. Shannon University of Technology, Sydney, 2007, Australia {Submitted June 1993) 1. INTRODUCTION In a belated acknowledgment,
More informationOn the possible quantities of Fibonacci numbers that occur in some type of intervals
On the possible quantities of Fibonacci numbers that occur in some type of intervals arxiv:1508.02625v1 [math.nt] 11 Aug 2015 Bakir FARHI Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes
More informationMini Lecture 1.1 Introduction to Algebra: Variables and Mathematical Models
Mini Lecture. Introduction to Algebra: Variables and Mathematical Models. Evaluate algebraic expressions.. Translate English phrases into algebraic expressions.. Determine whether a number is a solution
More informationMathematics 228(Q1), Assignment 2 Solutions
Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k
More informationFibonacci numbers with prime subscripts: Digital sums for primes versus composites
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol. 20, 2014, No. 3, 45 49 Fibonacci numbers with prime subscripts: Digital sums for primes versus composites J. V. Leyendekkers 1 and A.
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 informationClass VIII Chapter 1 Rational Numbers Maths. Exercise 1.1
Question 1: Using appropriate properties find: Exercise 1.1 (By commutativity) Page 1 of 11 Question 2: Write the additive inverse of each of the following: (iii) (iv) (v) Additive inverse = Additive inverse
More informationk-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities and Norms of Hankel Matrices
International Journal of Mathematical Analysis Vol. 9, 05, no., 3-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.4370 k-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities
More information1. INTRODUCTION. n=. A few applications are also presented at the end of the Note. The following Theorem is established in the present Note:
CONVOLVING THE m-th POWERS OF THE CONSECUTIVE INTEGERS WITH THE GENERAL FIBONACCI SEQUENCE USING CARLITZ S WEIGHTED STIRLING POLYNOMIALS OF THE SECOND KIND N. Gauthier Department of Physics, The Royal
More informationQuantitative Aptitude
WWW.UPSCMANTRA.COM Quantitative Aptitude Concept 1 1. Number System 2. HCF and LCM 2011 Prelims Paper II NUMBER SYSTEM 2 NUMBER SYSTEM In Hindu Arabic System, we use ten symbols 0, 1, 2, 3, 4, 5, 6, 7,
More informationWorksheet 1. Difference
Worksheet Differences Remember: The difference of a sequence u n is: u n u n+ u n The falling factorial (power), n to the k falling, when k > 0, is: n k n(n )... (n k + ), Please complete the following
More informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More information8. Sequences, Series, and Probability 8.1. SEQUENCES AND SERIES
8. Sequences, Series, and Probability 8.1. SEQUENCES AND SERIES What You Should Learn Use sequence notation to write the terms of sequences. Use factorial notation. Use summation notation to write sums.
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
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 informationZ J7 TT I?2 17 n r n+l''' r n+4m+l (1 A \
SUMS O F CERTAIN PRODUCTS O F F I B O N A C C I AND LUCAS N U M B E R S - P A R T II R. S* Melham School of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway, NSW 2007 Australia
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 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 informationPELL IDENTITIES A. F. HORADAIVI University of New England, Armidale, Australia
PELL IDENTITIES A. F. HORADAIVI University of New England, Armidale, Australia 1. INTRODUCTION Recent issues of this Journal have contained several interesting special results involving Pell numbers* Allowing
More informationDISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k
DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F
More informationEFFICIENT COMPUTATION OF TERMS OF LINEAR RECURRENCE SEQUENCES OF ANY ORDER
#A39 INTEGERS 8 (28) EFFIIENT OMPUTATION OF TERMS OF LINEAR REURRENE SEQUENES OF ANY ORDER Dmitry I. Khomovsky Lomonosov Moscow State University, Moscow, Russia khomovskij@physics.msu.ru Received: /2/6,
More informationSequences and Series. College Algebra
Sequences and Series College Algebra Sequences A sequence is a function whose domain is the set of positive integers. A finite sequence is a sequence whose domain consists of only the first n positive
More informationEXTENDING THE DOMAINS OF DEFINITION OF SOME FIBONACCI IDENTITIES
EXTENDING THE DOMAINS OF DEFINITION OF SOME FIBONACCI IDENTITIES MARTIN GRIFFITHS Abstract. In this paper we consider the possibility for extending the domains of definition of particular Fibonacci identities
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 informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationENHANCING THE CONCEPTUAL UNDERSTANDING OF SEQUENCES AND SERIES WITH TECHNOLOGY. Jay L. Schiffman. Rowan University. 201 Mullica Hill Road
ENHANCING THE CONCEPTUAL UNDERSTANDING OF SEQUENCES AND SERIES WITH TECHNOLOGY Jay L. Schiffman Rowan University 20 Mullica Hill Road Glassboro, NJ 08028-70 schiffman@rowan.edu Abstract: The TI-89 and
More informationarxiv: v1 [math.nt] 29 Jul 2017
A VARIATION ON THE THEME OF NICOMACHUS arxiv:707.09477v [math.nt] 29 Jul 207 FLORIAN LUCA, GEREMÍAS POLANCO, AND WADIM ZUDILIN Abstract. In this paper, we prove some conjectures of K. Stolarsky concerning
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 information2. Which of the following expressions represents the product of four less than three times x and two more than x?
Algebra Topics COMPASS Review You will be allowed to use a calculator on the COMPASS test. Acceptable calculators are: basic calculators, scientific calculators, and graphing calculators up through the
More informationOn Generalized k-fibonacci Sequence by Two-Cross-Two Matrix
Global Journal of Mathematical Analysis, 5 () (07) -5 Global Journal of Mathematical Analysis Website: www.sciencepubco.com/index.php/gjma doi: 0.449/gjma.v5i.6949 Research paper On Generalized k-fibonacci
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 informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
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 informationSequences of Real Numbers
Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next
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 informationADVANCED PROBLEMS AND SOLUTIONS
Edited by RAYMOND E. WHITNEY Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA PA 17745, This department
More informationIn memoriam Péter Kiss
Kálmán Liptai Eszterházy Károly Collage, Leányka út 4, 3300 Eger, Hungary e-mail: liptaik@gemini.ektf.hu (Submitted March 2002-Final Revision October 2003) In memoriam Péter Kiss ABSTRACT A positive integer
More informationMATCHING. Match the correct vocabulary word with its definition
Name Algebra I Block UNIT 2 STUDY GUIDE Ms. Metzger MATCHING. Match the correct vocabulary word with its definition 1. Whole Numbers 2. Integers A. A value for a variable that makes an equation true B.
More informationQuestion 1: Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0?
Class IX - NCERT Maths Exercise (.) Question : Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0? q Solution : Consider the definition of a rational number.
More informationProblem One: Order Relations i. What three properties does a binary relation have to have to be a partial order?
CS103 Handout 16 Fall 2011 November 4, 2011 Extra Practice Problems Many of you have expressed interest in additional practice problems to review the material from the first four weeks of CS103. This handout
More informationGrade 7/8 Math Circles. Continued Fractions
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing A Fraction of our History Grade 7/8 Math Circles October th /2 th Continued Fractions Love it or hate it,
More information6.1. Rational Expressions and Functions; Multiplying and Dividing. Copyright 2016, 2012, 2008 Pearson Education, Inc. 1
6.1 Rational Expressions and Functions; Multiplying and Dividing 1. Define rational expressions.. Define rational functions and give their domains. 3. Write rational expressions in lowest terms. 4. Multiply
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationarxiv: v2 [math.nt] 29 Jul 2017
Fibonacci and Lucas Numbers Associated with Brocard-Ramanujan Equation arxiv:1509.07898v2 [math.nt] 29 Jul 2017 Prapanpong Pongsriiam Department of Mathematics, Faculty of Science Silpakorn University
More informationOctober 28, S4.4 Theorems about Zeros of Polynomial Functions
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More informationCLASS-IX MATHEMATICS. For. Pre-Foundation Course CAREER POINT
CLASS-IX MATHEMATICS For Pre-Foundation Course CAREER POINT CONTENTS S. No. CHAPTERS PAGE NO. 0. Number System... 0 3 0. Polynomials... 39 53 03. Co-ordinate Geometry... 54 04. Introduction to Euclid's
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 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 information