Results 301 to 310 of about 10,580,440 (338)
Some of the next articles are maybe not open access.
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
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
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, 2008This 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
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
Power sums of Fibonacci and Lucas numbers
Quaestiones Mathematicae, 2011Polynomial representation formulae for power sums of the extended Fibonacci-Lucas numbers are established, which include, as special cases, four for-mulae for odd power sums of Melham type on Fibonacci and Lucas numbers, obtained recently by Ozeki and Prodinger (2009).Quaestiones Mathematicae 34(2011), 75 ...
CHU, Wenchang, LI N. N.
openaire +4 more sources
Pentanacci and Pentanacci-Lucas hybrid numbers
Journal of Discrete Mathematical Sciences and Cryptography, 2021The aim of this study is to introduce the Pentanacci and Pentanacci-Lucas hybrid numbers. Then, some properties with respect to these special numbers and relations between them are obtained. In addition, matrix formulations, generating functions, Binet-like formulas and some summation formulas of them are examined.
Isbilir, Zehra, Gurses, Nurten
openaire +4 more sources
1997
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +2 more sources
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +2 more sources
Fibonacci numbers as mixed concatenations of Fibonacci and Lucas numbers
Mathematica SlovacaLet (Fn)n≥0 and (Ln)n≥0 be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers.
A. Altassan, Murat Alan
semanticscholar +1 more source
1991
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence $$ {u_n} + 2 = {u_{n + 1}} + {u_{{n^,}}}{u_0} = 0, {u_1} = 1 $$ are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2].
openaire +2 more sources
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence $$ {u_n} + 2 = {u_{n + 1}} + {u_{{n^,}}}{u_0} = 0, {u_1} = 1 $$ are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2].
openaire +2 more sources
Data hiding in virtual bit-plane using efficient Lucas number sequences
Multimedia tools and applications, 2020B. Datta, Koushik Dutta, S. Roy
semanticscholar +1 more source