Results 21 to 30 of about 109 (79)
On the Euler function of repdigits [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
On Diophantine Equations Related to Narayana’s Cows Sequence and Double Factorials or Repdigits
In this paper, we determine all the Narayana’s cows numbers that are factorials or double factorials. We also show that 88 is the only repdigit (i.e., a class of numbers that has reflectional symmetry across a vertical axis) that can be written as ...
Peng Yang, Tianxin Cai, Yanjiao Ji
core +1 more source
Repdigits in k-Lucas sequences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bravo, Jhon J., Luca, Florian
openaire +1 more source
On Repdigits as Sums of Fibonacci and Tribonacci Numbers [PDF]
In this paper, we use Baker’s theory for nonzero linear forms in logarithms of algebraic numbers and a Baker-Davenport reduction procedure to find all repdigits (i.e., numbers with only one distinct digit in its decimal expansion, thus they can be seen as the easiest case of palindromic numbers, which are a ”symmetrical” type of numbers) that can be ...
openaire +1 more source
Perrin numbers and distinct repdigits [PDF]
We determine all Perrin numbers that are concatenations of two repdigits.
Mahadi Ddamulira, Toboka Chalebgwa
openaire +1 more source
Repdigits as Product of Fibonacci and Tribonacci Numbers [PDF]
In this paper, we study the problem of the explicit intersection of two sequences. More specifically, we find all repdigits (i.e., numbers with only one repeated digit in its decimal expansion) which can be written as the product of a Fibonacci by a Tribonacci number (both with the same indexes).
Dušan Bednařík, Eva Trojovská
openaire +2 more sources
A Diophantine equation in $k$-Fibonacci numbers and repdigits [PDF]
Summary: The \(k\)-generalized Fibonacci sequence \(\{F_{n}^{(k)}\}_{n}\) starts with the \(k\) values \(0,\dots ,0,1\) and each term afterwards is the sum of the \(k\) preceding terms. We study which members of this sequence are sums of two repdigts, extending a result of \textit{S. Díaz Alvarado} and \textit{F. Luca} [Aportaciones Mat., Investig. 20,
Bravo, J. +2 more
openaire +3 more sources
A repdigit számok néhány tulajdonsága
A dolgozatban az úgynevezett repdigit számok néhány tulajdonságát vizsgáltuk meg. B-repdigit számoknak nevezzük azokat az egész számokat, amelyeknek minden számjegye megegyezik a B számrendszerben.
Csillag, Balázs
core
Narayana numbers as products of three repdigits in base g
In this paper, we show that there are only finitely many Narayana's numbers which can be written as a product of three repdigits in base g with g >= 2. Moreover, for 2 <= g <= 10, we determine all these numbers.
Pagdame Tiebekabe +2 more
openaire +2 more sources

