THE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS
|
|
- Godfrey Stanley
- 5 years ago
- Views:
Transcription
1 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 natural number k such that n divides F k. For instance, z(f n) = n, for all n 3. In this paper, among other things, we prove that z(f nf n+1f n+) = n(n+1)(n+), for all even positive integers n. 1. Introduction Let (F n ) n 0 be the Fibonacci sequence given by F n+ = F n+1 +F n, for n 0, where F 0 = 0 and F 1 = 1. These numbers are well-known for possessing amazing properties (consult [4] together with its very extensive annotated bibliography for additional references and history). In 193, the Fibonacci Association was created to provide enthusiasts an opportunity to share ideas about these intriguing numbers and their applications. We cannot go very far in the lore of Fibonacci numbers without encountering its companion Lucas sequence (L n ) n 0 which follows the same recursive pattern as the Fibonacci numbers, but with initial values L 0 = and L 1 = 1. The study of the divisibility properties of Fibonacci numbers has always been a popular area of research. Let n be a positive integer number, the order (or rank) of appearance of n in the Fibonacci sequence, denoted by z(n), is defined as the smallest positive integer k, such that n F k (some authors also call it order of apparition, or Fibonacci entry point). There are several results about z(n) in the literature. For instance, z(n) < for all n 1. The proof of this fact is an immediate consequence of the Théorème Fondamental of Section XXVI in [10, p. 300]. Indeed, z(m) < m 1, for all m > (see [15, Theorem, p. 5]) and in the case of a prime number p, one has the better upper bound z(p) p+1, which is a consequence of the known congruence F p ( p 5 ) 0 (mod p), for p,5, where ( a q ) denotes the Legendre symbol of a with respect to a prime q >. In recent papers, the author [, 7, 8] found explicit formulas for the order of appearance of integers related to Fibonacci numbers, such as F m ±1,F mk /F k and Fn. k In particular, it was proved that z(f 4m ±1) = 8m, if m > 1, and z(fn k+1 ) = nfn, k for all non-negative integers k and n > 3 with n 3 (mod ). In this paper, we continue this program and study the order of appearance of product of consecutive Fibonacci numbers. Our main results are the following. Theorem 1.1. We have (i) For n 3, z(f n F n+1 ) = n(n+1). Research supported in part by FAP-DF, FEMAT-Brazil and CNPq-Brazil. 13 VOLUME 50, NUMBER
2 (ii) For n, (iii) For n 1, ORDER OF APPEARANCE OF PRODUCTS OF FIBONACCI NUMBERS { n(n+1)(n+), if n 1 (mod ), z(f n F n+1 F n+ ) = n(n+1)(n+), if n 0 (mod ). z(f n F n+1 F n+ F n+3 ) = n(n+1)(n+)(n+3), if n 0 (mod 3), n(n+1)(n+)(n+3) 3, if n 0,9 (mod 1), n(n+1)(n+)(n+3), if n 3, (mod 1). We recall that thefibonacci factorial ofn(also called Fibonorial), denoted byn F!, is defined as the product of the first n nonzero Fibonacci numbers (sequence A003 in OEIS [13]). In the search for z(n F!), we found that n F! F n! (and thus z(n F!) n!) for n = 1,...,10 (see Table 1). It is therefore reasonable to conjecture that z(n F!) n! and so F 1 F n F n!, for all positive integers n. However, this is not true, because z(110 F!) 110! In fact, ν 11 (F 1 F 110 ) = 1 > 11 = ν 11 (F 110! ). Hence, motivated by this fact, we prove that n ! 4! 5!! 7! 8! 9! z(n F!) 1! 1! ! 88 Table 1. The order of appearance of n F!, for 1 n 10. Theorem 1.. For all p {,3,5,7} and n 1, we have ν p (F 1 F n ) ν p (F n! ). Here ν p (n) denotes the p-adic order of n which, as usual, is the exponent of the highest power of p dividing n. We organize the paper as follows. In Section, we will recall some useful properties of Fibonacci numbers such as d Ocagne s identity and a result concerning the p-adic order of F n. The last two sections will be devoted to the proof of theorems.. Auxiliary Results Before proceeding further, we recall some facts on Fibonacci numbers for the convenience of the reader. Lemma.1. We have (a) F n F m if and only if n m. (b) gcd(f n,f m ) = F gcd(n,m). (c) F n F n, for all n 0 (mod 3). (d) (d Ocagne s identity) ( 1) n F m n = F m F n+1 F n F m+1. (e) F p ( p 5 ) 0 (mod p), for all primes p. Most of the previous items can be proved by using induction together with the well-known Binet s formula: F n = αn β n, for n 0, α β where α = (1+ 5)/ and β = (1 5)/. We refer the reader to [1, 3, 4, 11] for more details and additional bibliography. MAY
3 THE FIBONACCI QUARTERLY The second lemma is a consequence of the previous one. Lemma.. We have (a) If F n m, then n z(m). (b) If n F m, then z(n) m. Proof. For (a), since F n m F z(m), by Lemma.1 (a), we get n z(m). In order to prove (b), we write m = z(n)q +r, where q and r are integers, with 0 r < z(n). So, by Lemma.1 (d), we obtain ( 1) z(n)q F r = F m F z(n)q+1 F z(n)q F m+1. Since n divides both F m and F z(n)q, then it also divides F r implying r = 0 (keep in mind the range of r). Thus, z(n) m. The p-adic order of Fibonacci and Lucas numbers was completely characterized, see [, 9, 1, 14]. For instance, from the main results of Lengyel [9], we extract the following result. Lemma.3. For n 1, we have 0, if n 1, (mod 3); 1, if n 3 (mod ); ν (F n ) = 3, if n (mod 1); ν (n)+, if n 0 (mod 1), ν 5 (F n ) = ν 5 (n), and if p is prime or 5, then { νp (n)+ν ν p (F n ) = p (F z(p) ), if n 0 (mod z(p)); 0, if n 0 (mod z(p)). A proof of this result can be found in [9]. Lemma.4. For any integer k 1 and p prime, we have k logk p 1 1 ν p (k!) k 1 logp p 1, (.1) where, as usual, x denotes the largest integer less than or equal to x. Proof. Recall the well-known Legendre s formula [5]: ν p (k!) = k s p(k), (.) p 1 where s p (k) is the sum of digits of k in base p. Since k has logk/logp +1 digits in base p, and each digit is at most p 1, we get ( ) logk 1 s p (k) (p 1) +1. (.3) logp Therefore, the inequality in (.1) follows from (.) and (.3). Now, we are ready to deal with the proof of theorems. 134 VOLUME 50, NUMBER
4 ORDER OF APPEARANCE OF PRODUCTS OF FIBONACCI NUMBERS 3. The Proof of Theorem Proof of (i). For ɛ {0,1}, one has that F n+ɛ F n F n+1 and so Lemma. (a) yields n + ɛ z(f n F n+1 ). But, gcd(n,n + 1) = 1 and therefore n(n + 1) z(f n F n+1 ). On the other hand, F n+ɛ F n(n+1) (Lemma.1 (a)) and hence, F n F n+1 F n(n+1), since gcd(f n,f n+1 ) = 1. Now, by using Lemma. (b), we conclude that z(f n F n+1 ) n(n+1). In conclusion, we have z(f n F n+1 ) = n(n+1). We remark that the same idea can be used to prove that if m 1,...,m k are positive integers, such that gcd(m i,m j ) = 1 or, for all i j, then z(f m1 F mk ) m 1 m k. If m 1,...,m k are pairwise relatively prime, then z(f m1 F mk ) = m 1 m k. 3.. Proof of (ii). For ɛ {0,1,}, we have F n+ɛ F n(n+1)(n+). By Lemma.1 (b), the numbers F n,f n+1,f n+ are pairwise coprime. In fact, if ɛ 1,ɛ {0,1,} are distinct, then gcd(n+ɛ 1,n+ɛ ) = 1 or. In any case, we get Thus, F n F n+1 F n+ F n(n+1)(n+) and so gcd(f n+ɛ1,f n+ɛ ) = F gcd(n+ɛ1,n+ɛ ) = 1. z(f n F n+1 F n+ ) n(n+1)(n+). (3.1) Now, we use F n+ɛ F n F n+1 F n+, to conclude that n+ɛ divides z(f n F n+1 F n+ ). So, the proof splits in two cases: Case 1: If n is odd, then n,n + 1,n + are pairwise coprime. Therefore, n(n + 1)(n + ) z(f n F n+1 F n+ ). This fact, together with (3.1), yields the result in this case. Case : For n even, we have that F n Fn(n+1)(n+) and so z(f n F n+1 F n+ ) divides n(n + 1)(n + )/. We already know that n + ɛ z(f n F n+1 F n+ ) and gcd(n,n + ) =. If n 0 (mod 4), then n,n + 1,(n + )/ are pairwise coprime. In the case of n (mod 4), the numbers n/,n + 1,n + are pairwise coprime. Thus, in any case, we have n(n + 1)(n + )/ z(f n F n+1 F n+ ) and the desired result is proved Proof of (iii). By the same arguments as before, we conclude that n+ɛ z(f n F n+1 F n+ F n+3 ), for ɛ {0,1,,3}. (3.) Assume first that n 0 (mod 3). Then there exists only one pair among (n,n + ) and (n+1,n+3) whose greatest common divisor is. Without loss of generality, we suppose that gcd(n,n+) =. Again, as in the previous item, we can see that n/ a,n+1,(n+)/ b,n+3 are pairwise coprime, for distinct a,b {0,1} suitably chosen depending on the class of n modulo 4. Thus, n(n+1)(n+)(n+3) = n(n+1)(n+)(n+3) a+b z(f n F n+1 F n+ F n+3 ). Sincetherearetwoevennumbersamongn,n+1,n+,n+3,wehavethatF n+ɛ Fn(n+1)(n+)(n+3). However, gcd(f n,f n+3 ) = F gcd(n,n+3) = 1, because 3 n. Thus, F n,f n+1,f n+,f n+3 are pairwise coprime yielding that F n F n+1 F n+ F n+3 Fn(n+1)(n+)(n+3). We apply Lemma. to get z(f n F n+1 F n+ F n+3 ) n(n+1)(n+)(n+3). MAY
5 THE FIBONACCI QUARTERLY This finishes the proof in this case. Now suppose that n 0 (mod 3). If 9 n, then gcd(n,(n+ 3)/3) = 1, while gcd(n/3, n + 3) = 1 when 9 n. In any case, for a suitable choice of a,b,c,d,e,f {0,1}, where a b and only one among c,d,e,f is 1, we obtain that n n+1 c 3a, d, n+ e, n+3 f 3 b are pairwise coprime. Here the sets {a,b} and {c,d,e,f} depend on the class of n modulo 4 and 9, respectively. Hence, by (3.), we get n(n+1)(n+)(n+3) = n(n+1)(n+)(n+3) c+d+e+f 3 a+b z(f n F n+1 F n+ F n+3 ), (3.3) since a+b = c+d+e+f = 1. Note that there are even numbers among n,n + 1,n +,n + 3 and also 3 divides both n and n + 3. Thus F n+ɛ Fn(n+1)(n+)(n+3), for ɛ {0,1,,3}. Since gcd(f n,f n+3 ) = and gcd(f n+3,f n+1 F n+ ) = 1, then gcd(f n F n+1 F n+,f n+3 ) =. Now, we use that F n,f n+1,f n+ are pairwise coprime to ensure that F n F n+1 F n+ Fn(n+1)(n+)(n+3). Since F n+3 also divides Fn(n+1)(n+)(n+3), we get F n F n+1 F n+ F n+3 Fn(n+1)(n+)(n+3) where we used Lemma.1 (c). Thus, Lemma. (b) yields F n(n+1)(n+)(n+3), 3 z(f n F n+1 F n+ F n+3 ) n(n+1)(n+)(n+3). (3.4) 3 Combining (3.3) and (3.4), we get { n(n+1)(n+)(n+3) z(f n F n+1 F n+ F n+3 ), n(n+1)(n+)(n+3) } (3.5) 3 holds for all positive integers n 0 (mod 3). In order to complete the proof, it suffices to prove that F n F n+1 F n+ F n+3 Fn(n+1)(n+)(n+3), for all n 0,9 (mod 1) (3.) and F n F n+1 F n+ F n+3 Fn(n+1)(n+)(n+3), for all n 3, (mod 1). (3.7) We claim that (3.) is true. In fact, if n 0 (mod 1), then n+3 3 (mod ). On the one hand, by setting n = 1l and by Lemma.3, we have ν (F n F n+1 F n+ F n+3 ) = ν (F n )+ν (F n+3 ) = ν (n)+3 = ν (l)+5. On the other, n(n+1)(n+)(n+3) = 1l(1l+1)(l+1)(4l+1) and so ν (Fn(n+1)(n+)(n+3)) = ν (1l(1l +1)(l+1)(4l+1))+ = ν (l)+4. This means that ν (F n F n+1 F n+ F n+3 ) > ν (Fn(n+1)(n+)(n+3)) which is enough to prove (3.). A similar argument holds for the case n 9 (mod 1). Now to prove (3.7), we shall show that ν p (F n F n+1 F n+ F n+3 ) ν p (Fn(n+1)(n+)(n+3)), for all primes p. In fact, 13 VOLUME 50, NUMBER
6 Case 1: If p = 5, then ORDER OF APPEARANCE OF PRODUCTS OF FIBONACCI NUMBERS ν 5 (F n F n+1 F n+ F n+3 ) = ν 5 (F n+j ) = ν 5 (n+j) = ν 5 (Fn(n+1)(n+)(n+3)). Case : If p or 5, then p divides at most one among F n,f n+1,f n+,f n+3. Suppose that this is the case (otherwise ν p (F n F n+1 F n+ F n+3 ) = 0 and we are done). Then, let j be the integer belonging to {0,1,,3} such that p F n+j. Thus, On the other hand, ν p (F n F n+1 F n+ F n+3 ) = ν p (F n+j ) = ν p (n+j)+ν p (F z(p) ). ν p (Fn(n+1)(n+)(n+3)) = ν p (n(n+1)(n+)(n+3)) ν p ()+ν p (F z(p) ). If p > 3, ν p () = 0 and the desired inequality follows. In the case of p = 3, we have ν 3 (Fn(n+1)(n+)(n+3)) = ν 3 (n)+ν 3 (n+3) 1+ν p (F z(p) ) v 3 (n+j)+ν 3 (F z(p) ) = ν 3 (F n F n+1 F n+ F n+3 ). Case 3: When p =, we use that n 3, (mod 1). Let us suppose that n 3 (mod 1) (the other case can be handled in the same way). Then n+3 (mod 1) and by Lemma.3, we obtain ν (F n F n+1 F n+ F n+3 ) = ν (F n )+ν (F n+3 ) = 4. However, if n = 1l+3, then ν (Fn(n+1)(n+)(n+3)) = ν (F 1(4l+1)(3l+1)(1l+5)(l+1) ) = ν (1(4l+1)(3l+1)(1l+5)(l+1))+ = 4. The proof is then complete. For p = 5, we have ν 5 (F 1 F n ) = 4. The Proof of Theorem 1. n ν 5 (F j ) = j=1 n ν 5 (j) = ν 5 (n!) = ν 5 (F n! ). In the case of p =, we first use Mathematica to see that the result holds for all 1 n 48. So, we shall assume n 49. Now, we note that ν (F n ) 0 if and only if 3 n. Thus, the only terms with non-zero -adic order among F 1,...,F n are F 3,...,F 3 n/3 and so j=1 ν (F 1 F n ) = [ν (F 3 )+ν (F )+ν (F 9 )]+ν (F 1 ) +[ν (F 15 )+ν (F 18 )+ν (F 1 )]+ν (F 4 ) + +ν (F 1 n/1 )+l, where l {0,1,4,5} and depends on the residue class of n modulo 1. By Lemma.3, each bracketed term in the above sum is 5 and thus, n/1 n n n ν (F 1 F n ) = 5 + ν (F 1j )+l = 9 +ν (!)+l j=1 We now apply Lemma.4 (with p = ) together with the fact that l 5, to get the bound ν (F 1 F n ) 5n +4. (4.1) MAY
7 THE FIBONACCI QUARTERLY On other other hand, since 1 n! (because n > 3), Lemma.3 yields Again, we use Lemma.4 to obtain ν (F n! ) = ν (n!)+. ν (F n! ) n logn +1. (4.) log The proof of this case finishes by noting that the right-hand side of (4.) is greater than 5n/+4, for n 49. When p = 3 or 7, we again use Lemma.3 to get ν p (F 1 F n ) = = n/z(p) j=1 (ν p (z(p)j)+ν p (F z(p) )) ( ) n n ν p (F z(p) z(p) )+ν p!, z(p) where we used that ν p (z(p)) = 0, since by Lemma.1 (e), p F p±1 and so by Lemma. (b), one has that z(p) (p±1). Now, we apply Lemma.4 to obtain n n z(p) 1 ν p (F 1 F n ) ν p (F z(p) z(p) )+. (4.3) p 1 On the other hand, ν p (F n! ) = ν p (n!)+ν p (F z(p) ) and hence, again by Lemma.4, we have ν p (F n! ) n logn p 1 1+ν p (F logp z(p) ). (4.4) By combining (4.3) and (4.4), it suffices to prove for p = 3 that n logn n log3 and for p = 7 that n logn n log7 However, both these inequalities hold for all n 13. For the remaining cases, we use a simple Mathematica routine to check that ν p (F 1 F n ) ν p (F n! ) is also valid for n = 1,...,1. This completes the proof. 5. Acknowledgement The author is grateful to Pavel Trojovský for nice discussions on the subject. References [1] A. Benjamin and J. Quinn, The Fibonacci numbers exposed more discretely, Math. Mag., 7.3 (003), [] J. H. Halton, On the divisibility properties of Fibonacci numbers, The Fibonacci Quarterly, 4.3 (19), [3] D. Kalman and R. Mena, The Fibonacci numbers exposed, Math. Mag., 7.3 (003), [4] T. Koshy, Fibonacci and Lucas Numbers with Applications, Wiley, New York, 001. [5] A. M. Legendre, Theorie des Nombres, Firmin Didot Freres, Paris, [] D. Marques, On integer numbers with locally smallest order of appearance in the Fibonacci sequence, Internat. J. Math. Math. Sci., Article ID (011), 4 pages. 138 VOLUME 50, NUMBER
8 ORDER OF APPEARANCE OF PRODUCTS OF FIBONACCI NUMBERS [7] D. Marques, On the order of appearance of integers at most one away from Fibonacci numbers, (to appear in The Fibonacci Quarterly). [8] D. Marques, On the order of appearance of powers of Fibonacci and Lucas numbers, Preprint. [9] T. Lengyel, The order of the Fibonacci and Lucas numbers, The Fibonacci Quarterly, 33.3 (1995), [10] E. Lucas, Théorie des fonctions numériques simplement périodiques, Amer. J. Math., 1 (1878), , [11] P. Ribenboim, My Numbers, My Friends: Popular Lectures on Number Theory, Springer-Verlag, New York, 000. [1] D. W. Robinson, The Fibonacci matrix modulo m, The Fibonacci Quarterly, 1. (193), 9 3. [13] N. J. A. Sloane (Ed.), The On-Line Encyclopedia of Integer Sequences, njas/sequences/. [14] J. Vinson, The relation of the period modulo m to the rank of apparition of m in the Fibonacci sequence, The Fibonacci Quarterly, 1. (193), [15] N. N. Vorobiev, Fibonacci Numbers, Birkhäuser, Basel, 003. MSC010: 11B39 Departamento de Matemática, Universidade de Brasília, Brasília, DF, , Brazil address: diego@mat.unb.br MAY
PAijpam.eu THE PERIOD MODULO PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS
International Journal of Pure and Applied Mathematics Volume 90 No. 014, 5-44 ISSN: 111-8080 (printed version); ISSN: 114-95 (on-line version) url: http://www.ipam.eu doi: http://dx.doi.org/10.17/ipam.v90i.7
More informationEven perfect numbers among generalized Fibonacci sequences
Even perfect numbers among generalized Fibonacci sequences Diego Marques 1, Vinicius Vieira 2 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract A positive integer
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 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 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 informationGeneralized Fibonacci numbers of the form 2 a + 3 b + 5 c
Generalized Fibonacci numbers of the form 2 a + 3 b + 5 c Diego Marques 1 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract For k 2, the k-generalized Fibonacci
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 informationOn the Diophantine equation k
On the Diophantine equation k j=1 jfp j = Fq n arxiv:1705.06066v1 [math.nt] 17 May 017 Gökhan Soydan 1, László Németh, László Szalay 3 Abstract Let F n denote the n th term of the Fibonacci sequence. Inthis
More informationTewodros Amdeberhan, Dante Manna and Victor H. Moll Department of Mathematics, Tulane University New Orleans, LA 70118
The -adic valuation of Stirling numbers Tewodros Amdeberhan, Dante Manna and Victor H. Moll Department of Mathematics, Tulane University New Orleans, LA 7011 Abstract We analyze properties of the -adic
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 informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
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 informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More 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 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 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 informationPELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série tome 05 207 23 245 https://doiorg/02298/pim7523f PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER Bernadette Faye and Florian Luca Abstract We show
More informationk 2r n k n n k) k 2r+1 k 2r (1.1)
J. Number Theory 130(010, no. 1, 701 706. ON -ADIC ORDERS OF SOME BINOMIAL SUMS Hao Pan and Zhi-Wei Sun Abstract. We prove that for any nonnegative integers n and r the binomial sum ( n k r is divisible
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More information#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:
More informationChris Smyth School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3JZ, UK.
THE DIVISIBILITY OF a n b n BY POWERS OF n Kálmán Győry Institute of Mathematics, University of Debrecen, Debrecen H-4010, Hungary. gyory@math.klte.hu Chris Smyth School of Mathematics and Maxwell Institute
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationQUOTIENTS OF FIBONACCI NUMBERS
QUOTIENTS OF FIBONACCI NUMBERS STEPHAN RAMON GARCIA AND FLORIAN LUCA Abstract. There have been many articles in the Monthly on quotient sets over the years. We take a first step here into the p-adic setting,
More informationJournal of Number Theory
Journal of Number Theory 130 (2010) 1737 1749 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt A binary linear recurrence sequence of composite numbers Artūras
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationEquivalence of Pepin s and the Lucas-Lehmer Tests
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol., No. 3, 009, (35-360) ISSN 1307-5543 www.ejpam.com Equivalence of Pepin s and the Lucas-Lehmer Tests John H. Jaroma Department of Mathematics & Physics,
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
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 information*!5(/i,*)=t(-i)*-, fty.
ON THE DIVISIBILITY BY 2 OF THE STIRLING NUMBERS OF THE SECOND KIND T* Lengyel Occidental College, 1600 Campus Road., Los Angeles, CA 90041 {Submitted August 1992) 1. INTRODUCTION In this paper we characterize
More informationDivisibility. Chapter Divisors and Residues
Chapter 1 Divisibility Number theory is concerned with the properties of the integers. By the word integers we mean the counting numbers 1, 2, 3,..., together with their negatives and zero. Accordingly
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More 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 informationCovering Subsets of the Integers and a Result on Digits of Fibonacci Numbers
University of South Carolina Scholar Commons Theses and Dissertations 2017 Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers Wilson Andrew Harvey University of South Carolina
More informationA CLOSED-FORM SOLUTION MIGHT BE GIVEN BY A TREE. VALUATIONS OF QUADRATIC POLYNOMIALS
A CLOSED-FORM SOLUTION MIGHT BE GIVEN BY A TREE. VALUATIONS OF QUADRATIC POLYNOMIALS ALYSSA N. BYRNES, JULIE FINK, GARY LAVIGNE, ISABELLE NOGUES, SENTHIL RAJASEKARAN, AMBER YUAN, LEYDA ALMODOVAR, XIAO
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationO N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n
O N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n Florian Luca IMATE de la UNAM, Ap. Postal 61-3 (Xangari), CP 58 089, Morelia, Michoacan, Mexico e-mail: fluca@matmor.unain.inx
More informationarxiv: v1 [math.nt] 24 Aug 2015
LUCAS NUMBERS WITH THE LEHMER PROPERTY arxiv:1508.05709v1 [math.nt] 24 Aug 2015 BERNADETTE FAYE AND FLORIAN LUCA Abstract. A composite positive integer n is Lehmer if φ(n) divides n 1, where φ(n) is the
More informationTHE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS
THE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS FRANCIS N. CASTRO, OSCAR E. GONZÁLEZ, AND LUIS A. MEDINA Abstract. In this work we explore the p-adic valuation of Eulerian numbers.
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationJonathan Sondow 209 West 97th Street Apt 6F New York, NY USA
Which Partial Sums of the Taylor Series for e Are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463,...) arxiv:0709.0671v1 [math.nt] 5 Sep 2007 Jonathan Sondow 209 West 97th Street Apt 6F New
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 informationarxiv: v1 [math.co] 27 Aug 2015
P-positions in Modular Extensions to Nim arxiv:1508.07054v1 [math.co] 7 Aug 015 Tanya Khovanova August 31, 015 Abstract Karan Sarkar In this paper, we consider a modular extension to the game of Nim, which
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 informationarxiv: v1 [math.nt] 19 Dec 2018
ON SECOND ORDER LINEAR SEQUENCES OF COMPOSITE NUMBERS DAN ISMAILESCU 2, ADRIENNE KO 1, CELINE LEE 3, AND JAE YONG PARK 4 arxiv:1812.08041v1 [math.nt] 19 Dec 2018 Abstract. In this paper we present a new
More informationMULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x +1 PROBLEM. 1. Introduction The 3x +1iteration is given by the function on the integers for x even 3x+1
MULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x + PROBLEM ANA CARAIANI Abstract. Recently Lagarias introduced the Wild semigroup, which is intimately connected to the 3x + Conjecture. Applegate and Lagarias
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationA Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.6. A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve Ömer Küçüksakallı Mathematics Department Middle East
More informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
More information9 MODULARITY AND GCD PROPERTIES OF GENERALIZED FIBONACCI NUMBERS
#A55 INTEGERS 14 (2014) 9 MODULARITY AND GCD PROPERTIES OF GENERALIZED FIBONACCI NUMBERS Rigoberto Flórez 1 Department of Mathematics and Computer Science, The Citadel, Charleston, South Carolina rigo.florez@citadel.edu
More information4 Linear Recurrence Relations & the Fibonacci Sequence
4 Linear Recurrence Relations & the Fibonacci Sequence Recall the classic example of the Fibonacci sequence (F n ) n=1 the relations: F n+ = F n+1 + F n F 1 = F = 1 = (1, 1,, 3, 5, 8, 13, 1,...), defined
More informationOn arithmetic functions of balancing and Lucas-balancing numbers
MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur
More 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 informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationarxiv: v1 [math.nt] 2 Oct 2015
PELL NUMBERS WITH LEHMER PROPERTY arxiv:1510.00638v1 [math.nt] 2 Oct 2015 BERNADETTE FAYE FLORIAN LUCA Abstract. In this paper, we prove that there is no number with the Lehmer property in the sequence
More informationWeighted zero-sum problems over C r 3
Algebra and Discrete Mathematics Number?. (????). pp. 1?? c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE Weighted zero-sum problems over C r 3 Hemar Godinho, Abílio Lemos, Diego Marques Communicated
More informationOn the spacings between C-nomial coefficients
On the spacings between C-nomial coefficients lorian Luca, Diego Marques,2, Pantelimon Stănică 3 Instituto de Matemáticas, Universidad Nacional Autónoma de México C.P. 58089, Morelia, Michoacán, México,
More informationWhen do Fibonacci invertible classes modulo M form a subgroup?
Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationOpen Problems with Factorials
Mathematics Open Problems with Factorials Sílvia Casacuberta supervised by Dr. Xavier Taixés November 3, 2017 Preamble This essay contains the results of a research project on number theory focusing on
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More information#A2 INTEGERS 12A (2012): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS
#A2 INTEGERS 2A (202): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS Saúl Díaz Alvarado Facultad de Ciencias, Universidad Autónoma del Estado de México,
More informationFibonacci Diophantine Triples
Fibonacci Diophantine Triples Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de México C.P. 58180, Morelia, Michoacán, México fluca@matmor.unam.mx László Szalay Institute of Mathematics
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 informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationTHE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS
Annales Univ. Sci. Budapest., Sect. Comp. 41 (2013) 119 124 THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated
More informationTHE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS
Annales Univ. Sci. Budapest., Sect. Comp. 40 (2013) nn nnn THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated to
More informationABSTRACT. In this note, we find all the solutions of the Diophantine equation x k = y n, 1, y 1, k N, n INTRODUCTION
Florian Luca Instituto de Matemáticas UNAM, Campus Morelia Apartado Postal 27-3 (Xangari), C.P. 58089, Morelia, Michoacán, Mexico e-mail: fluca@matmor.unam.mx Alain Togbé Mathematics Department, Purdue
More informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China
J. Number Theory 16(016), 190 11. A RESULT SIMILAR TO LAGRANGE S THEOREM Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationRANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY
RANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY Christian Ballot Université de Caen, Caen 14032, France e-mail: ballot@math.unicaen.edu Michele Elia Politecnico di Torino, Torino 10129,
More informationAn Alternate Method to Compute the Decimal Expansion of Rational Numbers
8 MATHEMATICS MAGAZINE An Alternate Method to Compute the Decimal Expansion of Rational Numbers AMITABHA TRIPATHI Indian Institute of Technology Delhi Hauz Khas, New Delhi 1016, India atripath@maths.iitd.ac.in
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
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 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 information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationON THE SUM OF POWERS OF TWO. 1. Introduction
t m Mathematical Publications DOI: 0.55/tmmp-06-008 Tatra Mt. Math. Publ. 67 (06, 4 46 ON THE SUM OF POWERS OF TWO k-fibonacci NUMBERS WHICH BELONGS TO THE SEQUENCE OF k-lucas NUMBERS Pavel Trojovský ABSTRACT.
More informationAN ESTIMATE FOR THE LENGTH OF AN ARITHMETIC PROGRESSION THE PRODUCT OF WHOSE TERMS IS ALMOST SQUARE 1. INTRODUCTION
AN ESTIMATE FOR THE LENGTH OF AN ARITHMETIC PROGRESSION THE PRODUCT OF WHOSE TERMS IS ALMOST SQUARE SHANTA LAISHRAM ABSTRACT. Erdős conjectured that ( n(n + d (n + ( d = y in positive integers n,, d >,
More informationarxiv: v1 [math.gm] 1 Oct 2015
A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence
More informationProducts of Factorials Modulo p
Products of Factorials Modulo p Florian Luca and Pantelimon Stănică IMATE, UNAM, Ap. Postal 6-3 Xangari, CP. 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx Auburn University Montgomery,
More informationp-adic valuation of the Morgan Voyce sequence and p-regularity
Proc Indian Acad Sci (Math Sci Vol 127, No 2, April 2017, pp 235 249 DOI 101007/s12044-017-0333-8 p-adic valuation of the Morgan Voyce sequence and p-regularity LYES AIT-AMRANE 1,2, 1 USTHB/Faculty of
More information1. 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 informationFIBONACCI NUMBER AND ITS DISTRIBUTION MODULO 3 k
FIBONACCI NUMBER AND ITS DISTRIBUTION MODULO 3 k A Project Report submitted by Partial Fulfilment of the Requirements for the Degree of MASTER OF SCIENCE in MATHEMATICS by Rajesh Bishi (Roll Number: 411MA2071)
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationMAS114: Solutions to Exercises
MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
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 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 informationarxiv: v2 [math.nt] 1 Sep 2011
arxiv:1108.6096v2 [math.nt] 1 Sep 2011 Annales Mathematicae et Informaticae Manuscript http://www.ektf.hu/ami Algebraic and transcendental solutions of some exponential equations Jonathan Sondow a, Diego
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
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 informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationComputing Fibonacci Numbers Fast using the Chinese Remainder Theorem
Computing Fibonacci Numbers Fast using the Chinese Remainder Theorem Adam Murakami Oregon State University Advisor: Paul Cull Oregon State University August 15, 003 Abstract The purpose of this paper is
More informationMathSciNet infinitude of prime
0 π(x) x π(x) > c log log x π(x) > c log x c MathSciNet infinitude of prime 2018/11/3 2012 arxiv Romeo Meštrović, Euclid s theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.
More informationarxiv: v1 [math.nt] 8 Jan 2014
A NOTE ON p-adic VALUATIONS OF THE SCHENKER SUMS PIOTR MISKA arxiv:1401.1717v1 [math.nt] 8 Jan 2014 Abstract. A prime number p is called a Schenker prime if there exists such n N + that p nandp a n, wherea
More informationConvoluted Convolved Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004, Article 04.2.2 Convoluted Convolved Fibonacci Numbers Pieter Moree Max-Planc-Institut für Mathemati Vivatsgasse 7 D-53111 Bonn Germany moree@mpim-bonn.mpg.de
More informationinv lve a journal of mathematics 2009 Vol. 2, No. 2 Bounds for Fibonacci period growth mathematical sciences publishers Chuya Guo and Alan Koch
inv lve a journal of mathematics Bounds for Fibonacci period growth Chuya Guo and Alan Koch mathematical sciences publishers 2009 Vol. 2, No. 2 INVOLVE 2:2(2009) Bounds for Fibonacci period growth Chuya
More information