Balancing numbers which are concatenation of two repdigits
Balancing numbers \(n\), are solutions of the Diophantine equation \[1+ 2+ \cdots + (n-1) = (n+1)+ (n+2) +\cdots + (n+r), \] for some natural number \(r\), called the \textit{balancer} corresponding to \(n\). The sequence of balancing numbers \(\{B_n\}_{n\ge 0}\) is defined by the linear recurrence \(B_0=0\), \(B_1=1\), and \(B_{n+1}=6B_{n+1} - B_n\) for all \(n\ge 0\). The sequence of \textit{Lucas-balancing} numbers \(\{C_n\}_{n\ge 0}\) satisfy the same recurrence but with different initial terms \(C_0=1\) and \(C_1=3\). In the paper under review, the authors study the problem of finding all balancing numbers that are concatenations of two numbers with repeated digits (also known as \textit{repdigits}). More precisely, they completely solve the Diophantine equation \[ B_n = \overline{\underbrace{a\cdots a}_{m\text{-times}}\underbrace{b\cdots b}_{\ell\text{-times}}}=a\left(\dfrac{10^{m}-1}{9}\right)\cdot 10^{\ell}+b\left(\dfrac{10^{\ell}-1}{9}\right), \] in nonnegative integers \((a,b,\ell, m)\) with \(a,b \in \{0, 1, \ldots, 9\}, ~ a>0\). Their main result is the following. Theorem 1. The only balancing number which is a concatenation of two repdigits is \(35\). The proof of Theorem 1 follows from a clever combination of techniques in Diophantine number theory, elementary properties of balancing and Lucas-balancing sequences, the theory of linear forms in logarithms of algebraic numbers à la Baker, and the Baker-Davenport reduction procedure. Computations are done in \texttt{Mathematica}.
- Balancing and Lucas-balancing numbers expressible as sums of two repdigits
- Repdigits as sums of three balancing numbers
- Repdigits as products of consecutive balancing or Lucas-balancing numbers
- Repdigits as products of balancing and Lucas-balancing numbers with indices in arithmetic progression
- Repdigits in the base \(b\) as sums of four balancing numbers.
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Fibonacci numbers which are concatenations of two repdigits
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- scientific article; zbMATH DE number 1467843 (Why is no real title available?)
- scientific article; zbMATH DE number 1484667 (Why is no real title available?)
- scientific article; zbMATH DE number 1391723 (Why is no real title available?)
- On repdigits as product of consecutive Fibonacci numbers
- Pell and Pell-Lucas numbers with only one distinct digit
- Repdigits as products of balancing and Lucas-balancing numbers with indices in arithmetic progression
- Repdigits as products of consecutive balancing or Lucas-balancing numbers
- Repdigits in the base \(b\) as sums of four balancing numbers.
- Some fascinating properties of balancing numbers
- Lucas numbers which are concatenations of two repdigits
- Padovan numbers which are palindromic concatenations of two distinct repdigits
- Generalized Lucas numbers which are concatenations of two repdigits
- Associated Pell numbers which are repdigits or concatenation of two repdigits
- Tribonacci numbers with two blocks of repdigits
- Padovan numbers that are concatenations of two distinct repdigits
- Catalan transform of \(k\)-balancing sequences
- Tribonacci numbers that are concatenations of two repdigits
- Narayana numbers as sums of two base b repdigits
- Repdigits as sums of three balancing numbers
- Balancing and Lucas-balancing numbers expressible as sums of two repdigits
- Repdigits in the base \(b\) as sums of four balancing numbers.
- scientific article; zbMATH DE number 7674025 (Why is no real title available?)
- On concatenations of Padovan and Perrin numbers
- On concatenations of two Padovan and Perrin numbers
- Balancing and Lucas-balancing numbers which are concatenation of three repdigits
- Narayana numbers which are concatenations of two base \(b\) repdigits
- Pell and Pell-Lucas numbers which are concatenations of two repdigits
- Palindromic concatenations of two distinct repdigits in Narayana's cows sequence
- Balancing numbers which are concatenations of three repdigits
- Pell and Pell-Lucas numbers which are concatenations of three repdigits
- Balancing and Lucas-balancing numbers as the difference of two repdigits
- Padovan numbers as difference of two repdigits
- Pell or Pell-Lucas numbers as concatenations of two repdigits in base b
- Solutions of the Diophantine equation \(F_n = \overline{F_m {\overline{\underbrace{dd\dots d}_{k\text{-times}}}}}\)
This page was built for publication: Balancing numbers which are concatenation of two repdigits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210312)
