English
Related papers

Related papers: A Classic Proof of a Recurrence for a Very Classic…

200 papers

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

Number Theory · Mathematics 2017-11-07 Xianzu Lin

In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…

Combinatorics · Mathematics 2016-06-30 Roberto Tauraso

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Number Theory · Mathematics 2010-05-21 Akos Pinter , Volker Ziegler

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

Combinatorics · Mathematics 2019-01-16 Richard P. Stanley

In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…

Number Theory · Mathematics 2024-06-27 Ji-Cai Liu

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Number Theory · Mathematics 2011-12-30 Vladimir Shevelev , Peter J. C. Moses

We present a method for obtaining congruences modulo powers of 3 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Motzkin numbers, Riordan numbers, Schr\"oder numbers,…

Combinatorics · Mathematics 2013-08-14 Christian Krattenthaler , Thomas W. Müller

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

Number Theory · Mathematics 2021-05-07 Christian Weiß

Hofstadter's Q-sequence remains an enigma fifty years after its introduction. Initially, the terms of the sequence increase monotonically by 0 or 1 at a time. But, Q(12)=8 while Q(11)=6, and monotonicity fails shortly thereafter. In this…

Number Theory · Mathematics 2016-11-28 Nathan Fox

Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…

Classical Analysis and ODEs · Mathematics 2019-01-14 Daniel Duviol Tcheutia

Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and…

Number Theory · Mathematics 2019-02-20 Michael Bennett , Vandita Patel , Samir Siksek

In this note we present a proof of multiple recurrence for ergodic systems (and thereby of Szemer\'edi's theorem) being a mixture of three known proofs. It is based on a conditional version of the Jacobs-de Leeuw-Glicksberg decomposition…

Dynamical Systems · Mathematics 2022-08-23 Tanja Eisner

In this short note, we prove that the one-dimensional Kronecker sequence $i\alpha \bmod 1, i=0,1,2,\ldots,$ is quasi-uniform if and only if $\alpha$ is a badly approximable number. Our elementary proof relies on a result on the three-gap…

Number Theory · Mathematics 2024-06-26 Takashi Goda

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…

Number Theory · Mathematics 2020-10-01 Daqing Wan , Hang Yin

In this paper, we prove certain theorems about three consecutive primes.

General Mathematics · Mathematics 2009-09-25 Tsutomu Hashimoto

In this paper, we study the three-term nested recurrence relation $B(n)=B(n-B(n-1))+B(n-B(n-2))+B(n-B(n-3))$ subject to initial conditions where the first $N$ terms are the integers $1$ through $N$. This recurrence is the three-term analog…

Number Theory · Mathematics 2024-06-04 Nathan Fox

We survey the classical results on the prime number theorem

Number Theory · Mathematics 2007-05-23 Yong-Cheol Kim

We consider the problem of enumerating the permutations containing exactly $k$ occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an…

Combinatorics · Mathematics 2007-05-23 Markus Fulmek

We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and…

Combinatorics · Mathematics 2010-09-14 William Y. C. Chen , Ernest X. W. Xia
‹ Prev 1 2 3 10 Next ›