On the greatest prime factor of (ab + 1)(bc + 1)(ca + 1)

• Autorzy: Yann Bugeaud
• Języki publikacji: EN

Kategorie tematyczne

• 11N25: Distribution of integers with specified multiplicative constraints
• 11D61: Exponential equations

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Acta Arithmetica
• Rocznik: 1998
• Tom: 86
• Numer: 1
• Strony: 45-49

Daty

wydano

1998

otrzymano

1997-09-23

poprawiono

1998-03-10

Twórcy

autor

Yann Bugeaud

• Université Louis Pasteur, U.F.R. de mathématiques, 7, rue René Descartes, 67084 Strasbourg, France

Bibliografia

• [1] B. Brindza, Thue equations and multiplicative independence, in: Number Theory and Cryptography (Sydney, 1989), London Math. Soc. Lecture Note Ser. 154, Cambridge Univ. Press, Cambridge, 1990, 213-220.
• [2] B. Brindza and K. Győry, On unit equations with rational coefficients, Acta Arith. 53 (1990), 367-388.
• [3] K. Győry and A. Sárközy, On prime factors of integers of the form (ab+1)(bc+1)×(ca+1), Acta Arith. 79 (1997), 163-171.
• [4] K. Győry, A. Sárközy and C. L. Stewart, On the number of prime factors of integers of the form ab+1, Acta Arith. 74 (1996), 365-385.
• [5] J. H. Loxton, Some problems involving powers of integers, Acta Arith. 46 (1986), 113-123.
• [6] A. Schinzel, On two theorems of Gelfond and some of their applications, Acta Arith. 13 (1967), 177-236.
• [7] C. L. Stewart and R. Tijdeman, On the greatest prime factor of (ab+1)(ac+1)×(bc+1), Acta Arith. 79 (1997), 93-101.