Page 1 Next

Displaying 1 – 20 of 109

Showing per page

A note on the diophantine equation k 2 - 1 = q n + 1

Maohua Le (1998)

Colloquium Mathematicae

In this note we prove that the equation k 2 - 1 = q n + 1 , q 2 , n 3 , has only finitely many positive integer solutions ( k , q , n ) . Moreover, all solutions ( k , q , n ) satisfy k 10 10 182 , q 10 10 165 and n 2 · 10 17 .

Almost powers in the Lucas sequence

Yann Bugeaud, Florian Luca, Maurice Mignotte, Samir Siksek (2008)

Journal de Théorie des Nombres de Bordeaux

The famous problem of determining all perfect powers in the Fibonacci sequence ( F n ) n 0 and in the Lucas sequence ( L n ) n 0 has recently been resolved [10]. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations L n = q a y p , with a > 0 and p 2 , for all primes q < 1087 and indeed for all but 13 primes q < 10 6 . Here the strategy of [10] is not sufficient due to the sizes of...

An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers

Carlos Alexis Gómez Ruiz, Florian Luca (2014)

Colloquium Mathematicae

A generalization of the well-known Fibonacci sequence F n 0 given by F₀ = 0, F₁ = 1 and F n + 2 = F n + 1 + F for all n ≥ 0 is the k-generalized Fibonacci sequence F ( k ) n - ( k - 2 ) whose first k terms are 0,..., 0, 1 and each term afterwards is the sum of the preceding k terms. For the Fibonacci sequence the formula F ² + F ² n + 1 ² = F 2 n + 1 holds for all n ≥ 0. In this paper, we show that there is no integer x ≥ 2 such that the sum of the xth powers of two consecutive k-generalized Fibonacci numbers is again a k-generalized Fibonacci number. This generalizes...

Arithmetic properties of positive integers with fixed digit sum.

Florian Luca (2006)

Revista Matemática Iberoamericana

In this paper, we look at various arithmetic properties of the set of those positive integers n whose sum of digits in a fixed base b > 1 is a fixed positive integer s. For example, we prove that such integers can have many prime factors, that they are not very smooth, and that most such integers have a large prime factor dividing the value of their Euler φ function.

Catalan’s conjecture

Yuri F. Bilu (2002/2003)

Séminaire Bourbaki

The subject of the talk is the recent work of Mihăilescu, who proved that the equation x p - y q = 1 has no solutions in non-zero integers x , y and odd primes p , q . Together with the results of Lebesgue (1850) and Ko Chao (1865) this implies the celebratedconjecture of Catalan (1843): the only solution to x u - y v = 1 in integers x , y > 0 and u , v > 1 is 3 2 - 2 3 = 1 . Before the work of Mihăilescu the most definitive result on Catalan’s problem was due to Tijdeman (1976), who proved that the solutions of Catalan’s equation are bounded by an absolute...

Commutative algebraic groups and p-adic linear forms

Clemens Fuchs, Duc Hiep Pham (2015)

Acta Arithmetica

Let G be a commutative algebraic group defined over a number field K that is disjoint over K from a and satisfies the condition of semistability. Consider a linear form l on the Lie algebra of G with algebraic coefficients and an algebraic point u in a p-adic neighbourhood of the origin with the condition that l does not vanish at u. We give a lower bound for the p-adic absolute value of l(u) which depends up to an effectively computable constant only on the height of the linear form, the height...

Currently displaying 1 – 20 of 109

Page 1 Next