Searcharxiv⌕ Search

arXiv subjects

Gopal Krishna Panda

Publications and source records attributed to Gopal Krishna Panda.

11 recordsLinked to original sources
arXiv2026

Resolution of the Skolem Problem for $k$-Generalized Lucas Sequences

This paper provides a complete solution to Skolem's problem for the $k$-generalized Lucas sequence $(L_n^{(k)})_{n \in \mathbb{Z}}$ with a primary focus on its behavior at negative indices. We characterize the zero-distribution of this sequence by identifying and bounding all indices $n < 0$ such that $L_n^{(k)} = 0$. Our central result establishes that the zero-multiplicity $\delta_k$ of the sequence is $(k-1)(k-2)/2$ for all $k.$

math.NT↗
arXiv2025

Solving Skolem problem for negative indexed $k-$generalized Pell numbers

In this paper, we address the Skolem problem for the $k$-generalized Pell sequence $(P_n^{(k)})_{n\geq2-k}$ extended to negative indices. We focus on identifying and bounding the indices $n<0$ for which $P_n^{(k)}=0.$ In particular, we establish that the zero multiplicity of $P_n^{(k)}$ is $ \chi_k = \lfloor k^2/4\rfloor$ for all $k \in [4, 500].$

math.NT↗
arXiv2024

Some Diophantine Equations involving associated Pell numbers and repdigits

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 Pell numbers can be represented as the difference of two repdigits. Additionally, we investigate all associated Pell numbers which are the concatenation of three repdigits. Our proof utilizes Baker's theory on linear forms in logarithms of algebraic numbers, along with the Baker-Davenport reduction technique. The computations were carried out with the help of a simple computer program in {\it Mathematica}.

math.GM↗
arXiv2024

Balancing and Lucas-balancing numbers as difference of two repdigits

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 Baker's theory for linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction procedure.

math.NT↗
arXiv2024

Repdigits as difference of two balancing or Lucas-balancing numbers

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 of Baker's theory for linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction procedure. Computations are done with the help of a simple computer program in {\it Mathematica}.

math.GM↗
arXiv2022

On perfect powers that are sum of two balancing numbers

Let $B_k$ denote the $k^{th}$ term of balancing sequence. In this paper we find all positive integer solutions of the Diophantine equation $B_n+B_m = x^q$ in variables $(m, n,x,q)$ under the assumption $n\equiv m \pmod 2$. Furthermore, we study the Diophantine equation \[B_n^{3}\pm B_m^{3} = x^q\] with positive integer $q\geq 3$ and $\gcd(B_n, B_m) =1$.

math.NT↗
arXiv2021

On several kinds of sums of balancing numbers

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 the type $\sum_{m=0}^n B_{k m+r}B_{k(n-m)+r}$ ($k>r\ge 0$) and the alternating sum of reciprocal of balancing numbers $\left\lfloor\left(\sum_{k=n}^\infty\frac{1}{B_{l k}}\right)^{-1}\right\rfloor$. Similar results are also obtained for Lucas-balancing numbers $C_n$ ($n=0,1,\cdots$), satisfying the binary recurrence $C_n=6C_{n-1}-C_{n-2}$ ($n\ge 2$) with $C_0=1$ and $C_1=3$. Some binomial sums involving these numbers are also explored.

math.NT↗
arXiv2019

Appearance of Balancing and related number sequences in steady state probabilities of some Markov chains

Balancing and Lucas-balancing numbers are solutions of a Diophantine equation and satisfy a second order homogeneous recurrence relation. Interestingly, these numbers can be seen as numerators and denominators in the steady state probabilities of a class of transition probability matrices of Markov chains. An identity relating the balancing numbers and the silver ratio can be obtained as a byproduct.

math.NT↗
arXiv2018

Several properties of hypergeometric Bernoulli numbers

In this paper, we give the determinant expressions of the hypergeometric Bernoulli numbers, and some relations between the hypergeometric and the classical Bernoulli numbers which include Kummer's congruences. By applying Trudi's formula, we have some different expressions and inversion relations. We also determine explicit forms of convergents of the generating function of the hypergeometric Bernoulli numbers, from which several identities for hypergeometric Bernoulli numbers are given.

math.NT↗
arXiv2018

On the Horadam symbol elements

Horadam symbol elemnts are introduced. Certain properties of these elements are explored. Some well known identities such as Catalan identity, Cassini formula and d'Ocagne's identity are obtained for these elements.

math.CO↗