Results 291 to 300 of about 10,580,440 (338)
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
semanticscholar +3 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
semanticscholar +3 more sources
On the sum of a Lucas number and a prime
Periodica Mathematica HungaricaRui-Jing Wang
openalex +2 more sources
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 ...
Hadiseh Tajbakhsh, Ali Reza Moghaddamfar
openaire +2 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
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
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
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
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
SOME PROPERTIES OF THE PRODUCT OF (P,Q) – FIBONACCI AND (P,Q) - LUCAS NUMBER
, 2017: Some mathematicians study the basic concept of the generalized Fibonacci sequence and Lucas sequence which are the (p,q) – Fibonacci sequence and the (p,q) – Lucas sequence.
A. Suvarnamani
semanticscholar +1 more source
A Combinatorial Interpretation of the Square of a Lucas Number
The Fibonacci quarterly, 1991The 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
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