Results 271 to 280 of about 10,192,155 (339)

On the sum of a Lucas number and a prime

open access: closedPeriodica Mathematica Hungarica
Rui-Jing Wang
openalex   +2 more sources

Fibonacci and Lucas numbers as products of three repdgits in base g

Rendiconti del Circolo Matematico di Palermo Series 2, 2022
Recall that a repdigit in base g is a positive integer that has only one digit in its base g expansion; i.e., a number of the form $$a(g^m-1)/(g-1)$$ a ( g m - 1 ) / ( g - 1 ) , for some positive integers $$m\ge 1$$ m ≥ 1 , $$g\ge 2$$ g ≥ 2 and $$1\le a ...
K. N. Adédji, A. Filipin, A. Togbé
semanticscholar   +1 more source

On quaternion‐Gaussian Lucas numbers

Mathematical Methods in the Applied Sciences, 2020
In this study, we have considered Gaussian Lucas numbers and given the properties of these numbers. Then, we have defined the quaternions that accept these numbers as coefficients. We have examined whether the numbers defined provide some identities for quaternions in the literature.
openaire   +2 more sources

Lucas Numbers and Determinants

Integers, 2012
Abstract.In this article, we present two infinite dimensional matrices whose entries are recursively defined, and show that the sequence of their principal minors form the Lucas sequence, that ...
Hadiseh Tajbakhsh, Ali Reza Moghaddamfar
openaire   +2 more sources

A Combinatorial Interpretation of the Square of a Lucas Number

The Fibonacci quarterly, 1991
The Fibonacci numbers have a well-known combinatorial interpretation in terms of the total number of subsets of {1, 2, 3, . .., n} not containing a pair of consecutive integers.
John Konvalina, Yi-Hsin Liu
semanticscholar   +1 more source

Fibonacci and Lucas Numbers

2021
In the literature, the Fibonacci numbers are usually denoted by \(F_n\), but this symbol is already reserved for the Fermat numbers in this book. So we will denote them by \(K_n\). The sequence of Fibonacci numbers \(\,\,(K_n)_{n=0}^\infty \,\,\) starts with \(K_0=0\) and \(K_1=1\) and satisfies the recurrence.
Michal Křížek   +2 more
openaire   +2 more sources

A Lucas Number Counting Problem

The Fibonacci quarterly, 1972
(reduced mod 7, r e p r e s e n t i n g 0 a s 7) 5 show that t h e r e a r e 31 different s e t s , f o r m e d by choosing exactly one e l e m e n t from e a c h o r i g i n a l s e t and i n-cluding each n u m b e r from 1 to 7 exactly once.
Beverly Ross
semanticscholar   +1 more source

New recurrences on Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, and Jacobsthal-Lucas numbers

Chaos, Solitons & Fractals, 2021
Abstract In this study, the Pell numbers are placed clockwise on the vertices of the polygons with a number corresponding to each vertex. Then, a relation among the numbers corresponding to a vertex is given. Furthermore, we obtain a formula which gives the mth term of the sequence formed at the kth vertex in an n-gon. The same procedure is repeated
Songül Çelik   +2 more
openaire   +2 more sources

Bi-univalent Function Subfamilies Defined by q - Analogue of Bessel Functions Subordinate to (p, q) - Lucas Polynomials

WSEAS Transactions on Mathematics, 2022
In the theory of bi-univalent functions,variety of special polynomials and special functions have been used. Using the q - analogue of Bessel functions, two families of regular and bi-univalent functions subordinate to (p, q) - Lucas Polynomials are ...
S. R. Swamy, A. Lupaș
semanticscholar   +1 more source

Optimization by k-Lucas numbers

Applied Mathematics and Computation, 2008
This article presents a mathematical analysis of Fibonacci search method by k-Lucas numbers. In this study, we develop a new algorithm which determines the maximum point of unimodal functions on closed intervals. As a result, it makes Fibonacci search method more effective.
ÖMÜR, NEŞE   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy