Results 51 to 60 of about 30,407 (243)
On Mixed Concatenations of Fibonacci and Lucas Numbers Which are Fibonacci Numbers
, 2022 Let $(F_n)_{n\geq 0}$ and $(L_n)_{n\geq 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. By mixed concatenations of $ a $ and $ b $, we mean the both concatenations $\overline{ab}$ and $\overline{ba}$ together, where $ a $ and $ b $
Altassan, Alaa, Alan, Murat
openaire +2 more sources
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, EarlyView.ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Analysis of a Nature-Inspired Shape for a Vertical Axis Wind Turbine
Applied Sciences, 2022 Wind energy is gaining special interest worldwide due to the necessity of reducing pollutant emissions and employ renewable resources. Traditionally, horizontal axis wind turbines have been employed but certain situations require vertical axis wind ...
Javier Blanco Damota +5 more
doaj +1 more source
On a problem of Pillai with k-generalized Fibonacci numbers and powers of 2
, 2018 For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $k$ preceding terms.
Ddamulira, M., Gómez, C., Luca, F.
core +1 more source
Fibonacci factoriangular numbers
Indagationes Mathematicae, 2017 Abstract Let ( F m ) m ≥ 0 be the Fibonacci sequence given by F 0 = 0 , F 1 = 1 and F m + 2 = F m + 1 + F m , for all m ≥ 0 . In Castillo (2015), it is conjectured that 2 , 5 and 34 are the only Fibonacci numbers of the form n ! + n
Florian Luca +2 more
openaire +3 more sources
Register‐Based and Stack‐Based Virtual Machines: Which Perform Better in JIT Compilation Scenarios?
Software: Practice and Experience, Volume 55, Issue 11, Page 1896-1910, November 2025.ABSTRACT Background Just‐In‐Time (JIT) compilation plays a critical role in optimizing the performance of modern virtual machines (VMs). While the architecture of VMs–register‐based or stack‐based–has long been a subject of debate, empirical analysis focusing on JIT compilation performance is relatively sparse. Objective In this study, we aim to answer
Bohuslav Šimek +2 more
wiley +1 more source
Some results on one type of graph family with some special number sequences
AKCE International Journal of Graphs and Combinatorics, 2020 In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order ...
Emrullah Kirklar +2 more
doaj +1 more source
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
, 2002 A permutation $ \in S_n$ is said to {\it avoid} a permutation $ \in S_k$ whenever $ $ contains no subsequence with all of the same pairwise comparisons as $ $. For any set $R$ of permutations, we write $S_n(R)$ to denote the set of permutations in $S_n$ which avoid every permutation in $R$. In 1985 Simion and Schmidt showed that $|S_n(132, 213, 123)
Egge, Eric S., Mansour, Toufik
openaire +3 more sources
CAAI Transactions on Intelligence Technology, Volume 10, Issue 5, Page 1269-1290, October 2025.Abstract Life expectancy has improved with new‐age technologies and advancements in the healthcare sector. Though artificial intelligence (AI) and the Internet of Things (IoT) are revolutionising smart healthcare systems, security of the healthcare data is always a concern.
Shaiju Panchikkil +4 more
wiley +1 more source
Incomplete Bivariate Fibonacci and Lucas 𝑝-Polynomials
Discrete Dynamics in Nature and Society, 2012 We define the incomplete bivariate Fibonacci and Lucas 𝑝-polynomials. In the case 𝑥=1, 𝑦=1, we obtain the incomplete Fibonacci and Lucas 𝑝-numbers. If 𝑥=2, 𝑦=1, we have the incomplete Pell and Pell-Lucas 𝑝-numbers.
Dursun Tasci +2 more
doaj +1 more source