相关论文: Trigonometric-type properties and the parity of ba…

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

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…

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 work, we defined neo balcobalancing numbers, neo Lucas-balcobalancing numbers, neo balcobalancers and neo Lucas-balcobalancers and derived the general terms of these numbers in terms of balancing numbers. Conversely we deduced the…

Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve…

This paper explores the intricate relationships between Lucas numbers and Diophantine equations, offering significant contributions to the field of number theory. We first establish that the equation regarding Lucas number $L_n = 3x^2$ has…

In this article the Diophantine equations of the form $x^{2}-8C_{n}xy+ 16y^{2}=\pm2^{r}$, $x^{4}-8C_{n}x^{2}y+ 16y^{2}=\pm2^{r}$ and $x^{2}-8C_{n}xy^{2}+ 16y^{4}=\pm2^{r}$ are taken into consideration for the investigations of existence of…

Let $\{x_{n}\}_{n \geq 0}$ be the balancing-like sequence defined by $x_{n+1} = A x_{n} - x_{n-1}$, for $A>2$, where $x_0 = 0$ and $x_1 = 1$. In this paper, we demonstrate how to find all the solutions of the Diophantine equation,…

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…

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…

In this paper, we introduce a generalization of Balancing and Balancing-Lucas numbers. We describe some of their properties also we give the related matrix representation and divisibility properties.

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

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 $B_n$ be the $n$-th balancing number. In this paper, we give some explicit expressions of $\sum_{l=0}^{2 r-3}(-1)^l\binom{2 r-3}{l}\sum_{j_1+\cdots+j_r=n-2 l\atop j_1,\dots,j_r\ge 1}B_{j_1}\cdots B_{j_r}$ and…

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…

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.

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…

Many kinds of convolution identities have been considered about several numbers, including Bernoulli, Euler, Genocchi, Cauchy, Stirling, and Fibonacci numbers. The well-known basic result about Bernoulli numbers is due to Euler. The…

Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…