THE NUMBER OF DIOPHANTINE QUINTUPLES. Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan
|
|
- Cecily Gilmore
- 5 years ago
- Views:
Transcription
1 GLASNIK MATEMATIČKI Vol. 45(65)(010), 15 9 THE NUMBER OF DIOPHANTINE QUINTUPLES Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan Abstract. A set a 1,..., a m} of m distinct positive integers is called a Diophantine m-tuple if a i a j + 1 is a perfect square for all i, j with 1 i < j m. It is known that there does not exist a Diophantine sextuple and that there exist only finitely many Diophantine quintuples. In this paper, we first show that for a fixed Diophantine triple a, b, c} with a < b < c, the number of Diophantine quintuples a, b, c, d, e} with c < d < e is at most four. Using this result, we further show that the number of Diophantine quintuples is less than 10 76, which improves the bound due to Dujella. 1. Introduction Diophantus posed the problem of finding a set of four (positive rational) numbers which has the property that the product of any two numbers in the set increased by one is a square, and found such a set 1/16, 33/16, 68/16, 105/16}. A set a 1,...,a m } of m distinct positive integers is called a Diophantine m-tuple if a i a j + 1 is a perfect square for all i, j with 1 i < j m. Fermat found the first example of a Diophantine quadruple, which was the set 1, 3, 8, 10}. Euler found that for any Diophantine pair a, b} the set a, b, a+b+r} is a Diophantine triple, where r = ab + 1. We call such a triple regular. In 1979, Arkin-Hoggatt-Strauss ([1]) found that for any Diophantine triple a, b, c} the set a, b, c, d + } is a Diophantine quadruple, where d + = a+b+c+abc+rst and r = ab + 1, s = ac + 1, t = bc + 1, and conjectured the following. Conjecture 1.1. If a, b, c, d} is a Diophantine quadruple with a < b < c < d, then d = d Mathematics Subject Classification. 11D09, 11J68, 11J86. Key words and phrases. Simultaneous Diophantine equations, Diophantine tuples. 15
2 16 Y. FUJITA We say that a Diophantine quadruple a, b, c, d} with a < b < c < d is regular if d = d +. Conjecture 1.1 immediately implies a folklore conjecture, which says that there does not exist a Diophantine quintuple. It is known that there does not exist a Diophantine sextuple and that there does not exist only finitely many Diophantine quintuples ([8]). Recently, we ([1]) showed that if a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e, then d = d + (note that all the quadruples contained in the quintuple, other than a, b, c, d}, are irregular; see Section 1 in [1]). The first result supporting Conjecture 1.1 is due to Baker and Davenport ([]), which asserts that if 1, 3, 8, d} is a Diophantine quadruple, then d = 10. This result has been generalized and it is known that the Diophantine quadruples containing the pairs k 1, k + 1} with k (cf. [4, 5, 10, 11]) or the triples F k, F k+, F k+4 } with k 1 (cf. [6]), where F ν is the ν- th Fibonacci number, are always regular. Besides them, the Diophantine quadruples containing the following triples are regular: 1, 8, 15}, 1, 8, 10}, 1, 15, 4}, 1, 4, 35},, 1, 4} (by Kedlaya [13]), 4, 1, 30} (by Dujella [8, p. 13]). Thus, one may easily check that if a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e, then b 8, d 6440 and ad 6888 (coming from 1, 35, 48, 6888}), bd (coming from 3, 16, 33, 6440}). The last two lower bounds play important roles in proving Theorem 1.. We are interested in bounding the number of Diophantine quintuples. We first consider the number of Diophantine quintuples a, b, c, d, e} with a < b < c < d < e for a fixed triple a, b, c}. Since the above-mentioned result ([1]) implies that d is unique, it suffices to bound the number of the e s. The essential tool to do this is an exponential gap principle between the solutions due to Okazaki (cf. [3, Lemma.]), which we may apply if there exist five such e s. Thus, we obtain the following. Theorem 1.. Fix a Diophantine triple a, b, c} with a < b < c. Then the number of Diophantine quintuples a, b, c, d, e} with c < d < e is at most four. Using Theorem 1., one may easily improve the bound due to Dujella ([9]) for the number of Diophantine quintuples. In fact, we reduce it to about the one-seventh power further by improving the upper bounds for b and d (in particular, for b). Theorem 1.3. The number of Diophantine quintuples is less than This paper is organized as follows. In Section, we rephrase the assumption that a, b, c, d, e} is a Diophantine quintuple in terms of a system of three
3 THE NUMBER OF DIOPHANTINE QUINTUPLES 17 Diophantine equations, which induces binary recurrent sequences. Then, we completely determine the initial terms of the sequences. In Section 3, using some congruence relations we give lower bounds for the solutions. In Section 4, using Baker s theory we give upper bounds for the solutions and for b and d. It is to be noted that its proof tells that any regular Diophantine triple a, b, c} with c = a+b+r > cannot be extended to a Diophantine quintuple (cf. Corollary 4.5). In Section 5, we give an exponential gap principle between the solutions. Combining it with the upper bound for the solutions we prove Theorem 1.. Finally, in Section 6 using the bounds for b and d and Theorem 1., we prove Theorem 1.3 along the same lines as Theorem 4 in [9].. The fundamental solutions of the system of Diophantine equations In this section, we transform the problem into solving a system of three Diophantine equations, which induces binary recurrent sequences u l }, v m }, w n }. Then, we determine the initial terms of the sequences, which we call the fundamental solutions of the system. We also examine the relationship between l, m and n in the case of u l = v m = w n. Let a, b, c} be a Diophantine triple with a < b < c, and r, s, t positive integers such that ab + 1 = r, ac + 1 = s, bc + 1 = t. Furthermore, suppose that a, b, c, d, e} is a Diophantine quintuple with c < d < e, and put ad + 1 = x, bd + 1 = y, cd + 1 = z with positive integers x, y, z. Then there exist integers α, β, γ, δ such that ae + 1 = α, be + 1 = β, ce + 1 = γ, de + 1 = δ, from which, by eliminating e, we obtain the system of Diophantine equations. (.1) (.) (.3) aδ dα = a d, bδ dβ = b d, cδ dγ = c d. Note that by Theorem.1 in [1] we know that d = d + = a+b+c+abc+rst. Lemma.1. (cf. [8, Lemma 1],[1, Lemma.1]) Let (δ, α), (δ, β), (δ, γ) be positive solutions of (.1), (.), (.3), respectively. Then there exist solutions
4 18 Y. FUJITA (δ 0, α 0 ) of (.1), (δ 1, β 1 ) of (.) and (δ, γ ) of (.3) in the ranges x α 0 < d d ad, 1 δ 0 a < 0.69d, y β 1 < d d bd, 1 δ 1 b < 0.148d, z γ < d d cd, 1 δ c < 0.148d such that (.4) (.5) (.6) δ a + α d = (δ 0 a + α0 d)(x + ad) l, δ b + β d = (δ 1 b + β1 d)(y + bd) m, δ c + γ d = (δ c + γ d)(z + cd) n for some integers l, m, n 0. Proof. This immediately follows from Lemma.1 in [1]. By (.4), (.5) and (.6), we may write δ as follows: δ = u l, where u 0 = δ 0, u 1 = xδ 0 + dα 0, u l+ = xu l+1 u l ; δ = v m, where v 0 = δ 1, v 1 = yδ 1 + dβ 1, v m+ = yv m+1 v m ; δ = w n, where w 0 = δ, w 1 = zδ + dγ, w n+ = zw n+1 w n. Lemma.. If δ = u l = v m = w n, then l m n 0 (mod ) and δ 0 = δ 1 = δ = ±1. Proof. If l is odd, then by Lemma 8 in [8] we have δ 0 = y and δ 0 = z, which are contradictions. Similarly, if m is odd, then δ 1 = x, δ 1 = z, and if n is odd, then δ = x, δ = y; in any case, we arrive at contradictions. It follows that l, m, n must be all even. Then Lemma 3 in [7] implies that δ 0 = δ 1 = δ. Put e 0 = (δ 0 1)/d. Then ae = α, be = β, ce = γ, de = δ 0. If δ 0 1, then a, b, c, d, e 0} is a Diophantine quintuple with e 0 < d, which contradicts d = d + (cf. Section 1). Therefore, we obtain δ 0 = 1. Lemma.3. If δ = u l = v m = w n, then 4 n m l n.
5 THE NUMBER OF DIOPHANTINE QUINTUPLES 19 Proof. From Lemma 3 in [8] we see that n 1 m n + 1, n 1 l n + 1 and m 1 l m + 1, that is, n 1 m n + 1 and m 1 l n + 1, which together with Lemma. imply that n m l n. The first inequality n 4 follows from Lemmas.4 to.7 in [1] (see also [1, p. 7]). We need the following lemma in order to prove Theorem 1.. Lemma.4. If δ = u l = v m = w n, then m 6. Proof. It suffices to show that u 4 v 4 and u 6 > v 4. The latter immediately follows from Lemma.10 (1) in [1] and its proof, in view of δ 0 = δ 1 = ±1 and d > 4abc > b. Suppose that u 4 = v 4. By Lemma. we have ±a(ad + 1) + (ad + 1)x = ±b(bd + 1) + (bd + 1)y. Since (by ax)d + y x > 0, we have (b a) (b a)d + 1} = (by ax)d + y x. However, d > 4abc > b implies that (b a)d+1 < yd and by ax > (b a)y, which are contradictions. 3. Lower bounds for solutions In this section, we first introduce the notion of standard triples. Then, we give lower bounds for m in terms of d. Definition 3.1. Let a, b, c} be a Diophantine triple with a < b < c. We call a, b, c} a Diophantine triple of (i) the first kind if c > b 5 ; (ii) the second kind if b > 4a and c b ; (iii) the third kind if b > 1a and b 5/3 < c < b. A Diophantine triple is called standard if it is of the first, the second or the third kind. Remark 3.. The definition of standard triples in [8] differs from the one above in the following: The condition for the first kind in [8] is c > b 4.5 ; The second and the fourth kind in [8] correspond to the second kind above. We modified the first kind in order to get better upper bounds for b and d, and combined the second and the fourth kind because dividing those cases does not affect the bounds (see the proof of Proposition 4.3). Lemma 3.3. Any Diophantine quadruple contains a standard triple.
6 0 Y. FUJITA Proof. Let a, b, c, d} be a Diophantine quadruple. In view of the proof of Proposition in [8], we may assume that a, b, c, d} is regular and b < 4a. If c > b 3, then d > 4abc > b 5, whence a, b, d} is of the first kind. Assume that c b 3. Then, from the same argument as in the proof of Proposition in [8] we see that either (i) c = a + b + r or (ii) c > 4ab + a + b, and that in the case of (i), a, c, d} is of the second kind; in the case of (ii), d < c and d > 4abc > b c c 5/, whence a, c, d} is of the third kind. Remark 3.4. It follows from the proof of Lemma 3.3 that any Diophantine quadruple a, b, c, d} with a < b < c < d contains a standard triple A, B, C} with A < B < C = d. Lemma 3.5. Suppose that a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e. Assume that d > (i) If a, b, c, d} contains a triple of the first kind, then m > d (ii) If a, b, c, d} contains a triple of the second kind, then m > d 0.4. (iii) If a, b, c, d} contains a triple of the third kind, then m > d Proof. Let A, B, C} be a standard triple with A < B < C contained in a, b, c, d}, and V j } and W k }, which are two of u l }, v m } and w n }, the attached sequences with 4 k j k. Put S = AC + 1 and T = BC + 1. It suffices to show that (i) k > C 0.05, (ii) k > C 0.4, (iii) k > C (i) Suppose that k C By Lemma 9 in [8] and Lemma., we have ±Aj + Sj ±Bk + Tk (mod 4C). Since Aj < C 0. 4C 0.05 < C, Sj < C C 0.05 < C, Bk < C 0. C 0.05 < C, Tk < C C 0.05 < C, we have (3.1) ±Aj + Sj = ±Bk + Tk. Squaring (3.1) twice, we have (Aj Bk ) j k } 4j k (mod C). (3.) Since k C 0.05 yields (Aj Bk ) j k } < (Bk ) 4 < C 0.8 C 0. = C, 4j k 16k 4 16C 0.1 < C, the congruence (3.) is in fact an equation, that is, (3.3) Aj Bk = (j + k).
7 THE NUMBER OF DIOPHANTINE QUINTUPLES 1 By (3.1) and (3.3), we have j(s 1) = k(t ± 1), which together with (3.1) implies that ( ) T ± 1 S(T ± 1) ± A B} k = T S 1 S 1. It follows from C = d > that (S + 1)(T + S) k = (AT + BS A + B) > AC B(S + 1) > 0.49C0.3 > C 0.05, which contradicts the assumption. Therefore, we obtain k > C (ii) Note that in this case Lemma 4 in [8] and k 4 together imply that j 3k/ + 1/ 1.65k. Suppose that k C 0.4. Since Aj < 1 4 C0.5 ( 1.65C 0.4) < C, Sj < 1 4 C C 0.4 < C, Bk < C ( 0.5 C 0.4) < C, Tk < C C 0.4 < C, we have the equation (3.1). We now have Aj S < j A < 1.65C C 0.5 C C 0.5 = 0.815C 0.01 < , Bk T < k B < C0.4 C 0.5 C C 0.5 = C 0.01 < 0.1. It follows from (3.1) that Sj > 0.9Tk, that is, j k > T B S > 0.83 A > 1.664, which contradicts j 1.65k. Therefore, we obtain k > C 0.4. (iii) Note that in this case Lemma 4 in [8] and k 4 together imply that j 8k/5 + 3/5 1.75k. Suppose that k C Since Aj < ( 1 1 C C 0.19) < C, Sj < 1 1 C C 0.19 < C, Bk < C 0.6 ( C 0.19) < C, Tk < C C 0.19 < C, we have the equation (3.1). In the same way as (ii), we see that Aj S < , Bk T < 0.1, and that Sj > 0.9Tk, that is, j/k >.965, which contradicts j 1.75k. Therefore, we obtain k > C This completes the proof of Lemma Upper bounds for b and d In this section, combining Lemma 3.5 with a theorem of Matveev ([14]) we give upper bounds for b and d. In its proof, it emerges that if d > , then d > b 5, which implies that any regular Diophantine triple a, b, c} with c = a + b + r > cannot be extended to a Diophantine quintuple.
8 Y. FUJITA We begin by quoting the theorem of Matveev. Theorem 4.1 ([14]). Let Λ be a linear form in logarithms of N multiplicatively independent totally real algebraic numbers α 1,..., α N with rational integer coefficients b 1,..., b N (b N 0). Let h(α j ) denote the absolute logarithmic height of α j for 1 j N. Define the numbers D, A j (1 j N) and E by D = [Q(α 1,...,α N ) : Q], A j = maxdh(α j ), log α j }, E = max 1, max b j A j /A N ; 1 j N}}. Then, log Λ > C(N)C 0 W 0 D Ω, where C(N) = 8 (N 1)! (N + )(N + 3)(4e(N + 1))N+1, C 0 = log(e 4.4N+7 N 5.5 D log(exd)), W 0 = log(1.5exed log(exd)), Ω = A 1 A N. Proposition 4.. Suppose that a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e. Then, m log(351m) < (log d) with m as in the equation (.5). Proof. Let A, B, C, S, T and V j, W k be as in the proof of Lemma 3.5. We may assume that C(= d) > B 5/3 and C 6440 > 10 3 (cf. Section 1). Put Λ = j log ξ k log η + log µ, where ξ = S + AC, η = T + BC, µ = B( C ± A) A( C ± B). Then, by (60) in [8] we know that (4.1) 0 < Λ < 8 3 ACξ j. We apply Theorem 4.1 with N = 3, D = 4, α 1 = ξ, α = η, α 3 = µ. We have A 1 = logα 1 < log( AC + 1) < log(.0001c 0.8 ) < logc, A = logα < log( BC + 1) < log(.0001c 0.8 ) < logc. Since the minimal polynomial of µ is A (C B) X 4 + 4A B(C B)X 3 + AB(3AB AC BC C )X + 4AB (C A)X + B (C A)
9 THE NUMBER OF DIOPHANTINE QUINTUPLES 3 up to a multiple of a constant, the leading coefficient a 0 of the minimal polynomial of µ satisfies ( ) 1 C 4 B 1 a 0 A (C B). Since we have B B( C ± A) B( C + B) A < < A( C B) A(C B) B(1 + B/C) B < < A(1 B/C) A, B B( C ± A) B( C B) A > > A( C + B) A(C B) ( ) B B B > 1 C A > A, A 3 = 4h(µ) < log ( B (C B) ) < logc, and noting that A, B, C} is a standard triple with C > 10 3 we have ( ) A 3 > log B(C B) 4A > log(c 1/5 ) = 0. logc. Since k j, we have E < ja 1 A 3 < j. Hence we obtain the following: Since C(3) = 8 5 9(16e)4 < , C 0 = log ( e log(4e) ) < , W 0 = log (6exE log(4e)) < log(351j), Ω = A 1 A A 3 < (logC) 3. log 8 3 ACξ j < log 8 3 C(4C) j < 1.006j log C, Theorem 4.1 and (4.1) together yield 1.006j log C < (logC) 3 log(351j), whence we obtain j log(351j) < (log C). Proposition 4. now follows from j m and C = d.
10 4 Y. FUJITA Proposition 4.3. Suppose that a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e. Then, d < and b < Moreover, if d > , then d > b 5. Proof. We may assume that d > In case a, b, c, d} contains a triple of the first kind, by Lemma 3.5 we have m > d 0.05, which together with Proposition 4. implies that m f(m) := log(351m)(logm) < Hence we have m < It follows that d < m 40 < and b < d 0. < m 8 < In case a, b, c, d} contains a triple of the second or the third kind, m > d 0.19 and Proposition 4. together imply that f(m) < , which yields m < On the other hand, the assumption d > implies that m > d 0.19 > 10 19, which is a contradiction. Therefore, we obtain d < and b < In addition, we have proved that a, b, c, d} cannot contain a triple of either the second or the third kind. Hence a, b, c, d} has to contain a triple of the first kind, which yields d > b 5. Corollary 4.4. Suppose that a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e. Then, l < Proof. If l , then by Lemma.3 we have m , and Proposition 4. implies that m d > exp log(351m) > 10833, which contradicts Proposition 4.3. Corollary 4.5. Let a, b, c} be a Diophantine triple with c = a + b + r, where r = ab + 1. If c > 10 50, then a, b, c} cannot be extended to a Diophantine quintuple. Proof. Suppose that a, b, c, d, e} is a Diophantine quintuple. We may assume that c < d = d + < e by Theorem 1. in [1]. Since c > means d > c > , we see from Proposition 4.3 that d > b 5. On the other hand, since d < 4b c and b 8, we have c > b 3 /4 16b, which contradicts c = a + b + r < 4b. 5. Proof of Theorem 1. Let A, B, C} be a Diophantine triple with A < B < C and let S = AC + 1, T = BC + 1. In this section, we first give an exponential gap principle for the solutions of (5.1) AZ CX = A C, BZ CY = B C,
11 THE NUMBER OF DIOPHANTINE QUINTUPLES 5 using Okazaki s idea (cf. [3, Lemma.]). Then we prove Theorem 1. combining the gap principle with Corollary 4.4. We may express the solutions of (5.1) as Z = V j = W k (j 0, k 0) with some binary recurrent sequences V j } and W k } (cf. Section ). Lemma 5.1. Suppose that V 0 = W 0 = ±1 and that there exist three positive solutions (X i, Y i, Z i ) (1 i 3) of (5.1) with Z 1 < Z < Z 3 that come from the same fundamental solution Z = V 0 = W 0. Put Z i = V ji (1 i 3) with j 1 < j < j 3. Then we have = W ki (5.) where j 3 j > 3 8AC ξj1 log η, ξ = S + AC, η = T + BC, = k k 1 k 3 k j j 1 j 3 j > 0. Proof. The proof proceeds along the same lines as that of Lemma. in [3]. Let ǫ = V 0 = W 0. By Z = V j = W k, we have Z = 1 ( C + ǫ A)ξ j ( C ǫ A)ξ j} A = 1 B whence we can find three points on the curve ( C + ǫ B)η k ( C ǫ B)η k}, (p i, q i ) = (j i log ξ, k i log η) (1 i 3) (5.3) Since F(p, q) =( C + ǫ B)e q ( C ǫ B)e q B ( C + ǫ A)e p ( C ǫ A)e p} = 0. A F q (p, q) = ( C + ǫ B)e q + ( C ǫ B)e q > 0 for all p and q, we may implicitly differentiate (5.3) to obtain (5.4) ( C + ǫ B)e q + ( C ǫ B)e q} dq dp B = ( C + ǫ A)e p + ( C ǫ A)e p}, A
12 6 Y. FUJITA which yields dq ( C + ǫ A)e dp = p ( C ǫ } A)e p + 4(C A) [ A/B ( C + ǫ B)e q ( C ǫ } ] B)e q + 4(C B) (5.5) ( C + ǫ A)e = p ( C ǫ } A)e p + 4(C A) ( C + ǫ A)e p ( C ǫ } > 1. A)e p + 4(AC/B A) Similarly, we may implicitly differentiate (5.4) to obtain ( C + ǫ B)e q + ( C ǫ B)e q} d q dp + ( C + ǫ B)e q ( C ǫ B)e q}( dq dr which yields (5.6) d q dp = 1 = ( C + ǫ B)e q ( C ǫ B)e q, ( ) } dq dp From (5.5) and (5.6) we see that (5.7) ) ( C + ǫ B)e q ( C ǫ B)e q ( C + ǫ B)e q + ( C ǫ < 0. B)e q 0 < q q 1 p p 1 q 3 q p 3 p < q q 1 p p 1 1. On the other hand, we may transform V ji = W ki (i = 1, ) into inequalities for linear forms in three logarithms of algebraic numbers 0 < p i q i + log µ < 8 3 ACξ ji (i = 1, ), where (cf. (4.1)). Hence we have µ = B( C + ǫ A) A( C + ǫ B) 0 < p q + log µ < p 1 q 1 + log µ < 8 3 ACξ j1, which yields (5.8) 0 < (q q 1 ) (p p 1 ) < 8 3 ACξ j1.
13 THE NUMBER OF DIOPHANTINE QUINTUPLES 7 It follows from (5.7) and (5.8) that 0 < q q 1 p p 1 q 3 q p 3 p < (q q 1 ) (p p 1 ) p p 1 < Substituting p i = j i log ξ and q i = k i log η, we have Therefore, we obtain 0 < k k 1 k 3 k 8AC < j j 1 j 3 j 3(j j 1 )ξ j1 log η. 8AC 3(p p 1 )ξ j1. as desired. j 3 j > 3 8AC ξj1 log η, We are now ready to prove Theorem 1.. Proof of Theorem 1.. Suppose that there exist five Diophantine quintuples a, b, c, d, e} (c < d < e) containing the fixed triple a, b, c}. Since d = d + by Theorem 1. in [1], we have five such e s, which yield five positive solutions δ = u li = v mi = w ni (1 i 5) with l 1 < l < l 3 < l 4 < l 5 of the system of Diophantine equations (.1), (.), (.3). Let A, B, C} be a standard triple with A < B < C contained in a, b, c, d} and Z = V j = W k the solutions of (5.1). Then, V 0 = W 0 = ±1 by Lemma. and we have three positive solutions (X i, Y i, Z i ) (1 i 3) of (5.1) that come from the same fundamental solution. Hence, putting Z i = V ji = W ki, we have the gap principle (5.). Since we may assume that C = d, we know that AC ad 6888 and BC bd (cf. Section 1), which together with Lemma.4 imply that ξ j1 AC > ( ad) m 1 1 (ad) 5 > , ad log η > log( bd) > Moreover, since each of l i, m i and n i is even by Lemma., we have 0 (mod 4), which yields 4. It follows from (5.) that l 5 j 3 > > , which contradicts Corollary 4.4. This completes the proof of Theorem 1..
14 8 Y. FUJITA 6. Proof of Theorem 1.3 In this section, we prove Theorem 1.3 along the same lines as Theorem 4 in [9]. Proof of Theorem 1.3. Suppose that a, b, c, d, e} is a Diophantine quintuple with a < b < c < d < e. We know by Proposition 4.3 that d < and b < We first bound the number of the a, b} s. If b 10 10, then the number is at most Assume that < b < By (8) in [9] we have (6.1) log b > 1 ω(b)log ω(b), where ω(b) denotes the number of distinct prime factors of b. If ω(b) b 0.3, then (6.1) implies that ω(b) < 101.6, which yields b < 10 10, a contradiction. Hence we have ω(b) < b 0.3, and the number of corresponding a, b} s is less than the following (see the proof of Theorem 1 in [9]): b= ω(b)+1 < b= b 0.3 < b 0.3 db < Therefore, the number of the a, b} s is less than Secondly, for a fixed a, b} the number c such that a, b, c} is a Diophantine triple belongs to the union of finitely many binary recurrent sequences, and the number of the sequences is less than or equal to the number of solutions of the congruence z0 1 (mod b) with 0.71b0.75 < z 0 < 0.71b 0.75 (cf. [7, Lemma 1]). If b 10 58, then the number of the sequences is < Assume that < b < We see from (6.1) that ω(b) < b 1/3 in the same way as above. Hence, the number of the sequences is less than ω(b)+1 < 4b 1/3 < (cf. [9, Lemma 1]). Moreover, the number of elements contained in each of the sequences is less than log 3 ( ) < 600 (see the proof of Theorem 4 in [9]). Therefore, the number of the c s is less than < Consequently, we see from Theorem 1. that the number of Diophantine quintuples is less than < 10 76, which completes the proof of Theorem 1.3. Acknowledgements. We would like to thank Professor Andrej Dujella and Professor Alan Filipin for pointing out some errors in the original draft of this manuscript. Thanks also go to the referee for the helpful suggestions. References [1] J. Arkin, V. E. Hoggatt and E. G. Strauss, On Euler s solution of a problem of Diophantus, Fibonacci Quart. 17 (1979),
15 THE NUMBER OF DIOPHANTINE QUINTUPLES 9 [] A. Baker and H. Davenport, The equations 3x = y and 8x 7 = z, Quart. J. Math. Oxford Ser. () 0 (1969), [3] M. A. Bennett, M. Cipu, M. Mignotte and R. Okazaki, On the number of solutions of simultaneous Pell equations II, Acta Arith. 1 (006), [4] Y. Bugeaud, A. Dujella and M. Mignotte, On the family of Diophantine triples k 1, k + 1,16k 3 4k}, Glasg. Math. J. 49 (007), [5] A. Dujella, The problem of the extension of a parametric family of Diophantine triples, Publ. Math. Debrecen 51 (1997), [6] A. Dujella, A proof of the Hoggatt-Bergum conjecture, Proc. Amer. Math. Soc. 17 (1999), [7] A. Dujella, An absolute bound for the size of Diophantine m-tuples, J. Number Theory 89 (001), [8] A. Dujella, There are only finitely many Diophantine quintuples, J. Reine Angew. Math. 566 (004), [9] A. Dujella, On the number of Diophantine m-tuples, Ramanujan J. 15 (008), [10] A. Dujella and A. Pethő, A generalization of a theorem of Baker and Davenport, Quart. J. Math. Oxford Ser. () 49 (1998), [11] Y. Fujita, The extensibility of Diophantine pairs k 1, k + 1}, J. Number Theory 18 (008), [1] Y. Fujita, Any Diophantine quintuple contains a regular Diophantine quadruple, J. Number Theory 19 (009), [13] K. S. Kedlaya, Solving constrained Pell equations, Math. Comp. 67 (1998), [14] E. M. Matveev, An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II, Izv. Math. 64 (000), Y. Fujita Department of Mathematics College of Industrial Technology Nihon University Shin-ei, Narashino, Chiba Japan fujita.yasutsugu@nihon-u.ac.jp Received:
On Diophantine quintuples and D( 1)-quadruples
On Diophantine quintuples and D( 1)-quadruples Christian Elsholtz, Alan Filipin and Yasutsugu Fujita September 13, 2013 Abstract In this paper the known upper bound 10 96 for the number of Diophantine
More informationBOUNDS FOR DIOPHANTINE QUINTUPLES. Mihai Cipu and Yasutsugu Fujita IMAR, Romania and Nihon University, Japan
GLASNIK MATEMATIČKI Vol. 5070)2015), 25 34 BOUNDS FOR DIOPHANTINE QUINTUPLES Mihai Cipu and Yasutsugu Fujita IMAR, Romania and Nihon University, Japan Abstract. A set of m positive integers {a 1,...,a
More informationON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS. Zrinka Franušić University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 43(63)(2008), 265 291 ON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS Zrinka Franušić University of Zagreb, Croatia Abstract. In this paper,
More informationDiophantine quadruples and Fibonacci numbers
Diophantine quadruples and Fibonacci numbers Andrej Dujella Department of Mathematics, University of Zagreb, Croatia Abstract A Diophantine m-tuple is a set of m positive integers with the property that
More information1 Diophantine quintuple conjecture
Conjectures and results on the size and number of Diophantine tuples Andrej Dujella Department of Mathematics, University of Zagreb Bijenička cesta 30, 10000 Zagreb, CROATIA E-mail: duje@math.hr URL :
More informationEFFECTIVE SOLUTION OF THE D( 1)-QUADRUPLE CONJECTURE
EFFECTIVE SOLUTION OF THE D( 1)-QUADRUPLE CONJECTURE ANDREJ DUJELLA, ALAN FILIPIN, AND CLEMENS FUCHS Abstract. The D( 1)-quadruple conjecture states that there does not exist a set of four positive integers
More informationDiophantine m-tuples and elliptic curves
Diophantine m-tuples and elliptic curves Andrej Dujella (Zagreb) 1 Introduction Diophantus found four positive rational numbers 1 16, 33 16, 17 4, 105 16 with the property that the product of any two of
More informationSOME DIOPHANTINE TRIPLES AND QUADRUPLES FOR QUADRATIC POLYNOMIALS
SOME DIOPHANTINE TRIPLES AND QUADRUPLES FOR QUADRATIC POLYNOMIALS ANDREJ DUJELLA AND ANA JURASIĆ Abstract. In this paper we give some new examples of polynomial D(n)- triples and quadruples i.e. sets of
More informationDiophantine quintuples containing triples of the first kind
Diophantine quintuples containing triples of the first kind arxiv:1501.04399v2 [math.nt] 26 Feb 2015 D.J. Platt Heilbronn Institute for Mathematical Research University of Bristol, Bristol, UK dave.platt@bris.ac.uk
More informationA Pellian equation with primes and applications to D( 1)-quadruples
A Pellian equation with primes and applications to D( 1)-quadruples Andrej Dujella 1, Mirela Jukić Bokun 2 and Ivan Soldo 2, 1 Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička
More informationDIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS
Periodica Mathematica Hungarica Vol. 45 (1 2), 2002, pp. 21 33 DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS Andrej Dujella (Zagreb), Clemens Fuchs (Graz) and Robert F. Tichy (Graz) [Communicated by: Attila
More informationThe problem of Diophantus and Davenport
Mathematical Communications 2(1997), 153 160 153 The problem of Diophantus and Davenport Andrej Dujella Abstract. In this paper we describe the author s results concerning the problem of the existence
More informationTHE PROBLEM OF DIOPHANTUS FOR INTEGERS OF. Zrinka Franušić and Ivan Soldo
THE PROBLEM OF DIOPHANTUS FOR INTEGERS OF Q( ) Zrinka Franušić and Ivan Soldo Abstract. We solve the problem of Diophantus for integers of the quadratic field Q( ) by finding a D()-quadruple in Z[( + )/]
More informationBILGE PEKER, ANDREJ DUJELLA, AND SELIN (INAG) CENBERCI
THE NON-EXTENSIBILITY OF D( 2k + 1)-TRIPLES {1, k 2, k 2 + 2k 1} BILGE PEKER, ANDREJ DUJELLA, AND SELIN (INAG) CENBERCI Abstract. In this paper we prove that for an integer k such that k 2, the D( 2k +
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 informationADJUGATES OF DIOPHANTINE QUADRUPLES. Philip Gibbs Langdon Hills, Essex, UK
#A15 INTEGERS 10 (2010), 201-209 ADJUGATES OF DIOPHANTINE QUADRUPLES Philip Gibbs Langdon Hills, Essex, UK Received: 7/26/09, Revised: 12/26/09, Accepted: 12/30/09, Published: 5/5/10 Abstract Diophantine
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 informationON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS
ON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS ANDREJ DUJELLA AND ZRINKA FRANUŠIĆ Abstract. It this paper, we study the problem of determining the elements in the rings of integers of quadratic
More informationTHE PROBLEM OF DIOPHANTUS AND DAVENPORT FOR GAUSSIAN INTEGERS. Andrej Dujella, Zagreb, Croatia
THE PROBLEM OF DIOPHANTUS AND DAVENPORT FOR GAUSSIAN INTEGERS Andrej Dujella, Zagreb, Croatia Abstract: A set of Gaussian integers is said to have the property D(z) if the product of its any two distinct
More informationTHE PROBLEM OF DIOPHANTUS FOR INTEGERS OF Q( 3) Zrinka Franušić and Ivan Soldo
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 8 = 59 (04): 5-5 THE PROBLEM OF DIOPHANTUS FOR INTEGERS OF Q( ) Zrinka Franušić and Ivan Soldo Abstract. We solve the problem of Diophantus for integers of the quadratic
More informationD( 1)-QUADRUPLES AND PRODUCTS OF TWO PRIMES. Anitha Srinivasan Saint Louis University-Madrid campus, Spain
GLASNIK MATEMATIČKI Vol. 50(70)(2015), 261 268 D( 1)-QUADRUPLES AND PRODUCTS OF TWO PRIMES Anitha Srinivasan Saint Louis University-Madrid campus, Spain Abstract. A D( 1)-quadruple is a set of positive
More informationarxiv: v2 [math.nt] 26 Mar 2018
THERE IS NO DIOPHANTINE QUINTUPLE arxiv:1610.0400v [math.nt] 6 Mar 018 BO HE, ALAIN TOGBÉ, AND VOLKER ZIEGLER Abstract. A set of m positive integers {a 1,a,...,a m} is called a Diophantine m-tuple if a
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 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 Diophantine m-tuples and D(n)-sets
On Diophantine m-tuples and D(n)-sets Nikola Adžaga, Andrej Dujella, Dijana Kreso and Petra Tadić Abstract For a nonzero integer n, a set of distinct nonzero integers {a 1, a 2,..., a m } such that a i
More informationarxiv: v1 [math.nt] 13 Apr 2019
ON THE LARGEST ELEMENT IN D(n-QUADRUPLES ANDREJ DUJELLA AND VINKO PETRIČEVIĆ arxiv:1904.06532v1 [math.nt] 13 Apr 2019 Abstract. Let n be a nonzero integer. A set of nonzero integers {a 1,...,a m} such
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 informationFINITENESS RESULTS FOR F -DIOPHANTINE SETS
FINITENESS RESULTS FOR F -DIOPHANTINE SETS ATTILA BÉRCZES, ANDREJ DUJELLA, LAJOS HAJDU, AND SZABOLCS TENGELY Abstract. Diophantine sets, i.e. sets of positive integers A with the property that the product
More informationOn Strong Rational Diophantine Quadruples with Equal Members
Gopalan MA et al.; Sch. J. Phys. Math. Stat. 0; Vol-; Issue-(Sep-Nov); pp-88-9 Scholars Journal of Physics Mathematics and Statistics Sch. J. Phys. Math. Stat. 0; ():88-9 Scholars Academic and Scientific
More informationOn the Rank of the Elliptic Curve y 2 = x 3 nx
International Journal of Algebra, Vol. 6, 2012, no. 18, 885-901 On the Rank of the Elliptic Curve y 2 = x 3 nx Yasutsugu Fujita College of Industrial Technology, Nihon University 2-11-1 Shin-ei, Narashino,
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 informationON THE SIZE OF DIOPHANTINE M -TUPLES FOR LINEAR POLYNOMIALS
Miskolc Mathematical Notes HU e-issn 1787-2413 Vol. 17 (2017), No. 2, pp. 861 876 DOI: 10.18514/MMN.2017. ON THE SIZE OF DIOPHANTINE M -TUPLES FOR LINEAR POLYNOMIALS A. FILIPIN AND A. JURASIĆ Received
More informationDIOPHANTINE QUADRUPLES IN Z[ 2]
An. Şt. Univ. Ovidius Constanţa Vol. 18(1), 2010, 81 98 DIOPHANTINE QUADRUPLES IN Z[ 2] Andrej Dujella, Ivan Soldo Abstract In this paper, we study the existence of Diophantine quadruples with the property
More informationON DIOPHANTINE QUADRUPLES OF FIBONACCI NUMBERS
GLASNIK MATEMATIČKI Vol. 52(72)(2017), 221 234 ON DIOPHANTINE QUADRUPLES OF FIBONACCI NUMBERS Yasutsugu Fujita and Florian Luca Nihon University, Japan and University of the Witwatersrand, South Africa
More informationInteger partitions into Diophantine pairs
Availaible on line at http://www.liforce.usthb.dz bulletin-liforce@usthb.dz Bulletin du Laboratoire 04 (015) 8-35 Integer partitions into Diophantine pairs Zahra YAHI 1, Nesrine BENYAHIA TANI, Sadek BOUROUBI
More informationTRIBONACCI DIOPHANTINE QUADRUPLES
GLASNIK MATEMATIČKI Vol. 50(70)(205), 7 24 TRIBONACCI DIOPHANTINE QUADRUPLES Carlos Alexis Gómez Ruiz and Florian Luca Universidad del Valle, Colombia and University of the Witwatersrand, South Africa
More informationExplicit solution of a class of quartic Thue equations
ACTA ARITHMETICA LXIV.3 (1993) Explicit solution of a class of quartic Thue equations by Nikos Tzanakis (Iraklion) 1. Introduction. In this paper we deal with the efficient solution of a certain interesting
More informationPELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES. Nurettin Irmak and Murat Alp
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 100114 016, 59 69 DOI: 10.98/PIM161459I PELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES Nurettin Irmak and Murat Alp Abstract. We introduce a novel
More informationOn the prime divisors of elements of a D( 1) quadruple
arxiv:1309.4347v1 [math.nt] 17 Sep 2013 On the prime divisors of elements of a D( 1) quadruple Anitha Srinivasan Abstract In [4] it was shown that if {1,b,c,d} is a D( 1) quadruple with b < c < d and b
More informationDiophantine equations for second order recursive sequences of polynomials
Diophantine equations for second order recursive sequences of polynomials Andrej Dujella (Zagreb) and Robert F. Tichy (Graz) Abstract Let B be a nonzero integer. Let define the sequence of polynomials
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 informationOn a diophantine equation of Andrej Dujella
On a diophantine equation of Andrej Dujella Keith Matthews (joint work with John Robertson and Jim White published in Math. Glasnik, 48, number 2 (2013) 265-289.) The unicity conjecture (Dujella 2009)
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 informationA Survey of Rational Diophantine Sextuples of Low Height
A Survey of Rational Diophantine Sextuples of Low Height Philip E Gibbs philegibbs@gmail.com A rational Diophantine m-tuple is a set of m distinct positive rational numbers such that the product of any
More informationarxiv: v1 [math.nt] 29 Dec 2017
arxiv:1712.10138v1 [math.nt] 29 Dec 2017 On the Diophantine equation F n F m = 2 a Zafer Şiar a and Refik Keskin b a Bingöl University, Mathematics Department, Bingöl/TURKEY b Sakarya University, Mathematics
More informationarxiv: v4 [math.nt] 3 Jul 2017
PRIME POWERS IN SUMS OF TERMS OF BINARY RECURRENCE SEQUENCES arxiv:161002774v4 [mathnt] 3 Jul 2017 ESHITA MAZUMDAR AND S S ROUT Abstract Let {u n } n 0 be a non-degeneratebinaryrecurrencesequence with
More informationBOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia
GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive
More informationPure Mathematical Sciences, Vol. 6, 2017, no. 1, HIKARI Ltd,
Pure Mathematical Sciences, Vol. 6, 2017, no. 1, 61-66 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/pms.2017.735 On Some P 2 Sets Selin (Inag) Cenberci and Bilge Peker Mathematics Education Programme
More informationON THE REPRESENTATION OF FIBONACCI AND LUCAS NUMBERS IN AN INTEGER BASES
ON THE REPRESENTATION OF FIBONACCI AND LUCAS NUMBERS IN AN INTEGER BASES YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE À Paulo Ribenboim, pour son quatre-vingtième anniversaire Abstract. Résumé. Nous
More informationA NOTE ON THE SIMULTANEOUS PELL EQUATIONS x 2 ay 2 = 1 AND z 2 by 2 = 1. Maohua Le Zhanjiang Normal College, P.R. China
GLASNIK MATEMATIČKI Vol. 47(67)(2012), 53 59 A NOTE ON THE SIMULTANEOUS PELL EQUATIONS x 2 ay 2 = 1 AND z 2 by 2 = 1 Maohua Le Zhanjiang Normal College, P.R. China Abstract. Let m,n be positive integers
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 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 informationPOWER VALUES OF SUMS OF PRODUCTS OF CONSECUTIVE INTEGERS. 1. Introduction. (x + j).
POWER VALUES OF SUMS OF PRODUCTS OF CONSECUTIVE INTEGERS L. HAJDU, S. LAISHRAM, SZ. TENGELY Abstract. We investigate power values of sums of products of consecutive integers. We give general finiteness
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 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 informationOn a special case of the Diophantine equation ax 2 + bx + c = dy n
Sciencia Acta Xaveriana Vol. 2 No. 1 An International Science Journal pp. 59 71 ISSN. 0976-1152 March 2011 On a special case of the Diophantine equation ax 2 + bx + c = dy n Lionel Bapoungué Université
More informationPower values of sums of products of consecutive integers
isid/ms/2015/15 October 12, 2015 http://www.isid.ac.in/ statmath/index.php?module=preprint Power values of sums of products of consecutive integers L. Hajdu, S. Laishram and Sz. Tengely Indian Statistical
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 informationOn the Number of Divisors of n 2 1
On the Number of Divisors of n 2 arxiv:507.08893v [math.nt] 30 Jul 205 Adrian W. Dudek Mathematical Sciences Institute The Australian National University adrian.dudek@anu.edu.au Abstract We prove an asymptotic
More informationINTEGRAL POINTS AND ARITHMETIC PROGRESSIONS ON HESSIAN CURVES AND HUFF CURVES
INTEGRAL POINTS AND ARITHMETIC PROGRESSIONS ON HESSIAN CURVES AND HUFF CURVES SZ. TENGELY Abstract. In this paper we provide bounds for the size of the integral points on Hessian curves H d : x 3 + y 3
More informationRoot separation for irreducible integer polynomials
Root separation for irreducible integer polynomials Yann Bugeaud and Andrej Dujella 1 Introduction The height H(P ) of an integer polynomial P (x) is the maximum of the absolute values of its coefficients.
More informationDetermining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields
Determining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields István Gaál, University of Debrecen, Mathematical Institute H 4010 Debrecen Pf.12., Hungary
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 informationDecomposition of a recursive family of polynomials
Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af
More informationRoot separation for irreducible integer polynomials
Root separation for irreducible integer polynomials Yann Bugeaud and Andrej Dujella Abstract We establish new results on root separation of integer, irreducible polynomials of degree at least four. These
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 informationResults and open problems related to Schmidt s Subspace Theorem. Jan-Hendrik Evertse
Results and open problems related to Schmidt s Subspace Theorem Jan-Hendrik Evertse Universiteit Leiden 29 ièmes Journées Arithmétiques July 6, 2015, Debrecen Slides can be downloaded from http://pub.math.leidenuniv.nl/
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 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 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 informationOn a Generalization of the Coin Exchange Problem for Three Variables
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 9 (006), Article 06.4.6 On a Generalization of the Coin Exchange Problem for Three Variables Amitabha Tripathi Department of Mathematics Indian Institute
More informationAlmost perfect powers in consecutive integers (II)
Indag. Mathem., N.S., 19 (4), 649 658 December, 2008 Almost perfect powers in consecutive integers (II) by N. Saradha and T.N. Shorey School of Mathematics, Tata Institute of Fundamental Research, Homi
More informationFifteen problems in number theory
Acta Univ. Sapientiae, Mathematica, 2, 1 (2010) 72 83 Fifteen problems in number theory Attila Pethő University of Debrecen Department of Computer Science and Number Theory Research Group Hungarian Academy
More informationON A THEOREM OF TARTAKOWSKY
ON A THEOREM OF TARTAKOWSKY MICHAEL A. BENNETT Dedicated to the memory of Béla Brindza Abstract. Binomial Thue equations of the shape Aa n Bb n = 1 possess, for A and B positive integers and n 3, at most
More informationOn a Diophantine Equation 1
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 2, 73-81 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.728 On a Diophantine Equation 1 Xin Zhang Department
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 informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More informationCollatz cycles with few descents
ACTA ARITHMETICA XCII.2 (2000) Collatz cycles with few descents by T. Brox (Stuttgart) 1. Introduction. Let T : Z Z be the function defined by T (x) = x/2 if x is even, T (x) = (3x + 1)/2 if x is odd.
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 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 informationA note on the products of the terms of linear recurrences
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae, 24 (1997) pp 47 53 A note on the products of the terms of linear recurrences LÁSZLÓ SZALAY Abstract For an integer ν>1 let G (i) (,,ν) be linear
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 informationPower values of polynomials and binomial Thue Mahler equations
Publ. Math. Debrecen 65/3-4 (2004), 341 362 Power values of polynomials and binomial Thue Mahler equations By K. GYŐRY (Debrecen), I. PINK (Debrecen) and A. PINTÉR (Debrecen) To the memory of Professors
More informationBounds for counterexamples to Terai s conjecture
Bull. Math. Soc. Sci. Math. Roumanie Tome 53(101) No. 3, 2010, 231 237 Bounds for counterexamples to Terai s conjecture by Mihai Cipu and Maurice Mignotte Dedicated to the memory of Laurenţiu Panaitopol
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 informationCitation 数理解析研究所講究録 (2017), 2014:
Title A wishlist for Diophantine quintupl Theory and Related Areas) Author(s) Trudgian Tim Citation 数理解析研究所講究録 (2017) 2014: 124-131 Issue Date 2017-01 URL http://hdlhandlenet/2433/231658 Right Type Departmental
More informationIRREDUCIBILITY CRITERIA FOR SUMS OF TWO RELATIVELY PRIME POLYNOMIALS
IRREDUCIBILITY CRITERIA FOR SUMS OF TWO RELATIVELY PRIME POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE Abstract. We provide irreducibility conditions for polynomials
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse December 11, 2007 8 Approximation of algebraic numbers Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer
More informationARTIN S CONJECTURE AND SYSTEMS OF DIAGONAL EQUATIONS
ARTIN S CONJECTURE AND SYSTEMS OF DIAGONAL EQUATIONS TREVOR D. WOOLEY Abstract. We show that Artin s conjecture concerning p-adic solubility of Diophantine equations fails for infinitely many systems of
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 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 informationNUMBER OF REPRESENTATIONS OF INTEGERS BY BINARY FORMS
NUMBER O REPRESENTATIONS O INTEGERS BY BINARY ORMS DIVYUM SHARMA AND N SARADHA Abstract We give improved upper bounds for the number of solutions of the Thue equation (x, y) = h where is an irreducible
More informationOn the resolution of simultaneous Pell equations
Annales Mathematicae et Informaticae 34 (2007) pp. 77 87 http://www.ektf.hu/tanszek/matematika/ami On the resolution of simultaneous Pell equations László Szalay Institute of Mathematics and Statistics,
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 informationDIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS
PORTUGALIAE MATHEMATICA Vol. 52 Fasc. 3 1995 DIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS Andrej Dujella Abstract: Let n be an integer. A set of positive integers is said to have the
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 informationSome examples of two-dimensional regular rings
Bull. Math. Soc. Sci. Math. Roumanie Tome 57(105) No. 3, 2014, 271 277 Some examples of two-dimensional regular rings by 1 Tiberiu Dumitrescu and 2 Cristodor Ionescu Abstract Let B be a ring and A = B[X,
More informationPerfect powers with few binary digits and related Diophantine problems
Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) Vol. XII (2013), 941-953 Perfect powers with few binary digits and related Diophantine problems MICHAEL A. BENNETT, YANN BUGEAUD AND MAURICE MIGNOTTE Abstract. We
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 Diophantine equation x n = Dy 2 + 1
ACTA ARITHMETICA 106.1 (2003) The Diophantine equation x n Dy 2 + 1 by J. H. E. Cohn (London) 1. Introduction. In [4] the complete set of positive integer solutions to the equation of the title is described
More information