Results 281 to 290 of about 10,886,718 (351)
Some of the next articles are maybe not open access.
Journal of Philosophical Logic, 1982
Discussion de l'argumentation de J. R. Lucas suivant laquelle les etres humains ne peuvent etre des machines ("Minds, Machines and Godel", Philosophy, 36, 1961, p. 120-124). L'A. montre que l'argument de Lucas suivant lequel il n'est pas une machine repose sur une premisse erronee: suivant l'A., Lucas est donc lui-meme une machine.
G. Bowie
openaire +2 more sources
Discussion de l'argumentation de J. R. Lucas suivant laquelle les etres humains ne peuvent etre des machines ("Minds, Machines and Godel", Philosophy, 36, 1961, p. 120-124). L'A. montre que l'argument de Lucas suivant lequel il n'est pas une machine repose sur une premisse erronee: suivant l'A., Lucas est donc lui-meme une machine.
G. Bowie
openaire +2 more sources
Chaos, Solitons & Fractals, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Songül Çelik +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Songül Çelik +2 more
openaire +1 more source
Lucas Numbers and Determinants
Integers, 2012Abstract.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 ...
Moghaddamfar, Alireza +1 more
openaire +2 more sources
A Combinatorial Interpretation of the Square of a Lucas Number
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
openalex +2 more sources
Optimization by k-Lucas numbers
Applied Mathematics and Computation, 2008The well-known Fibonacci search method to find the maximum point of unimodal functions on closed intervals is modified by using \(k\)-Lucas numbers. This makes the Fibonacci search method more effective and improves an earlier algorithm by \textit{B. Yildiz} and \textit{E. Karaduman} [Appl. Math. Comput. 143, No. 2--3, 523--551 (2003; Zbl 1041.11013)].
ÖMÜR, NEŞE +2 more
openaire +3 more sources
On quaternion‐Gaussian Lucas numbers
Mathematical Methods in the Applied Sciences, 2020In 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
Fibonacci and Lucas numbers as products of three repdgits in base g
Rendiconti del Circolo Matematico di Palermo Series 2, 2022Recall 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
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 +1 more source
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 +1 more source
Neutrosophic Number Sequences: An introductory Study
International journal of neutrosophic science, 2023In this paper, Neutrosophic definitions and properties of some special number sequences which are frequently found in the science literature, called Neutrosophic Number Sequences (NNSq) via Horadam sequence are studied for the first time.
Hasan G� .. +2 more
semanticscholar +1 more source
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
openaire +2 more sources

