English
Related papers

Related papers: Repdigits as difference of two balancing or Lucas-…

200 papers

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…

Number Theory · Mathematics 2026-02-10 Kouèssi Norbert Adédji , Marija Bliznac Trebješanin , Jelena Pleština

In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…

Number Theory · Mathematics 2016-01-19 Nazmiye Yilmaz , Yasin Yazlik , Necati Taskara

Let $ (P_n)_{n\ge 0}$ be the sequence of Perrin numbers defined by ternary relation $ P_0=3 $, $ P_1=0 $, $ P_2=2 $, and $ P_{n+3}=P_{n+1}+P_n $ for all $ n\ge 0 $. In this paper, we use Baker's theory for nonzero linear forms in logarithms…

Number Theory · Mathematics 2021-05-19 Herbert Batte , Taboka P. Chalebgwa , Mahadi Ddamulira

Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Pell numbers defined by $ P_0=0 $, $ P_1 =1$ and $ P_{n+2}= 2P_{n+1} +P_n$ for all $ n\geq 0 $ and let $ \{Q_{n}\}_{n\geq 0} $ be its companion sequence, the Pell-Lucas numbers defined by $…

Number Theory · Mathematics 2023-10-13 Bilizimbeye Edjeou , Bernadette Faye

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…

Number Theory · Mathematics 2019-07-18 Mahadi Ddamulira

The generalized Lucas numbers are polynomials in two variables with nonnegative integer coefficients. Lucas versions of some combinatorial numbers with known formulas in terms of quotient and products of nonnegative integers have been…

Combinatorics · Mathematics 2023-01-13 José Agapito Ruiz

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…

Number Theory · Mathematics 2022-10-19 Kouessi Norbert Adedji , Alan Filipin , Salah Eddine Rihane , Alain Togbe

In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

The balancing numbers $B_n$ ($n=0,1,\cdots$) are solutions of the binary recurrence $B_n=6B_{n-1}-B_{n-2}$ ($n\ge 2$) with $B_0=0$ and $B_1=1$. In this paper we show several relations about the sums of product of two balancing numbers of…

Number Theory · Mathematics 2021-07-19 Takao Komatsu , Gopal Krishna Panda

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.…

Number Theory · Mathematics 2020-08-25 Eric F. Bravo , Jhon J. Bravo , Carlos A. Gómez

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

Number Theory · Mathematics 2025-09-30 Alex Behakanira Tumwesigye , Mahadi Ddamulira , Prosper Kaggwa

We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…

Number Theory · Mathematics 2020-09-22 Robert Frontczak , Taras Goy

Narayana's cows sequence satisfies the third-order linear recurrence relation $N_n=N_{n-1}+N_{n-3}$ for $n \geq 3$ with initial conditions $N_0=0$ and $N_1=N_2=1$. In this paper, we study $b$-repdigits which are sums of two Narayana…

Number Theory · Mathematics 2020-10-14 Jhon J. Bravo , Pranabesh Das , Sergio Guzmán

While a mature body of work supports the study of rewriting systems, abstract tools for Probabilistic Rewriting are still limited. In this paper we study the question of uniqueness of the result (unique limit distribution), and develop a…

Logic in Computer Science · Computer Science 2023-06-22 Claudia Faggian

Two sums over the inverse of the product of an integer n and its greatest prime factor G(n), are computed to first 13 decimal digits. These sums converge, but converge very slowly. They are transformed into sums involving Mertens' prime…

General Mathematics · Mathematics 2024-07-18 Tengiz O. Gogoberidze

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

Number Theory · Mathematics 2026-04-13 Ruofan Li

Gap balancing numbers are a certain generalization of balancing and cobalancing numbers that arise from studying the equation ${T(L)+T(B)=T(m)}$ where $T(i)$ is the $i$th triangular number. In this paper, we survey early results, attempt to…

Number Theory · Mathematics 2018-10-19 Jeremiah Bartz , Bruce Dearden , Joel Iiams

Let $k\ge 2$ and $\{F_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$--generalized Fibonacci numbers whose first $k$ terms are $0,\ldots,0,0,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we determine all…

Number Theory · Mathematics 2025-04-15 Herbert Batte , Florian Luca

This paper introduces a new term rewriting system that is similar to the embedded read-back mechanism for interaction nets presented in our previous work, but is easier to follow than in the original setting and thus to analyze its…

Logic in Computer Science · Computer Science 2018-08-21 Anton Salikhmetov

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian