The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 61 – 80 of 441

Showing per page

Bartz-Marlewski equation with generalized Lucas components

Hayder R. Hashim (2022)

Archivum Mathematicum

Let { U n } = { U n ( P , Q ) } and { V n } = { V n ( P , Q ) } be the Lucas sequences of the first and second kind respectively at the parameters P 1 and Q { - 1 , 1 } . In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation x 2 - 3 x y + y 2 + x = 0 , where ( x , y ) = ( U i , U j ) or ( V i , V j ) with i , j 1 . Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

Binomials transformation formulae for scaled Fibonacci numbers

Edyta Hetmaniok, Bożena Piątek, Roman Wituła (2017)

Open Mathematics

The aim of the paper is to present the binomial transformation formulae of Fibonacci numbers scaled by complex multipliers. Many of these new and nontrivial relations follow from the fundamental properties of the so-called delta-Fibonacci numbers defined by Wituła and Słota. The paper contains some original relations connecting the values of delta-Fibonacci numbers with the respective values of Chebyshev polynomials of the first and second kind.

Bounds for frequencies of residues of second-order recurrences modulo p r

Walter Carlip, Lawrence Somer (2007)

Mathematica Bohemica

The authors examine the frequency distribution of second-order recurrence sequences that are not p -regular, for an odd prime p , and apply their results to compute bounds for the frequencies of p -singular elements of p -regular second-order recurrences modulo powers of the prime p . The authors’ results have application to the p -stability of second-order recurrence sequences.

Can a Lucas number be a sum of three repdigits?

Chèfiath A. Adegbindin, Alain Togbé (2020)

Commentationes Mathematicae Universitatis Carolinae

We give the answer to the question in the title by proving that L 18 = 5778 = 5555 + 222 + 1 is the largest Lucas number expressible as a sum of exactly three repdigits. Therefore, there are many Lucas numbers which are sums of three repdigits.

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

Roman Wituła, Damian Słota (2006)

Open Mathematics

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x 2n + y 2n , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.

Circulants and the factorization of the Fibonacci–like numbers

Jaroslav Seibert, Pavel Trojovský (2006)

Acta Mathematica Universitatis Ostraviensis

Several authors gave various factorizations of the Fibonacci and Lucas numbers. The relations are derived with the help of connections between determinants of tridiagonal matrices and the Fibonacci and Lucas numbers using the Chebyshev polynomials. In this paper some results on factorizations of the Fibonacci–like numbers U n and their squares are given. We find the factorizations using the circulant matrices, their determinants and eigenvalues.

Currently displaying 61 – 80 of 441