Searcharxiv⌕ Search

arXiv subjects

Bibhu Prasad Tripathy

Publications and source records attributed to Bibhu Prasad Tripathy.

6 recordsLinked to original sources
arXiv2025

On Diophantine equations involving intersection of Thabit and Williams numbers base $b$ and some ternary recurrent sequences

Let $\mathcal{P}_{n}$ be the $n$-th Padovan number, $E_{n}$ be the $n$-th Perrin number and $N_{n}$ be the $n$-th Narayana's cows number. Let $b$ be a positive integer such that $b \geq 2$. In this paper, we study the Diophantine equations \[ \mathcal{P}_{n} = (b \pm 1)\cdot b^{l} \pm 1, \] \[ E_{n} = (b \pm 1)\cdot b^{l} \pm 1, \] and \[ N_{n} = (b \pm 1)\cdot b^{l} \pm 1, \] in non-negative integers $n, b$ and positive integer $l$. As a result, we determine the Padovan, Perrin and Narayana's cows numbers that are Thabit and Williams numbers base $b$. Moreover, we determine all solutions of the above equations within the range $2 \leq b \leq 10$.

math.NT↗
arXiv2025

On balancing and Lucas-balancing numbers expressible as product of two $k$-Fibonacci numbers

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 balancing number, then $8n^{2}+1$ is a perfect square, and its positive square root is called a Lucas-balancing number. For any integer $k \geq 2$, let $\{F_{n}^{(k)} \}_{n \geq -(k-2)}$ denote $k$-generalized Fibonacci sequence which starts with $0, \dots ,1$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we investigate all balancing and Lucas-balancing numbers that can be expressed as the product of two $k$-generalized Fibonacci numbers.

math.NT↗
arXiv2023

Common terms of generalized Pell and Narayana's cows sequences

For an integer $k \geq 2$, let $\{ P_{n}^{(k)} \}_{n}$ be the $k$-generalized Pell sequence which starts with $0, \dots,0,1$($k$ terms) and each term afterwards is the sum of $k$ preceding terms. In this paper, we find all the solutions of the Diophantine equation $P_{n}^{(k)} = N_{m}$ in non-negative integers $(n, k, m)$ with $k \geq 2$, where $\{ N_{m} \}_m$ is the Narayana's cows sequence. Our approach utilizes the lower bounds for linear forms in logarithms of algebraic numbers established by Matveev, along with key insights from the theory of continued fractions.

math.NT↗
arXiv2023

$k$-Pell-Lucas numbers which are concatenations of two repdigits

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 find all the $k$-generalized Pell-Lucas numbers that are concatenations of two repdigits.

math.NT↗
arXiv2022

$k$-Pell-Lucas numbers as Product of Two Repdigits

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 find all the $k$-generalized Pell-Lucas numbers that are the product of two repdigits. This generalizes a result of Erduvan and Keskin \cite{Erduvan1} regarding repdigits of Pell-Lucas numbers.

math.NT↗