Related papers: A Classic Proof of a Recurrence for a Very Classic…
We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…
In 1994, P.-G. Becker and W. Bergweiler listed all the differentially algebraic solutions of three famous functional equations: the Schr{\"o}der's, B{\"o}ttcher's and Abel's equations. The proof of this theorem combines various domains of…
In 1982, Gessel showed that the Ap\'ery numbers associated to the irrationality of $\zeta(3)$ satisfy Lucas congruences. Our main result is to prove corresponding congruences for all sporadic Ap\'ery-like sequences. In several cases, we are…
In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
We prove that for arbitrary partitions $\mathbf{\lambda} \subseteq \mathbf{\kappa},$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbf{\kappa} + k\cdot \mathbf{1}^c)/(\mathbf{\lambda} + k\cdot…
In 1998, in the winter issue of the journal Mathematics and Computer education (see [1]), Monte Zerger posed the following problem. He had noticed the Pythagorean triple (216,630,666);(216)^2+(630)^2=(666)^2. Note that 216=6^3 and 666 is…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
A simple classical probabilistic system (a simple card game) classically exemplifies Aharonov and Vaidman's "Three-Box 'paradox'" [J. Phys. A 24, 2315 (1991)], implying that the Three-Box example is neither quantal nor a paradox and leaving…
For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…
In Evan and Hendel's recent proof of an outstanding conjecture on the resistance distances of a family of linear 3-trees, a key technique in the proof was calculating the recursion satisfied by a family of determinants. The underlying…
Herbrand's theorem is often presented as a corollary of Gentzen's sharpened Hauptsatz for the classical sequent calculus. However, the midsequent gives Herbrand's theorem directly only for formulae in prenex normal form. In the Handbook of…
The sequence $3, 5, 9, 11, 15, 19, 21, 25, 29, 35,\dots$ consists of odd legs in right triangles with integer side lengths and prime hypotenuse. We show that the upper density of this sequence is zero, with logarithmic decay. The same…
In this paper, we prove two supercongruences by the Wilf-Zeilberger method. One of them is, for any prime $p>3$, \begin{align*} \sum_{n=0}^{(p-1)/2}\frac{3n+1}{(-8)^n}\binom{2n}n^3\equiv…
For $c \in \mathbb{Q}$, consider the quadratic polynomial map $\varphi_c(x)=x^2-c$. Flynn, Poonen and Schaefer conjectured in 1997 that no rational cycle of $\varphi_c$ under iteration has length more than $3$. Here we discuss this…
In 1996, my brilliant student John Noonan, discovered, and proved that there are 3(2n)!/(n(n+3)!(n-3)!) ways to line-up n people of different heights in such a way that out of the n(n-1)(n-2)/6 possible triples of people exactly one is such…
The Franel numbers given by $f_n=\sum_{k=0}^n\binom{n}{k}^3$ ($n=0,1,2,\ldots$) play important roles in both combinatorics and number theory. In this paper we initiate the systematic investigation of fundamental congruences for the Franel…
Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…