On the spacings between C-nomial coefficients
|
|
- Austen Francis
- 5 years ago
- Views:
Transcription
1 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 , Morelia, Michoacán, México, 2 Departamento de Matemática, Universidade ederal do Ceará, Ceará, Brazil 3 Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA , USA Abstract Let C n n 0 be the Lucas sequence C n+2 ac n+ +bc n for all n 0, where C 0 0 and C. or m let [ ] m C mc m C m + C C C be the corresponding C-nomial coefficient. When C n n is the ibonacci sequence the numbers [ m] are called ibonomials, or C n q n /q, where q > is an integer the numbers [ ] m are called q-binomial, or Gaussian coefficients, we q show that there are no nontrivial solutions to the Diophantine equation [ ] [ ] [ ] [ ] m n m n or l l with m, n,l other than the obvious ones n,l m,m. We also show that the difference [ ] [ ] m n l tends to infinity when m,,n,l are such that m/2, l n/2, m, n,l and max{m,n} tends to infinity in an effective way. Key words: Sequences 99 MSC: 2K N37 q q Corresponding author, tel addresses: fluca@matmor.unam.mx lorian Luca, diego@mat.ufc.br Diego Marques, pstanica@nps.edu Pantelimon Stănică. The first author was supported in part by Grants SEP-CONACyT and PAPIIT The second author is scholarship holder of CNPq. 3 The third author was partially supported by Air orce CVAQ D. Nussbaum and NPS RIP. Preprint submitted to Elsevier 26 May 2009
2 Introduction A famous unsolved problem in Diophantine equations is to find all pairs of binomial coefficients having the same value. That is, to find all solutions of m n. l Here, m and l n. To avoid the obvious symmetry of the Pascal triangle, we may assume that m/2 and l n/2. As of the time of this writing, the above problem has not yet been solved in its full generality. The only nontrivial solutions nown at this time are , , , 2 8 2i+2 2i+3 and 2i 2i , , i+2 2i+3 2i 2i , , 3 for i, 2,..., 2 where n is the nth ibonacci number defined by 0 0, and n+2 n+ + n for all n 0. See [5] for a proof of the fact that the above list contains all the nontrivial solutions of the Diophantine equation with l and, l {2, 3, 2, 4, 2, 6, 2, 8, 3, 4, 3,6, 4,6} and the recent paper [?] for the case, l 2, 5. Let us now loo at the sequence of ibonomial coefficients, which are defined by [ ] m 2 m m m m m + for m. These numbers are always integers as first proved by E. Lucas in [9]. Various parts of this sequence with fixed small values of appear in Sloane s On Line Encyclopedia of Integer Sequences [] see, for example, A00655, A056565, A00658, etc.. More generally, given any sequence C C n n 0 of nonzero real numbers, one can define the C-nomial coefficients as [ ] m C mc m C m +. C C C Bachmann [, p. 8], Carmichael [4, p. 40], and Jarden and Motzin [7], all showed that if C is a Lucas sequence; i.e., it has C 0 0, C and satisfies 2
3 the recurrence C n+2 ac n+ + bc n for all nonnegative integers n with some nonzero integers a and b such that the quadratic equation x 2 ax b 0 has two distinct roots and whose ratio is not a root of unity, then all the C-nomial coefficients are integers. The ibonomial coefficients are particular cases of this instance with a b. When a q + and b q, where q > is some fixed integer, the C-nomial coefficients become the so-called q-binomial coefficients given by [ ] m q qm q m +. q q In this paper, we study the analogous Diophantine equation when the binomial coefficients are replaced by C-nomial coefficients, and, more generally, we study the spacings between the C-nomial coefficients. While our results can be formulated for general C-nomial coefficients when C C n n 0 is a general Lucas sequence, we restrict our attention to the particular cases of the ibonomial coefficients, for which C n n 0, or to the case of the q-binomial coefficients, when C n q n /q for all n 0, where q > is a fixed integer. Our results are the following. Theorem None of the Diophantine equations [ ] m [ ] n l or [ ] m q [ ] n l q 3 has any positive integer solutions m/2, l n/2, m, n, l and q >. Next, let us put {[ ] m : m/2 } {f, f 2,...}, where f < f 2 < f 3 are all the elements of arranged increasingly. Note that {, 2, 3, 5, 6, 8, 3, 5, 2, 34, 40, 55,60, 89, 04,...}. This is sequence A4472 in []. Our next result shows that f N+ f N. Theorem 2 We have f N+ f N log f N /2, where the implied constant is effective. In particular, f N+ f N tends to infinity with N. 3
4 Our arguments for the proof of Theorem 2 are entirely explicit. In particular, if f N+ f N 00, then N The proof of Theorem Letting and be the two roots of the quadratic equation x 2 ax b 0 of the Lucas sequence u n n 0 with u 0 0, u of recurrence u n+2 au n+ +bu n for all n 0, we have u n n n for n 0,,.... We mae the convention that. We write 2 and we call it the discriminant of the sequence. In the particular case of the ibonacci sequence, we have + 5/2, 5/2, and 5, while in the particular case of the Lucas sequence involved in the q-binomial coefficient we have q,, and q 2. A Primitive Divisor p of the nth term u n of a Lucas sequence u n n 0 is a prime factor of u n which does not divide m n u m. It is nown that a primitive divisor p of u n exists whenever n 3 if and are real and 3 can be replaced by 7 if and are integers see, for example, [4]. The above statement is usually referred to as the Primitive Divisor Theorem see [3] for the most general version. It is also nown that such a primitive divisor p satisfies p ± mod n. We are now ready to deal with equation 3. We may assume that m n and that l. Since m n, we may assume that n > m. If l, then [ ] n l > n n m n l+ 2 l m + [ m ], n n + where we used the fact that n > m because n 3 which follows because n > m 2 2. Hence, assuming that n > m in equation 3 for the ibonomial coefficients, we deduce that l <. Thus, n > m 2 > 2l. A similar argument holds for the case of the q-binomial coefficients. Now if n 3, then by the Primitive Divisor Theorem there exists a primitive prime factor p for n. This prime will obviously divide [ ] n, since p does not divide ] l, but it cannot divide [ m, because p does not divide m. This shows that n 2 and a quic computation reveals that there are no equal ibonomial coefficients in the range 2 2l < 2 m < n 2. l 4
5 In the case of the q-binomial coefficients, the Primitive Divisor Theorem tells us that n 6. Since 2 2 < 2l m < n 6, the only possibilities are, l, m, n, 2, 4, 5,, 2, 4, 6,, 2, 5, 6. In the case, l, m, n, 2, 4, 5, the Diophantine equation 3 for q-binomial coefficients leads to q 4 q 3 q q 2 q5 q, which is equivalent to q 3 + q 4 q 2 + q 5, which is impossible because of the uniqueness of the base q expansion of a positive integer. The cases, l, m, n, 2, 4, 6 and, 2, 5, 6 of the Diophantine equation 3 for q-binomial coefficients lead to and q 4 q 3 q q 2 q6 q, or q7 + q 6 + q 2 q 8 + q 4 + q 3, q 5 q 4 q q 2 q6 q, or q9 + q 6 + q 2 q 8 + q 5 + q 4, respectively, both of which are impossible again by the uniqueness of the base q expansion of a positive integer. 3 The proof of Theorem 2 We [ eep ] the notations from the previous section, and start with some estimates m for. Let p : i i 2 i i Lemma We have [ ] m m 2 + ζ m,, p where ζ m, is a real number satisfying ζ m, < Proof We have 5
6 [ ] m m m m + 2 m+m + +m + 2 m 2 i i. i i Now observe that i i p i + It remains to estimate ζ m,. We use the inequality i p + ζ m,. e z/2 if z 0, /4, e z > + z > e 2z if z /4, 0. 5 We shall use the above inequality 4 with z / i for i +. Note that the inequality z 2+ 4 < /4 holds for all. We get that + ζ m, i < exp i i + i + +2 exp exp 2+2 / < Thus, ζ m, < By a similar calculation using the right hand side of inequalities 4, we get yielding + ζ m, exp 2 i + exp i 2 exp > 2 2+, ζ m, > 2 The desired inequality now follows from estimates 5 and
7 Lemma 2 We have where [ ] m m /2 5 /2 + ζ m,, ζ m, < 2 2m 2+. Proof We write [ ] m m m m + 2 m+m + +m + 5 /2 2 i0 m i. We now study the last product above. When, then the above product is + ζ m, m. 2m Thus, ζ m, < 2 2m 2m, so the desired inequality holds in this case. Assume now that 2. We then have, again by inequalities 4, that + ζ m, i0 m i < exp i0 2m i exp 2m + 2 exp < + 2m m 2+. In the above inequality, we used again inequality 4 with z 2/ 2m 2+ together with the fact that z 2/ 2+ 2/ 5 < /4 holds for all integers 2. Thus, ζ m, < 2 2m 2+. Using now the right hand side of inequality 4, we get + ζ m, 2 exp exp i0 2m i leading to ζ m, 2 > 2m 2+. This completes the proof of this lemma. 2 2m m 2+, 7
8 Lemma 3 The inequality holds for all > l. Proof Clearly, +/2 ll+/2 5 l/2 l+ > 8 2l+5 +/2 ll+/2 5 l/2 l+ il+ If l +, then the above expression becomes ± 2l 2 i. 2l+2 ± 2l 2 > 2l+2 + 2l+3. Assume now that l + 2. Observe that if i is odd, then i+ In particular, if l is odd, then so that il+ i il+ However, if i is even, then i+ i+2 + 2i+2 2i+4 + 2i+2 2i+4 > 4i+6 2i+3 4i+6 < 2i+3. i < 2l+3, / > 2l+3 2l+3 2 > 2l+3. i+2 + 2i+2 2i+4 + 2i+2 2i+4 4i+6 > + 2i+3 2i+5 + 2i+4, 8
9 so that, if l is even, then il+ i > + 2l+4, leading to il+ i + / > 2l+4 2l+5, which completes the proof of this lemma. It is nown that the number p appearing at?? is transcendental apply, for example, Lemma and Lemma 2 from [6] to the function fz ηz and the algebraic number q /. In particular, it cannot be of the form 5 l/2 / s for any positive integers l and s The next lemma tells us even more, namely that the number p cannot be approximated too well by numbers of the form 5 l/2 / s for positive integers l and s. Lemma 4 The inequality s 5 l/2 p > 5 3l/2 holds for all positive integers s and l with finitely many exceptions. Proof Assume that s is large and that s 5 l/2 p < 5 3l/2 holds with some positive integer l. Then also the inequality 5 l/2 p s 3s holds, where we can tae the above implied constant as 2/p 2 once s is sufficiently large. By Euler s pentagonal formula, p n3n /2 n3n+/2 n + n εn, n + ε n,2, n3n n3n+ 9
10 for some signs ε n,, ε n,2 {±}. Let N : N s be the minimal positive integer such that N3N + > 2s + 0. Then both estimates and N3N + 2s + Os /2, N + 3N + N3N + 4N + 2 c 0 s /2, c s /2 hold for large s with some positive constants c 0 and c. Thus, 5 l/2 s N n εn, + ε n,2 n3n n3n+ O +. 3s N+3N+ Multiplying both sides of the above approximation by N3N+ we get N 5 l/2 N3N+ s ε n, u n, + ε n,2 u n,2 n + s+os/2 4N c 0s /2 provided that s is sufficiently large. Here, u n, and u n,2 stand for the nonnegative exponents of the form N3N + n3n and N3N + n3n+, respectively, for all positive integers n,...,n. Put now u N3N + s > s + 0 and observe that the number N γ 5 l/2 u ε n, u n, + ε n,2 u n,2 n is an algebraic integer in K Q[ 5]. Its absolute value is, by 8, bounded above by O c 0 s. Its conjugate in K is N σγ ±5 l/2 u ε n, u n, + ε n,2 u n,2. n Since s is assumed to be large, it follows that s 5 l/2, therefore 5 l/2 u 5 l/2 u < 5 l/2 s. Since also ε n, u n, + ε n,2 u n,2 < n n 0, n N it follows that σγ. Thus, N K/Q γ γ σγ c 0 s. However, N K/Q γ is an integer. or large s, the above inequality is possible only when γ
11 We now study this last condition and show that it is impossible, which will complete the proof of the lemma. Assume that γ 0. Then we get 5 l/2 n N εn, u n, u + ε n,2 u n,2 u. 0 Conjugating in K, we get that ε5 l/2 n N εn, u n, u + ε n,2 u n,2 u, where ε {±} according to whether l is even or odd. Suppose say that ε. Then subtracting the above relations 9 and 0 and dividing both sides of the resulting relation by 5, we get εn, un, u + ε n,2 un,2 u 0. 2 n N Observe that the indices in the above relation satisfy u, u < u,2 u < u 2, u < u 2,2 u < < u N, u < u N,2 u. 3 Let M { u n,i u : n N, i, 2} {m, m 2,..., m t }, where m < m 2 < < m t : M. Observe that all members of M are nonnegative. urthermore, because of inequalities 2 for each m j M, there are at most two numbers u n,i u in the string 2 such their absolute values is m j, and if there are two then one of them is the negative of the other. Observe also that since u n,i is always even, it follows that all the numbers in M have the same parity. inally, let us observe that the first three large values of M appear only once. Indeed, the largest positive member in 2 is u N,2 u N3N + N3N + s s, whereas the first three negative ones in 2 are Thus, u, u N3N + s + 2 < s + 8, u,2 u N3N + s + 4 < s + 6, u 2, u N3N + s + 0 < s. M m t N3N + s + 2, m t N3N + s + 4 M 2, m t 2 N3N + s + 0 M 8, are the first three largest elements in M, and for each of them, there is only one element namely the corresponding negative one in the string 2 whose
12 absolute value is this given element. rom the above discussion, and using also the fact that m m m, we deduce that relation leads to the inequality M M 2 + M M M/2 Using the fact that m m / 5 + O, we get that 5 M/2 M 2 < M 0 + M M 0 + M OM 5 M 9 + OM. Thus, relation 3 leads to or M M 2 + M 8 + 2M 9 + OM, M + O M and this is false for large M; hence, for large s., 5 The case when ε is similar. In this case, we sum up relations 9 and 0 and get a relation similar to, except that the ibonacci numbers are replaced by the Lucas numbers L n n 0, where L 0 0, L and L n+2 L n+ + L n for all n 0. The general term of the Lucas sequence L n n 0 is L n n + n. A similar argument leads to inequality 4 from which the same contradiction as in the case ε is derived. This shows that γ cannot be zero and completes the proof of the lemma. The proof of Theorem 2. In parallel with the proof of this theorem, we also show that f N+ f N > 00 for N > 26. Let N be sufficiently large, say at least such that log log log f N >. Let K be tending to infinity with N. We need to show that if K tends to infinity with N sufficiently slowly, say, if K < c 2 log f N /2 with a sufficiently small positive constant c 2, then the Diophantine inequality [ ] m [ ] n l K 6 2
13 has only finitely many positive integer solutions m,, n, l with m/2, l n/2, m, n, l. We assume that n m. Observe that by Lemma, we have that for N large, f N expm 2 + O expnl l 2 + O, so that both inequalities m 2 log f N and nl l 2 log f N hold. Since m 2 m m/2 2, we get that m log f N /2. Let c 3 be the implied constant above. Assume that K c 3 log f N /2 3. Then m > K +2. or large N; hence, for large m, m has a primitive divisor which is at least as large as m K +. In the particular case that we tae K 00, we also assume that m > 00 since the remaining cases can be checed using Mathematica. Assume first that n m. [ Let ] P be [ some ] primitive prime factor of n. Then m n certainly P divides both and, therefore it divides their difference l which is K by inequality 5. Since P ± mod n, we get that P n K +. Thus, P K + 2, so the only possibility is therefore that the difference appearing in the left hand side of inequality 5 is zero. However, this is impossible for m, n, l by Theorem. Thus, we may assume that n > m. Assume next that l. Then [ ] n l [ ] m [ ] n n n n [ ] n 2 n n + n n n > n 2 > expc 3 log f N /2, 7 where we used the fact that n i i + for all i,...,. So, in particular, the above difference exceeds c 3 log f N /2 > K for N sufficiently large. Thus, we may assume that n > m 2 > 2l. In particular, n 2l + 3. Next, let us notice that m n l. Indeed, assume that this [ ] is not so. [ ] Let P m n be a primitive prime factor of m. Then P divides both and, so l again P divides their difference which is K. Since P K + 2, we get again a contradiction. Thus, m n l. 3
14 Next, we write [ ] m m 2 + ζ m, and p [ ] n l nl l2 + ζ n,l. p Put u max{nl l 2, m 2 }. By inequality 5 together with Lemma, we have m 2 nl l2 < Kp + u p ζ m, + ζ n,l < Kp + 4pu 2l+. Dividing both sides of the above inequality by u, putting λ m 2 nl l 2, and observing that u ln l ll + 3, we get that λ Kp 4p + ll+3 2l+. 8 We now distinguish two cases according to whether λ 0 or λ 0, respectively. The Case λ 0. This is the heart of the proof. We find it easier to explain it in the particular case when K 00, and to treat the general case later. The case K 00. In this case, the left hand side of the above inequality 7 is > 0.38, and we therefore get the inequality 0.38 < 23 ll l+, leading to l, 2. Since l, 2, by Lemma 2, we have where [ ] n l nl ll /2 5 l/2 + ζ n,l, ζ n,l 2 2n 3. Thus, inequality 5 together with Lemma 2 now lead to 4
15 nl l2 +ll+/2 m 2 5 l/2 p < 00 + u ll+/2 ζ 5 l/2 n,l + ζ m, p < 00 + u n p 2+ < 00 + u 2n p 2+. Observe that since n > m 2, we have that 2n provided that 3. The inequality 2n holds also when 2 since n > 00. We thus get that the inequality 2n holds always in our range, which leads to nl l2 +ll+/2 m 2 5 l/2 p u < p < 00 + u 2 2, where we also used the fact that / + 3/p < 3. We now divide both sides of the above inequality again by u getting nl l2 +ll+/2 u m 2 u 5 l/2 p < In the last inequality above, we also used the fact that u m 2. Note that the left side of the above inequality is either ll+/2 λ 5 l/2 p, or ll+/2 λ 5 l/2 p, 20 according to whether u nl l 2 or m 2. Since λ 0, in the first case we get that λ /p < /.22 < 0.5, while ll+/2 /5 l/2 / Thus, in the first case the left hand side of inequality 8 exceeds 0.2. In the second case, again since λ 0, it follows that the inequality λ ll + /2 holds in all cases except when λ, 2 and l 2. Hence, { } 2 max 5 l/2 5/2, 5 ll+/2 λ 2 5. This shows that in this second case the left hand side of inequality 8 is at least /p 2 /5 > 0.2. Thus, in both cases we have that giving < , 2 5
16 Hence, l, {, 2,, 3, 2, 3}. Next, we use again inequality 5 and Lemma 2 together with the obvious fact that max { } m /2, nl ll /2 u 5 /2 5 l/2 l 5 /2, to get that m /2 nl ll /2 5 /2 5 l/2 l u 2 < n 3 2m 5 < 00 + u 2m 7, 22 where we used the fact that n 3 2m 5 2m n 2m+2 < 2m 7, since n 2m < 4 2. Dividing again both sides of the above inequality 2 by u and using the fact that u m 2m 2, we get that m 2 u++/2 nl l2 u+ll+/2 5 /2 5 l/2 l < m 4 2m The left hand side above is either +/2 ll+/2 λ 5 /2 5 l/2 l, or +/2 λ ll+/2 5 /2 5 l/2 l, 24 according to whether u nl l 2 or m 2. In the first case, we have that +/2 /5 /2 0.8 for 2, 3, while ll+/2 λ /5 l/2 l /5 /2 < 0.5 by an argument already used. Thus, in this case the left hand side of inequality 22 is at least 0.3. In the second case, we have that ll+/2 /5 l/2 l 0.72 for l, 2, while +/2 λ { 2 max 5 /2 5, 5 } < /2 6
17 for 2, 3 and λ 0, therefore the left hand side of inequality 22 exceeds 0.9 in this case. Thus, in both cases we have leading to m < 9, which is false. 0.9 < m 4 This taes care of the case λ 0 when K 00. 2m 7, 25 The case of the general K. In the case of the general K and when λ 0, the inequality 7 shows that l Olog K /2. Then the arguments from the case K 00 show that the analog inequality 8 holds with 00 replaced by K and with the exponent 2 2 replaced by 2 + Olog K. Indeed, the only inequality to justify is the fact that the difference n grows faster than any fixed multiple of log K once N is sufficiently large. Well, assuming that this were not so, we would get that infinitely often n < c 4 log K holds with some positive constant c 4. Thus, m < n log K implying log K, and later that m < n + Olog K log K. Thus, m log K 2 log log f N 2, which combined with the fact that m log f N gives only finitely many possibilities for N. Thus, if N is sufficiently large, we get to inequality 8 with the right hand side replaced by 2+Olog K. Now inequality 8 with 00 replaced by K together with the lower bound given by Lemma 4 on the expression appearing in the right hand side in display 9 lead to an inequality of the form 5 3l/2 2+Olog K, implying l + Olog K. Since also l log K /2, we get that log K. We thus bounded both l and in terms of K. ollowing through the arguments from the case when K 00, we arrive at the analog of inequality 22 with 00 replaced by K, which implies that +/2 ll+/2± λ 5 l/2 l+ 2m+Olog K. 26 The right hand side above is not zero. Indeed, if it were, then since no power of of nonzero exponent can be an integer, we get that the exponent of in the left hand side of equation 25 is zero, and further that l+ 5 l/2. By the Primitive Divisor Theorem, the above relation is false for > 2, 7
18 and it can be checed that it does not hold for any l < 2 either. Thus, the left hand side of equation 25 is indeed nonzero. urthermore, since +/2 p5 /2 as, it follows that the only chance the above expression from the right hand side has of being small is when λ O. We now use a linear form in logarithms á la Baer [2], which states that if, 2, 3 are algebraic numbers of heights H, H 2, H 3, respectively, and b, b 2, b 3 are integers of absolute value at most B such that then Λ b b 2 2 b 3 3 0, Λ > exp c 5 logh + 2 logh logh logb + 2 for some positive constant c 5 depending on the degree of the field Q[, 2, 3 ] over Q. Recall that the height of an algebraic number is the maximum absolute value of the coefficients of its minimal polynomial over the integers. We apply this with, 2 5, 3 l+, and b + /2 ll + /2 ± λ, b 2 l, b 3. Note that H O, H 2 O, H 3 O2 and B O 2. We thus get that the left hand side of 25 is bounded below by exp c 6 2 log, where c 6 is some absolute constant. Thus, we get the inequality yielding Hence, m + Olog K 2 log log K 2 log log K, m log K 2 log log K. m log K 3 log log K log log f N 3 log log log f N. However, m > m log f N, which gives log f N log log f N 3 log log log f N, and this has only finitely many solutions N. This taes care of the case λ 0. The case λ 0. Here too we distinguish between the instance when K 00 and the general K. The case when K 00. 8
19 We use inequality 5 with K 00 together with Lemma 2 to get m /2 nl ll /2 5 /2 5 l/2 l m /2 5 /2 2m 2+ 2 nl ll /2 + 5 l/2 l 2n 2l+. We divide both sides of the above inequality by nl ll /2 / 5 l/2 l, and recalling that m 2 nl l 2 we obtain +/2 ll+/2 5 l/2 l+ <00 5l/2 l nl ll / /2 ll+/2 5 l/2 l+ 2m n 2l+. 27 Next, we estimate the terms involved in the right hand side of 26. Observe that l 5 l/2 l < + +l + <.8 ll+/2, 2i while +/2 ll+/2 5 l/2 l+ il+ i < < 2.. 2i i 2i Thus, using also the facts that l <, n l m +, and nl l 2 m 2m, we get that the right hand side of inequality 26 is < m < 84 3 < 2m 2 2m As for the left hand side of inequality 26, we use inequality 7 of Lemma 3, to arrive at < 2l+5 2m 2, 29 which leads to 2m < 2 + 2l + 6. Thus, m + l + 7. Since m 2, we get that l + 7. Hence, m 2 m l+7 2 l 2 +4l+49. Since ln l m l 2 +4l+49, we get that n l l+4+49/l, therefore n 2l+4+49/l. Thus, n l l+4+49/l. Since m n l, we get that 2 m n l l /l. Since l +, we get that 2l + 2 l /l, or l /l, leading to l 5. Thus, l and m +l , which is a contradiction. Hence, inequality 5 has no solutions with n m > 00. The case of the general K. 9
20 Arguments identical to the ones used in when K 00 lead to the analogue of inequality 28 with 2m 2 replaced by 2m 2 + Olog K, which leads to m +l+ologk. The argument used in the final step of the proof of the argument for K 00 shows first that l + Olog K, then that n 2l+Olog K, so that n l l+olog K. Since n l 2 2l+O, we get 2l+Olog K l+olog K; thus, l OlogK, therefore n Olog K. Thus, m Olog K 2 Olog log f N 2. Since also m log f N, we get that log f N log log f N 2, so again only finitely many possibilities for N. This finishes the proof of the theorem. As for the computational case when K 00 and m 00, by going through the previous bounds, a very rough estimate renders the bound n A computer program exhausted easily this entire range, revealing that f N+ f N 00, only if N 8, or N urther comments and a generalization A similar result as Theorem 2 holds when instead of the ibonomials, we arrange all the q-binomial coefficients in increasing order, or, more generally, all the C-nomial coefficients, when C C n n 0 is a Lucas sequence of integers satisfying the property that > in particular, its roots are real. In order to prove this, at least for q-binomial coefficients, one would need to prove obvious analogues of Lemmas, 2, 3 and 4. or example, the analogue of Lemma 4 would state that the inequality q s q l p > q q 3l holds for all but finitely many pairs l, s, once q is fixed, where p q. n q n It would be of interest to study mixed Diophantine equations of the type [ ] n l C [ ] m, C 2 where C and C 2 are two distinct Lucas sequences. or example, what can one say about the number of solutions of the Diophantine equation [ ] n l [ ] m, q 20
21 where l n/2, m/2 in unnowns, l, m, n once q > is a fixed integer? Does this have finitely or infinitely many solutions? When and l are fixed, then the two sides of the above equation become linear recurrent sequences of orders depending on and l with dominant roots powers of and q, respectively, where these dominant roots are multiplicatively independent. Standard results from the theory of Diophantine equations see [0], for example, will then lead to the conclusion that there are only finitely many possibilities for the pair m, n once the pair, l is fixed. We do not have an argument to the effect that the above Diophantine equation has only finitely many solutions in all four variables, l, m, n. Of a somewhat related form is the main result from [8], where it is shown that there is no non-abelian finite simple group whose order is a ibonacci number. inally, let us loo at the series N f N. 30 The fact that it is convergent follows because for each n, row n contains n + /2 ibonomial coefficients the smallest one being [ ] n n. This shows that series 29 is bounded above by n n n, and this last series is certainly convergent. What is the nature of the number 29? Is it algebraic or transcendental? We recall that it is nown that the sum of the reciprocals of the odd indexed ibonacci numbers is transcendental see [6]. Acnowledgments We than the anonymous referee for constructive criticism on a previous version of the manuscript and for pointing out a relevant reference. Wor by the third author was done in the all of 2008 while he visited Instituto de Matemáticas de la Universidad Nacional Autónoma de México. He thans this institution for its hospitality. References [] P. Bachmann, Niedere Zahlentheorie, Volume 2, Leipzig, Teubner, 90. [2] A. Baer and G. Wüstholz, Logarithmic forms and group varieties, J. Reine Angew. Math ,
22 [3] Yu. Bilu, G. Hanrot and P. Voutier, Existence of primitive divisors of Lucas and Lehmer numbers with an appendix by M. Mignotte, J. reine angew. Math , [4] Y. Bugeaud, M. Mignotte, S. Sise, M. Stoll and Sz. Tengely, Integral points on hyperelliptic curves, Algebra Number Theory , [5] R. D. Carmichael, On the numerical factors of the arithmetic forms n ± n, Annals of Math , [6] R. J. Stroeer and B. M. M. de Weger, Elliptic binomial Diophantine equations, Math. Comp , [7] D. Duverney, K. Nishioa, K. Nishioa and I. Shioawa, Transcendence of Rogers-Ramanujan continued fraction and reciprocal sums of ibonacci numbers, Proc. Japan Acad. Ser. A Math. Sci , [8] D. Jarden and Th. Motzin, The product of sequences with a common linear recursion formula of order 2, Riveon Lematematia 3 949, 25 27, 38. [9]. Luca, ibonacci numbers, Lucas numbers and orders of finite simple groups, JP J. Algebra Number Theory Appl , [0] E. Lucas, Theorie des onctions Numeriques Simplement Periodiques, American J. Math. 878, and [] T. N. Shorey and R. Tijdeman, Exponential Diophantine equations, Cambridge Tracts in Mathematics 87, Cambridge University Press, Cambridge, 986. [2] N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, njas/sequences/. 22
Fibonacci 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 informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
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 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 informationTwo Diophantine Approaches to the Irreducibility of Certain Trinomials
Two Diophantine Approaches to the Irreducibility of Certain Trinomials M. Filaseta 1, F. Luca 2, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia, SC 29208;
More informationFIBONACCI DIOPHANTINE TRIPLES. Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary
GLASNIK MATEMATIČKI Vol. 436300, 53 64 FIBONACCI DIOPHANTINE TRIPLES Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary Abstract. In
More informationArithmetic properties of the Ramanujan function
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 116, No. 1, February 2006, pp. 1 8. Printed in India Arithmetic properties of the Ramanujan function FLORIAN LUCA 1 and IGOR E SHPARLINSKI 2 1 Instituto de Matemáticas,
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 informationJournal of Number Theory
Journal of Number Theory 132 2012) 324 331 Contents lists available at SciVerse ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt Digit sums of binomial sums Arnold Knopfmacher a,florianluca
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 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 informationActa Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24 PRIMITIVE DIVISORS OF LUCAS SEQUENCES AND PRIME FACTORS OF x 2 + 1 AND x 4 + 1 Florian Luca (Michoacán, México) Abstract. In this
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 informationPowers of Two as Sums of Two Lucas Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.8.3 Powers of Two as Sums of Two Lucas Numbers Jhon J. Bravo Mathematics Department University of Cauca Street 5 No. 4-70 Popayán,
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 informationPerfect Powers With All Equal Digits But One
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.7 Perfect Powers With All Equal Digits But One Omar Kihel Department of Mathematics Brock University St. Catharines, Ontario L2S
More informationAliquot sums of Fibonacci numbers
Aliquot sums of Fibonacci numbers Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de Méico C.P. 58089, Morelia, Michoacán, Méico fluca@matmor.unam.m Pantelimon Stănică Naval Postgraduate
More informationRevista Colombiana de Matemáticas Volumen 40 (2006), páginas 81 86
Revista Colombiana de Matemáticas Volumen 40 2006), páginas 81 86 Palindromic powers Santos Hernández Hernández Pontificia Universidad Católica de Chile, Santigo Florian Luca Universidad Nacional Autónoma
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 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 informationON GENERALIZED BALANCING SEQUENCES
ON GENERALIZED BALANCING SEQUENCES ATTILA BÉRCZES, KÁLMÁN LIPTAI, AND ISTVÁN PINK Abstract. Let R i = R(A, B, R 0, R 1 ) be a second order linear recurrence sequence. In the present paper we prove that
More informationMembers of binary recurrences on lines of the Pascal triangle
Publ. Math. Debrecen 67/1-2 (2005), 103 113 Members of binary recurrences on lines of the Pascal triangle By FLORIAN LUCA (Morelia) and FRANCESCO PAPPALARDI (Roma) Abstract. In this paper, we look at a
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationarxiv: v1 [math.nt] 9 Sep 2017
arxiv:179.2954v1 [math.nt] 9 Sep 217 ON THE FACTORIZATION OF x 2 +D GENERALIZED RAMANUJAN-NAGELL EQUATION WITH HUGE SOLUTION) AMIR GHADERMARZI Abstract. Let D be a positive nonsquare integer such that
More informationuniform distribution theory
Uniform Distribution Theory 9 204 no. 2 25 uniform distribution theory ON THE FIRST DIGITS OF THE FIBONACCI NUMBERS AND THEIR EULER FUNCTION Florian Luca Pantelimon Stănică ABSTRACT. Here we show that
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics ON THE DIOPHANTINE EQUATION xn 1 x 1 = y Yann Bugeaud, Maurice Mignotte, and Yves Roy Volume 193 No. 2 April 2000 PACIFIC JOURNAL OF MATHEMATICS Vol. 193, No. 2, 2000 ON
More information#A12 INTEGERS 11 (2011) ON THE NUMBER OF FACTORIZATIONS OF AN INTEGER
#A12 INTEGERS 11 (2011) ON THE NUMBER OF FACTORIZATIONS OF AN INTEGER R. Balasubramanian The Institute of Mathematical Sciences, Chennai, India balu@imsc.res.in Florian Luca 1 Instituto de Matemáticas,
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 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 informationA Remark on Prime Divisors of Lengths of Sides of Heron Triangles
A Remark on Prime Divisors of Lengths of Sides of Heron Triangles István Gaál, István Járási, Florian Luca CONTENTS 1. Introduction 2. Proof of Theorem 1.1 3. Proof of Theorem 1.2 4. Proof of Theorem 1.3
More informationOn the digital representation of smooth numbers
On the digital representation of smooth numbers Yann BUGEAUD and Haime KANEKO Abstract. Let b 2 be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer
More informationuniform distribution theory
Uniform Distribution Theory 9 (2014), no.1, 21 25 uniform distribution theory ON THE FIRST DIGITS OF THE FIBONACCI NUMBERS AND THEIR EULER FUNCTION Florian Luca Pantelimon Stănică ABSTRACT. Here, we show
More informationAlmost fifth powers in arithmetic progression
Almost fifth powers in arithmetic progression L. Hajdu and T. Kovács University of Debrecen, Institute of Mathematics and the Number Theory Research Group of the Hungarian Academy of Sciences Debrecen,
More informationLINEAR FORMS IN LOGARITHMS
LINEAR FORMS IN LOGARITHMS JAN-HENDRIK EVERTSE April 2011 Literature: T.N. Shorey, R. Tijdeman, Exponential Diophantine equations, Cambridge University Press, 1986; reprinted 2008. 1. Linear forms in logarithms
More informationPrime divisors of binary holonomic sequences
Advances in Applied Mathematics 40 (2008) 168 179 www.elsevier.com/locate/yaama Prime divisors of binary holonomic sequences Florian Luca Instituto de Matemáticas, Universidad Nacional Autónoma de México,
More informationA Journey through Galois Groups, Irreducible Polynomials and Diophantine Equations
A Journey through Galois Groups, Irreducible Polynomials and Diophantine Equations M. Filaseta 1, F. Luca, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia,
More informationODD REPDIGITS TO SMALL BASES ARE NOT PERFECT
#A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of
More informationEXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES
#A7 INTEGERS 15A (2015) EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES Joshua Harrington Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania JSHarrington@ship.edu Lenny
More informationOn a problem of Nicol and Zhang
Journal of Number Theory 28 2008 044 059 www.elsevier.com/locate/jnt On a problem of Nicol and Zhang Florian Luca a, József Sándor b, a Instituto de Matemáticas, Universidad Nacional Autonoma de México,
More informationFadwa S. Abu Muriefah. ON THE DIOPHANTINE EQUATION x fc = y n
DEMONSTRATIO MATHEMATICA Vol. XXXIX No 2 2006 Fadwa S. Abu Muriefah ON THE DIOPHANTINE EQUATION x 2 + 5 2fc = y n Abstract. In this paper we prove that the title equation where k > 0 and n > 3, may have
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 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 informationConcatenations with Binary Recurrent Sequences
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 8 (005), Article 05.1.3 Concatenations with Binary Recurrent Sequences William D. Banks Department of Mathematics University of Missouri Columbia, MO 6511
More informationTHE DIOPHANTINE EQUATION P (x) = n! AND A RESULT OF M. OVERHOLT. Florian Luca Mathematical Institute, UNAM, Mexico
GLASNIK MATEMATIČKI Vol. 37(57(2002, 269 273 THE IOPHANTINE EQUATION P (x = n! AN A RESULT OF M. OVERHOLT Florian Luca Mathematical Institute, UNAM, Mexico Abstract. In this note, we show that the ABC-conjecture
More informationIrreducible radical extensions and Euler-function chains
Irreducible radical extensions and Euler-function chains Florian Luca Carl Pomerance June 14, 2006 For Ron Graham on his 70th birthday Abstract We discuss the smallest algebraic number field which contains
More informationA parametric family of quartic Thue equations
A parametric family of quartic Thue equations Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the Diophantine equation x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3 + y 4 = 1, where c
More informationGeneralized Lebesgue-Ramanujan-Nagell Equations
Generalized Lebesgue-Ramanujan-Nagell Equations N. Saradha and Anitha Srinivasan Dedicated to Professor T. N. Shorey on his 60th birthday 1 Prelude For any positive integer ν > 1, let P (ν) and ω(ν) denote
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationOn sets of integers whose shifted products are powers
On sets of integers whose shifted products are powers C.L. Stewart 1 Department of Pure Mathematics, University of Waterloo, Waterloo, Ontario, Canada, NL 3G1 Abstract Let N be a positive integer and let
More informationMarcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela
#A89 INTEGERS 16 (016) ON SIERPIŃSKI NUMBERS OF THE FORM '(N)/ n Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela mago@usb.ve
More informationWhen do the Fibonacci invertible classes modulo M form a subgroup?
Annales Mathematicae et Informaticae 41 (2013). 265 270 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Alications Institute of Mathematics and Informatics, Eszterházy
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 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 informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
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 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 informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime 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 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 informationPILLAI S CONJECTURE REVISITED
PILLAI S COJECTURE REVISITED MICHAEL A. BEETT Abstract. We prove a generalization of an old conjecture of Pillai now a theorem of Stroeker and Tijdeman) to the effect that the Diophantine equation 3 x
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationZsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1
Zsigmondy s Theorem Lola Thompson Dartmouth College August 11, 2009 Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, 2009 1 / 1 Introduction Definition o(a modp) := the multiplicative order
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 informationSome generalizations of a supercongruence of van Hamme
Some generalizations of a supercongruence of van Hamme Victor J. W. Guo School of Mathematical Sciences, Huaiyin Normal University, Huai an, Jiangsu 3300, People s Republic of China jwguo@hytc.edu.cn Abstract.
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 informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
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 informationRigid Divisibility Sequences Generated by Polynomial Iteration
Rigid Divisibility Sequences Generated by Polynomial Iteration Brian Rice Nicholas Pippenger, Advisor Christopher Towse, Reader May, 2008 Department of Mathematics Copyright c 2008 Brian Rice. The author
More informationOdd prime values of the Ramanujan tau function
Ramanujan J DOI 10.1007/s11139-012-9420-8 Odd prime values of the Ramanujan tau function Nik Lygeros Olivier Rozier Received: 22 May 2012 / Accepted: 8 July 2012 Springer Science+Business Media, LLC 2013
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More information#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS
#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS Kevin Doerksen Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada kdoerkse@gmail.com Anna Haensch Department
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 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 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 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 informationExtend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1
Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1 Nico F. Benschop AmSpade Research, The Netherlands Abstract By (p ± 1) p p 2 ± 1 mod p 3 and by the lattice structure of Z(.) mod q
More informationARITHMETIC PROPERTIES OF THE INTEGER PART OF THE POWERS OF AN ALGEBRAIC NUMBER
GLASNIK MATEMATIČKI Vol. 44(64)(2009), 285 307 ARITHMETIC PROPERTIES OF THE INTEGER PART OF THE POWERS OF AN ALGEBRAIC NUMBER Florian Luca and Maurice Mignotte Universidad Nacional Autónoma de México,
More informationSmall exponent point groups on elliptic curves
Journal de Théorie des Nombres de Bordeaux 18 (2006), 471 476 Small exponent point groups on elliptic curves par Florian LUCA, James MCKEE et Igor E. SHPARLINSKI Résumé. Soit E une courbe elliptique définie
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 informationThe Diophantine equation x(x + 1) (x + (m 1)) + r = y n
The Diophantine equation xx + 1) x + m 1)) + r = y n Yu.F. Bilu & M. Kulkarni Talence) and B. Sury Bangalore) 1 Introduction Erdős and Selfridge [7] proved that a product of consecutive integers can never
More informationThis is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.
8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
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 informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
More informationINTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS
INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS JEAN-MARIE DE KONINCK and FLORIAN LUCA Abstract. For each integer n 2, let β(n) be the sum of the distinct prime divisors of n and let B(x) stand for
More informationTWO VARIATIONS OF A THEOREM OF KRONECKER
TWO VARIATIONS OF A THEOREM OF KRONECKER ARTŪRAS DUBICKAS AND CHRIS SMYTH ABSTRACT. We present two variations of Kronecker s classical result that every nonzero algebraic integer that lies with its conjugates
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 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 informationHouston Journal of Mathematics c 2050 University of Houston Volume 76, No. 1, Communicated by George Washington
Houston Journal of Mathematics c 2050 University of Houston Volume 76, No., 2050 SUMS OF PRIME DIVISORS AND MERSENNE NUMBERS WILLIAM D. BANKS AND FLORIAN LUCA Communicated by George Washington Abstract.
More informationON `-TH ORDER GAP BALANCING NUMBERS
#A56 INTEGERS 18 (018) ON `-TH ORDER GAP BALANCING NUMBERS S. S. Rout Institute of Mathematics and Applications, Bhubaneswar, Odisha, India lbs.sudhansu@gmail.com; sudhansu@iomaorissa.ac.in R. Thangadurai
More informationON THE EQUATION X n 1 = BZ n. 1. Introduction
ON THE EQUATION X n 1 = BZ n PREDA MIHĂILESCU Abstract. We consider the Diophantine equation X n 1 = BZ n ; here B Z is understood as a parameter. We give new conditions for existence of solutions to this
More informationON POWER VALUES OF POLYNOMIALS. A. Bérczes, B. Brindza and L. Hajdu
ON POWER VALUES OF POLYNOMIALS ON POWER VALUES OF POLYNOMIALS A. Bérczes, B. Brindza and L. Hajdu Abstract. In this paper we give a new, generalized version of a result of Brindza, Evertse and Győry, concerning
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More information#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT
#A5 INTEGERS 8A (208) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT Yann Bugeaud IRMA, UMR 750, Université de Strasbourg et CNRS, Strasbourg, France bugeaud@math.unistra.fr
More information1 n <. n G F. ζ(3) c = 2ζ(2) ζ(6)log α = , Our method is general and can be applied to any Lucas sequence of general term
Fibonacci Integers Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089, Morelia, Michoacán, México fluca@matmor.unam.mx Carl Pomerance Mathematics Department, Dartmouth
More informationWAITING FOR A BAT TO FLY BY (IN POLYNOMIAL TIME)
WAITING FOR A BAT TO FLY BY (IN POLYNOMIAL TIME ITAI BENJAMINI, GADY KOZMA, LÁSZLÓ LOVÁSZ, DAN ROMIK, AND GÁBOR TARDOS Abstract. We observe returns of a simple random wal on a finite graph to a fixed node,
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 information