Results 11 to 20 of about 6,941 (136)
Repdigits in the base $b$ as sums of four balancing numbers [PDF]
Mathematica Bohemica, 2021 The sequence of balancing numbers $(B_n)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\geq2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $
Refik Keskin, Fatih Erduvan
doaj +1 more source
Curious Generalized Fibonacci Numbers
Mathematics, 2021 A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e.,
Jose L. Herrera +2 more
doaj +1 more source
Fermat $k$-Fibonacci and $k$-Lucas numbers [PDF]
Mathematica Bohemica, 2020 Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all $k$-Fibonacci and $k$-Lucas numbers which are Fermat numbers.
Jhon J. Bravo, Jose L. Herrera
doaj +1 more source
On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers
Karpatsʹkì Matematičnì Publìkacìï, 2021 The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj +1 more source
Fermat and Mersenne numbers in $k$-Pell sequence
Математичні Студії, 2021 For an integer $k\geq 2$, let $(P_n^{(k)})_{n\geq 2-k}$ be the $k$-generalized Pell sequence, which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is defined by the recurrence $ P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots +P_{n-k}^{(k)}
B. Normenyo, S. Rihane, A. Togbe
doaj +1 more source
A Quadratic Diophantine Equation Involving Generalized Fibonacci Numbers
Mathematics, 2020 The sequence of the k-generalized Fibonacci numbers ( F n ( k ) ) n is defined by the recurrence F n ( k ) = ∑ j = 1 k F n − j ( k ) beginning with the k terms 0 , … , 0 , 1 .
Ana Paula Chaves, Pavel Trojovský
doaj +1 more source
Heliyon, 2022 For the very first time the sex ratio, length-weight relationships (LWRs), length-length relationships (LLRs), form factor, as well as condition factor were calculated for bartail flathead, Platycephalus indicus, captured with gill nets (mesh size: 2.0–6.
Md. Rahamat Ullah +1 more
doaj +1 more source
KPI Science News, 2021 Background. Generally, it is assumed that the formation of a solid phase (precipitate) happens when the activities of the involved ions would exceed those defined by the thermodynamic solubility product.
Yuriy Andriyko, Aleksandr O. Andriiko
doaj +1 more source
Наука и техника, 2022 . Many important questions in the theory of elasticity lead to a variational problem associated with a biharmonic equation and to the corresponding boundary value problems for such an equation.
I. N. Meleshko, P. G. Lasy
doaj +1 more source
Linear forms in two logarithms and Schneider's method. II [PDF]
Acta Arithmetica, 1989 Verf. verfeinern ihre in [Acta Arith. 53, No.3, 251-287 (1989; Zbl 0642.10034)] erhaltene untere Abschätzung für \(| b_ 1 \log \alpha_ 1-b_ 2 \log \alpha_ 2| \neq 0\) bei algebraischen \(\alpha_ j\neq 0\) und ganzrationalen \(b_ j\). Dazu kombinieren sie ihre a.a.O. entwickelte Methode mit einer Technik, die sie bereits in [Math. Ann.
Mignotte, Maurice, Waldschmidt, Michel
openaire +2 more sources