Searcharxiv⌕ Search

arXiv subjects

Herbert Batte

Publications and source records attributed to Herbert Batte.

At least 19 recordsLinked to original sources
arXiv2026

$k$-Lucas Annulus for Polynomial Zeros

We prove a binomial identity relating the $k$-Lucas and $k$-Fibonacci sequences: for real $k>0$ and integers $m\ge1$, $n\ge1$, a binomial-weighted sum of $k$-Lucas numbers reduces to a multiple of $L_{k,mn}$ when $n$ is even, but to a multiple of $F_{k,mn}$ when $n$ is odd. This parity dependence traces back to the $k$-Lucas Binet formula lacking the normalising factor $1/(\alpha-\beta)$ present for $k$-Fibonacci numbers. The identity supplies, for each parity of $n$ and each $m$, an explicit family of positive weights summing to one; combined with the general annulus principle of Dalal and Govil, this yields a $k$-Lucas annulus containing all the zeros of a complex polynomial of degree $n$, complementing the $k$-Fibonacci-based bounds of D\'iaz-Barrero, Bidkham-Shashahani, and Kaur.

math.NT↗
arXiv2026

On the Diophantine Inequality $\lvert x^{2} - 2^{a}\cdot 3^{b}\rvert < 3\max\{a,b\}$

In this paper, we show that there are $57$ nonnegative integer solutions $(a,b,x)$ to the inequality $1\le \lvert x^{2} - 2^{a}\cdot 3^{b}\rvert < 3\max\{a, b\}$ and we list them explicitly. The inequality is converted into a statement about how closely $x/q$ approximates irrational number $\sqrt{d}$ for $d\in\{2,3,6\}$, where $q$ is an integer which is $3$-smooth, after which Worley's theorem on rational approximations via continued fractions is applied to parametrise the solutions and a $p$-adic lower bound for a linear form in logarithms due to Bugeaud and Laurent is applied to find a rather large bound on $\max\{a,b\}$. We finish with an application of the LLL algorithm to reduce this bound.

math.NT↗
arXiv2026

Cullen and Woodall numbers in Padovan and Perrin sequences

Let $\{P_n\}_{n\ge 0}$ and $\{R_n\}_{n\ge 0}$ denote the Padovan and Perrin sequences, both satisfying the recurrence $U_{n+3} = U_{n+1} + U_n$, but with initial values $P_0 = P_1 = P_2 = 1$ and $R_0 = 3$, $R_1 = 0$, $R_2 = 2$, respectively. A \textit{Cullen number} is a positive integer of the form $m\cdot 2^m + 1$ for some integer $m \ge 1$, while a \textit{Woodall number} is a positive integer of the form $m\cdot 2^m - 1$ for some integer $m \ge 1$. In this paper, we determine all Woodall numbers in the Padovan sequence and all Cullen numbers in the Perrin sequence. Specifically, we prove that $1$ and $7$ are the only Woodall numbers in the Padovan sequence, and that $3$ is the only Cullen number in the Perrin sequence.

math.NT↗
arXiv2026

On generalized Thabit numbers $(p+1)p^\mathfrak{a}-1$ in the $k$-Lucas sequence

Let $k\ge 2$ and $\{L_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$-Lucas numbers whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we solve the Diophantine equation $L_n^{(k)}=(p+1)p^\mathfrak{a}-1$, for a Mersenne or Fermat prime $p=2^{\ell}\pm 1$, and positive integers $n\ge 2$, $k\ge 2$, $\mathfrak{a}\ge 1$ and $\ell \ge 1$.

math.NT↗
arXiv2026

On mixed $b$-concatenations of Fibonacci and Lucas numbers that are Lucas numbers

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 number. Mathematically, we study of two Diophantine equations $L_n=b^dL_m+F_k$ and $L_n=b^dF_m+L_k$, where $d$ is the number of digits of $F_k$ or $L_k$ in base $b$. To tackle these equations, we combine tools from Diophantine approximation on non-zero linear forms in logarithms and reduction methods based on continued fractions. This allows us to prove that only finitely many such Lucas numbers exist.

math.NT↗
arXiv2026

On Wagstaff primes in the $k$-Lucas number sequence

A Wagstaff prime is a prime number of the form $(2^{\mathfrak{p}}+1)/3$, where $\mathfrak{p}$ is an odd prime. Let $(L_n^{(k)})_{n\geq 2-k}$ be the $k$-Lucas number sequence defined by the recurrence relation $ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)}$, for all $n \ge 2$, with initial terms \( L_0^{(k)} = 2 \) and \( L_1^{(k)} = 1 \) for all \( k \ge 2 \), and \( L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)} = 0 \) for \( k \ge 3 \). In this paper, we show that the only solutions to the Diophantine equation $L_n^{(k)} = (2^{\mathfrak{p}}+1)/3$ are $(n,k,\mathfrak{p})\in\{(5,2,5),(6,4,7)\}\cup \{(2,k,3):k\ge 2\}$. We use linear forms in logarithms and the LLL reduction method to prove our result.

math.NT↗
arXiv2026

Product of powers of distinct primes as sums of Fibonacci numbers

Let $F_n$ be the $n$-th Fibonacci number. In this paper, we study the Diophantine equation $F_n+F_m=p^xq^y$ in nonnegative integers $n\ge m$, $x$ and $y$, where $p$ and $q$ are fixed distinct prime numbers. We determine all pairs of primes $(q,p)$ with $q\le \min\{1000,p\}$ such that the above equation has at least two solutions $(x,y)$ (and corresponding $m,n$) in positive integers.

math.NT↗
arXiv2025

On Palindromic forms in the $k$-Lucas sequence composed of two distinct Repdigits

For integers $k \geq 2$, the $k$-generalized Lucas sequence $\{L_n^{(k)}\}_{n \geq 2-k}$ is defined by the recurrence relation \[ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \quad \text{for } n \geq 2, \] with initial terms given by $L_0^{(k)} = 2$, $L_1^{(k)} = 1$, and $L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)} = 0$. In this paper, we extend work in \cite{Lucas} and show that the result in \cite{Lucas} still holds for $k\ge 3$, that is, we show that for $k\ge 3$, there is no $k$-generalized Lucas number appearing as a palindrome formed by concatenating two distinct repdigits.

math.GM↗
arXiv2025

On the Largest Prime factor of the $k$-generalized Pell numbers

Let $k \ge 2$ be an integer and consider the $k$-generalized Pell sequence $\{P_n^{(k)}\}_{n \ge 2-k}$, defined by the initial values $0, \ldots, 0, 0, 1$ (a total of $k$ terms), and the recurrence $P_n^{(k)} = 2P_{n-1}^{(k)} + P_{n-2}^{(k)} + \cdots + P_{n-k}^{(k)}$, for all $n\ge 2$. For any integer $m$, let $\mathcal{P}(m)$ denote the largest prime factor of $m$, with the convention $\mathcal{P}(0) = \mathcal{P}(\pm1) = 1$. In this paper, we prove that for $n \ge 4$, the inequality $\mathcal{P}(P_n^{(k)}) > (1/104) \log \log n$ holds. Additionally, we find all $k$-generalized Pell numbers $P_n^{(k)}$, whose largest prime factor does not exceed $7$.

math.NT↗
arXiv2025

On $k$-Pell numbers that are Palindromes formed by two distinct Repdigits

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)} + P_{n-2}^{(k)} + \cdots + P_{n-k}^{(k)}$ for all $n \ge 2$. In this work, we identify all terms in the $k$-Pell sequence that can be expressed as palindromes formed by concatenating two distinct repdigits.

math.NT↗
arXiv2024

On a nonlinear Diophantine equation with powers of three consecutive $k$--Lucas Numbers

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we completely solve the nonlinear Diophantine equation $\left(L_{n+1}^{(k)}\right)^x+\left(L_{n}^{(k)}\right)^x-\left(L_{n-1}^{(k)}\right)^x=L_m^{(k)}$, in nonnegative integers $n$, $m$, $k$, $x$, with $k\ge 2$.

math.NT↗
arXiv2024

On a problem of Pillai involving S-units and Lucas numbers

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$ independently. In the cases that $c\in \mathbb{N}$ and $c\in -\mathbb{N}$, we find all integers $c$ such that the Diophantine equation has at least three solutions. These cases are treated independently since we employ quite different techniques in proving the two cases.

math.NT↗
arXiv2023

Multiplicative independence in the sequence of $k$-generalized Lucas numbers

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;0,\;2,\;1$ and each term afterward is the sum of the preceding $k$ terms. In this paper, we find all pairs of the $k$-generalized Lucas numbers that are multiplicatively dependent.

math.NT↗