English
Related papers

Related papers: Linear recurrence sequences and palindromic concat…

200 papers

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist,…

General Mathematics · Mathematics 2026-02-25 Passimzouwé Dagou , Pagdame Tiebekabe , Kouèssi Norbert Adédji , Kokou Tchariè

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…

General Mathematics · Mathematics 2026-05-20 Monalisa Mohapatra , Pritam Kumar Bhoi , Gopal Krishna Panda

The set of terms of an infinite sequence expressed by a recurrence relation is equal to the set of maximum numbers of all primitive Pythagorean triples such that the difference between the two non-maximum numbers is 1, which Cimmino showed.…

General Mathematics · Mathematics 2023-10-11 Yasushi Ieno

The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…

Combinatorics · Mathematics 2010-10-21 Fabien Durand

Classical crystals are solid materials containing arbitrarily long periodic repetitions of a single motif. In this paper, we study the maximal possible repetition of the same motif occurring in beta-integers -- one dimensional models of…

Combinatorics · Mathematics 2013-02-12 L. Balková , K. Klouda , E. Pelantová

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

Number Theory · Mathematics 2024-08-14 Deepa Antony , Rupam Barman

Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…

Number Theory · Mathematics 2022-11-22 Deepa Antony , Rupam Barman

We search for triangular numbers that are multiples of other triangular numbers. It is found that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers that are triangular numbers and…

Number Theory · Mathematics 2021-01-05 Vladimir Pletser

Let ${\cal P}$ be the set of palindromes occurring in the Fibonacci sequence. In this note, we establish three structures of $\mathcal{P}$ and and discuss their properties: cylinder structure, chain structure and recursive structure. Using…

Dynamical Systems · Mathematics 2016-01-19 Yuke Huang , Zhiying Wen

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

We study linear recurrences of Eulerian type of the form \[ P_n(v) = (\alpha(v)n+\gamma(v))P_{n-1}(v) +\beta(v)(1-v)P_{n-1}'(v)\qquad(n\ge1), \] with $P_0(v)$ given, where $\alpha(v), \beta(v)$ and $\gamma(v)$ are in most cases polynomials…

Combinatorics · Mathematics 2019-11-05 Hsien-Kuei Hwang , Hua-Huai Chern , Guan-Huei Duh

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

Combinatorics · Mathematics 2013-09-17 Tomer Kotek , Johann A. Makowsky

Let $\alpha, \beta \geq 0$ and $\alpha + \beta < 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^\beta(p_{n+1}^\alpha - p_n^\alpha) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of S\'{a}ndor…

Number Theory · Mathematics 2017-09-25 David Lowry-Duda

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson , Kevin O'Bryant , Brooke Orosz , Imre Ruzsa , Manuel Silva

Let $(U_n)_{n=0}^\infty$ and $(V_m)_{m=0}^\infty$ be two linear recurrence sequences. For fixed positive integers $k$ and $\ell$, fixed $k$-tuple $(a_1,\dots,a_k)\in \mathbb{Z}^k$ and fixed $\ell$-tuple $(b_1,\dots,b_\ell)\in…

Number Theory · Mathematics 2018-04-30 Volker Ziegler

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

Number Theory · Mathematics 2022-03-01 James Haoyu Bai , Joseph Meleshko , Samin Riasat , Jeffrey Shallit

We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show…

Number Theory · Mathematics 2007-05-23 William D. Banks , Derrick N. Hart , Mayumi Sakata

Let $\xi$ be an irrational algebraic real number and $(p_k / q_k)_{k \ge 1}$ denote the sequence of its convergents. Let $(u_n)_{n \geq 1}$ be a non-degenerate linear recurrence sequence of integers, which is not a polynomial sequence. We…

Number Theory · Mathematics 2023-12-20 Yann Bugeaud , Khoa D. Nguyen

S. Baker (2019), B. B\'ar\'any and A. K\"{a}enm\"{a}ki (2019) independently showed that there exist iterated function systems without exact overlaps and there are super-exponentially close cylinders at all small levels. We adapt the method…

Classical Analysis and ODEs · Mathematics 2020-04-30 Changhao Chen

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout