Results 31 to 40 of about 161 (91)
Fibonacci numbers which are concatenations of two repdigits [PDF]
, 2021 We show that the only Fibonacci numbers that are concatenations of two repdigits are 13, 21, 34, 55, 89, 144, 233 ...
Alahmadi, Adel +7 more
core +2 more sources
Padovan Numbers as Sum of Two Repdigits
Proceedings of the Bulgarian Academy of Sciences, 2023 Padovan sequence $$(P_{n})$$ is given by $$P_{n}=P_{n-2}+P_{n-3}$$ for $$n\geq3$$ with initial condition $$(P_{0},P_{1},P_{2})=(1,1,1)$$. A positive integer is called a repdigit if all of its digits are equal. In this study, we examine the terms of the Padovan sequence, which are the sum of two repdigits.
Duman, Merve Güney +5 more
openaire +1 more source
Can a Lucas number be a sum of three repdigits? [PDF]
, 2020 summary:We give the answer to the question in the title by proving that \begin{equation*} L_{18} = 5778 = 5555 + 222 + 1 \end{equation*} is the largest Lucas number expressible as a sum of exactly three repdigits.
Adegbindin, Chèfiath A., Togbé, Alain
core +1 more source
Perrin numbers expressible as sums of two base b repdigits [PDF]
, 2021 In this paper we study Perrin numbers that can be expressed as sums of two base b repdigits. This can be done using linear forms in logarithms of algebraic numbers and a version of the Baker–Davenport reduction ...
Bhoi, Khisan, Ray, Prasanta Kumar
core +2 more sources
Narayana numbers as sums of two base b repdigits [PDF]
, 2022 In this study, we find all Narayana numbers which are expressible as sums of two base b repdigits. The proof of the main result uses lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker–Davenport reduction ...
Patel, Bijan Kumar +2 more
core +2 more sources
On some polynomial values of repdigit numbers [PDF]
Electronic Notes in Discrete Mathematics, 2013 Let \[ f_{k,m}(x)=\frac{x(x+1)\ldots(x+k-2)((m-2)x+k+2-m)}{k!} \] be the \(m\)th order \(k\)-dimensional polygonal number, where \(k\geq 2\) and \(m\geq 3\) are fixed integers. As special cases for \(f_{k,3}\) we get the binomial coefficient \(\binom{x+k-1}{k}\), for \(f_{2,m}(x)\) and \(f_{3,m}(x)\) we have the corresponding polygonal and pyramidal ...
Kovács, Tünde +2 more
openaire +3 more sources
Almost repdigits in balancing and Lucas-balancing sequences [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and we search all terms of the balancing and Lucas-balancing sequences which are almost repdigits.
Manasi K. Sahukar, Hussain Basha
doaj +1 more source
Integers, 2016 A \emph{repdigit} is a natural number greater than 10 which has all of its base-10 digits the same. In this paper we find all examples of two repdigits adding to a square. The proofs lead to interesting questions about consecutive quadratic residues and non-residues, and provide an elementary application of elliptic curves.
Bart Goddard, Jeremy Rouse
openaire +4 more sources
Perrin numbers and distinct repdigits [PDF]
, 2020 We determine all Perrin numbers that are concatenations of two repdigits.
Mahadi Ddamulira, Toboka Chalebgwa
openaire +1 more source
The supplementary materials for two-term products of Fibonacci and Lucas numbers equaling repdigits. [PDF]
, 2023 This data sets file (.xlsx) is to supplementary support for the paper which shows that two-term products of Fibonacci number and Lucas number became repdigits. These materials are results computing the upper bounds of Fibonacci and Lucas numbers on Baker'
Harunori Nakayama (10708851)
core +1 more source