中文
相关论文

相关论文: Perrin numbers that are concatenations of two dist…

200 篇论文

Let $ \{P_n\}_{n\geq 0} $ be the sequence of Perrin numbers defined by $P_0=3$, $P_1=0$,$P_2=2$ and $P_{n+3}=P_{n+1}+P_{n}$ for all $n \geq 0$. In this paper, we determine all Perrin numbers that are palindromic concatenations of two…

数论 · 数学 2025-05-08 Herbert Batte , Prosper Kaggwa

Let $ (P_{n})_{n\ge 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\ge 0 $. In this paper, we find all Padovan numbers that are concatenations of two distinct repdigits.

数论 · 数学 2020-06-22 Mahadi Ddamulira

The Tribonacci-Lucas sequence $\{S_n\}_{n\ge 0}$ is defined by the linear recurrence relation $S_{n+3} = S_{n+2} + S_{n+1} + S_n$, for $ n\ge 0 $, with the initial conditions $S_0 =S_2= 3$ and $S_1 = 1$. A palindromic number is a number…

数论 · 数学 2025-09-09 Mahadi Ddamulira

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…

数论 · 数学 2026-04-13 Ruofan Li

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…

数论 · 数学 2019-07-18 Mahadi Ddamulira

Let $ (N_n)_{n\ge 0}$ be the Narayana's cow sequence defined by a third-order recurrence relation $ N_0=0,\ N_1= N_2=1 $, and $ N_{n+3}=N_{n+2}+N_n $ for all $ n\ge 0 $. In this paper, we determine all Narayana numbers that are…

数论 · 数学 2022-10-04 Mahadi Ddamulira , Paul Emong , Geoffrey Ismail Mirumbe

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.

综合数学 · 数学 2024-01-12 Herbert Batte

Padovan sequence is a ternary recurrent sequence defined by the recurrence relation $P_{n+3}=P_{n+1}+P_{n}$ with initial terms $P_{0}=P_{1}=P_{2}=1.$ In this study it is shown that $114,151,200,265,351,465,616,816,3329,4410,7739,922111$ are…

数论 · 数学 2022-12-22 Kisan Bhoi , Prasanta Kumar Ray

In this paper, we explore the relationship between repdigits and associated Pell numbers, specifically focusing on two main aspects: expressing repdigits as the difference of two associated Pell numbers, and identifying which associated…

综合数学 · 数学 2026-05-20 Monalisa Mohapatra , Pritam Kumar Bhoi , Gopal Krishna Panda

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

数论 · 数学 2023-03-10 Bibhu Prasad Tripathy , Bijan Kumar Patel

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…

数论 · 数学 2020-10-30 Kisan Bhoi , Bijan Kumar Patel , Prasanta Kumar Ray

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…

数论 · 数学 2025-04-15 Herbert Batte , Florian Luca

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

数论 · 数学 2007-05-23 Thomas Garrity

Let $\left\lbrace P_{k}\right\rbrace_{k\geq0}$ be the Padovan sequence defined by $P_{k}=P_{k-2}+P_{k-3}$ with initial values are $P_{0}=P_{1}=P_{2}=1$. Let $\left\lbrace R_{k}\right\rbrace_{k\geq0}$ be the Perrin sequence defined by…

数论 · 数学 2024-09-23 Mustafa Ismail , Ahmed Gaber , M. Anwar

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

数论 · 数学 2008-03-25 Luigi Cimmino

The \textit{ternary digits of $2^n$} are a finite sequence of 0s, 1s, and 2s. It is a natural question to ask whether the frequency of any string of 0s, 1s, and 2s in this sequence approaches the same limit for all strings of the same…

数论 · 数学 2025-11-07 Christian Roettger , Xuyi Ren

Let $k \ge 2$ and consider the sequence $\{P_n^{(k)}\}_{n \ge 2-k}$ of $k$-generalized Pell numbers, which begins with the first $k$ terms as $0, \ldots, 0, 0, 1$, and satisfies the recurrence relation $P_n^{(k)} = 2P_{n-1}^{(k)} +…

数论 · 数学 2025-04-22 Herbert Batte , Darius Guma

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…

数论 · 数学 2020-10-14 Jhon J. Bravo , Pranabesh Das , Sergio Guzmán

Unlike in the case of Fibonacci and Lucas numbers, there is a paucity of literature dealing with summation identities involving the Padovan and Perrin numbers. In this paper, we derive various summation identities for these numbers,…

组合数学 · 数学 2019-04-26 Kunle Adegoke

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…

综合数学 · 数学 2024-05-09 Monalisa Mohapatra , Pritam Kumar Bhoi , Gopal Krishna Panda
‹ 上一页 1 2 3 10 下一页 ›