Page 1 Next

Displaying 1 – 20 of 50

Showing per page

Padovan and Perrin numbers as products of two generalized Lucas numbers

Kouèssi Norbert Adédji, Japhet Odjoumani, Alain Togbé (2023)

Archivum Mathematicum

Let P m and E m be the m -th Padovan and Perrin numbers respectively. Let r , s be non-zero integers with r 1 and s { - 1 , 1 } , let { U n } n 0 be the generalized Lucas sequence given by U n + 2 = r U n + 1 + s U n , with U 0 = 0 and U 1 = 1 . In this paper, we give effective bounds for the solutions of the following Diophantine equations P m = U n U k and E m = U n U k , where m , n and k are non-negative integers. Then, we explicitly solve the above Diophantine equations for the Fibonacci, Pell and balancing sequences.

Palindromic continued fractions

Boris Adamczewski, Yann Bugeaud (2007)

Annales de l’institut Fourier

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of continued fraction expansions, including expansions with unbounded partial quotients. Their proofs heavily depend on the Schmidt Subspace Theorem.

Palindromic powers.

Hernández, Santos Hernández, Luca, Florian (2006)

Revista Colombiana de Matemáticas

Perfect powers in the summatory function of the power tower

Florian Luca, Diego Marques (2010)

Journal de Théorie des Nombres de Bordeaux

Let ( a n ) n 1 be the sequence given by a 1 = 1 and a n = n a n - 1 for n 2 . In this paper, we show that the only solution of the equation a 1 + + a n = m l is in positive integers l > 1 , m and n is m = n = 1 .

Periodic Jacobi-Perron expansions associated with a unit

Brigitte Adam, Georges Rhin (2011)

Journal de Théorie des Nombres de Bordeaux

We prove that, for any unit ϵ in a real number field K of degree n + 1 , there exits only a finite number of n-tuples in  K n which have a purely periodic expansion by the Jacobi-Perron algorithm. This generalizes the case of continued fractions for n = 1 . For n = 2 we give an explicit algorithm to compute all these pairs.

Currently displaying 1 – 20 of 50

Page 1 Next