相关论文: Fibonacci and Lucas numbers as products of three r…

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist,…

Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we explore the presence of repdigits in the product of consecutive balancing or Lucas-balancing numbers.

A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…

Positive integers with all digits equal are called repdigits. In this paper, we find all balancing and Lucas-balancing numbers, which can be expressed as the difference of two repdigits. The method of proof involves the application of…

In this paper, we show that there are only finitely many Narayana's numbers which can be written as product of three repdigits in base $g$ with $g \geq 2$. Moreover, for $2 \leq g \leq 10$, we determine all these numbers.

Let $b$ be a positive integer such that $2 \leq b \leq 10$. In this study, we find all Pell or Pell-Lucas numbers as concatenations of two repdigits in base $b$. As a corollary, it is show that the largest Pell or Pell-Lucas numbers which…

Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers. The method of proof involves the application…

In this study, we find all Pell and Pell-Lucas numbers which are sums of three base 10 repdigits. The proof of our main theorem uses lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker-Davenport…

Let $ k \geq 2 $ and let $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with certain initial $ k $ terms and each term afterward is the sum of the $ k $ preceding terms. In this paper, we find all repdigits which are…

In this paper, we focus on Narayana numbers which can be written as a products of four repdigits in base $g$, where $g$ is an integer with $g\geq2$. We prove that for $g$ between $2$ and $12$, there are finitely many of these numbers.…

Let $(F_n)_{n\ge0}$ and $(L_n)_{n\ge0}$ denote the sequences of Fibonacci and Lucas numbers respectively. This paper determines all Lucas numbers that can be represented as base $b$ mixed concatenations of a Fibonacci number and a Lucas…

Let $ k \geq 2 $ and $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 ,$ $ L_{0}^{(k,}=2,$ $ L_{1}^{(k)}=1$ and each term afterwards is the sum of the $…

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we determine all Lucas numbers that are palindromic concatenations of two distinct repdigits.

We investigate cases where Thabit and Williams numbers in base $b$ can be expressed as the sum or difference of two $g$-repdigits. For specific values of $b$ and $g$, we describe parametric solutions yielding infinitely many solutions for…

A positive integer $n$ is called a balancing number if there exists a positive integer $r$ such that $1 + 2 + \cdots + (n-1) = (n+1) + (n+2) + \cdots + (n+r)$. The corresponding value $r$ is known as the balancer of $n$. If $n$ is a…

In this paper we study a certain kind of generalized linear Diophantine problem of Frobenius. Let $a_1,a_2,\dots,a_l$ be positive integers such that their greatest common divisor is one. For a nonnegative integer $p$, denote the…

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 =1=P_2$ and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\geq 0 $. In this paper, we find all repdigits in base $ 10 $ which can be written as a sum of three…

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…