A combinatorial identity with application to Catalan numbers

By a very simple argument, we prove that if l,m,n∈{0,1,2,…} then

     

Arithmetical properties of a sequence arising from an arctangent sum

The sequence {xn} defined by xn=(n+xn−1)/(1−nxn−1), with x₁=1, appeared in the context of some arctangent sums. We establish the fact that xn≠0 for n?4 and conjecture that xn is not an integer for n?5. This conjecture is given a combinatorial interpretation in terms of Stirling numbers via the elementary symmetric functions. The problem features linkage with a well-known conjecture on the existence of infinitely many primes of the form n²+1, as well as our conjecture that (1+¹²)(1+²²)?(1+n²) is not a square for n>3. We present an algorithm that verifies the latter for n?¹⁰³²⁰⁰.     

On the multiplicity of linear recurrence sequences

We prove a lemma regarding the linear independence of certain vectors and use it to improve on a bound due to Schmidt on the zero-multiplicity of linear recurrence sequences.     

On the residue classes of integer sequences satisfying a linear three term recurrence formula

In this paper we investigate linear three-term recurrence formulae with sequences of integers (T(n))_n?0 and (U(n))_n?0, which are ultimately periodic modulo m, e.g.

     

Jacobi continued fraction and Hankel determinants of the Thue-Morse sequence

We study the Jacobi continued fraction and the Hankel determinants of the Thue-Morse sequence and obtain several interesting properties. In particular, a formal power series φ(x) is being discovered, having the property that the Hankel transforms of φ(x) and of φ(x²) are identical.     

Zeros of linear recurrence sequences

Let be an exponential polynomial over a field of zero characteristic. Assume that for each pair i,j with i≠j, α _i /α _j is not a root of unity. Define . We introduce a partition of into subsets (1≤i≤m), which induces a decomposition of f into , so that, for 1≤i≤m, , while for , the number either is transcendental or else is algebraic with not too small a height. Then we show that for all but at most solutions x∈ℤ of f(x)= 0, we have

On consecutive happy numbers

Let e?1 and b?2 be integers. For a positive integer with 0?aj<b, define

     

On Delannoy numbers and Schröder numbers

The nth Delannoy number and the nth Schröder number given by

     

Congruences involving Bernoulli and Euler numbers

Let [x] be the integral part of x. Let p>5 be a prime. In the paper we mainly determine , , and in terms of Euler and Bernoulli numbers. For example, we have

     

Unique expansions of real numbers

It was discovered some years ago that there exist non-integer real numbers q>1 for which only one sequence (ci) of integers ci∈[0,q) satisfies the equality . The set of such “univoque numbers” has a rich topological structure, and its study revealed a number of unexpected connections with measure theory, fractals, ergodic theory and Diophantine approximation.In this paper we consider for each fixed q>1 the set Uq of real numbers x having a unique representation of the form with integers ci belonging to [0,q). We carry out a detailed topological study of these sets. For instance, we characterize their closures, and we determine those bases q for which Uq is closed or even a Cantor set. We also study the set consisting of all sequences (ci) of integers ci∈[0,q) such that . We determine the numbers r>1 for which the map (defined on (1,∞)) is constant in a neighborhood of r and the numbers q>1 for which is a subshift or a subshift of finite type.     

On Euler numbers modulo powers of two

To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M.A. Stern.     

Almost periodic and almost automorphic solutions of linear differential/difference equations without Favard's separation condition. I

The well-known Favard's theorem states that the linear differential equation

(1)     

On congruences of Euler numbers modulo powers of two

In this paper, we establish some identities involving the Euler numbers, the Euler numbers of order 2 and the central factorial numbers, and give a new proof of a classical result due to M.A. Stern.

Video abstract

For a video summary of this paper, please visit http://www.youtube.com/watch?v=kdNsdTDA-FE.     

Maximum versus minimum: Two properties of the Fibonacci sequence

It is well-known that the Fibonacci numbers have a maximum property with respect to the length of the regular continued fraction expansion (or, equivalently, of the Euclidean algorithm). But it seems to be scarcely known that they also have a minimum property relative to the sum of the digits of this expansion. We discuss both properties and their interrelation here.     

Cubic residues and binary quadratic forms

Let p>3 be a prime, u,v,d∈Z, gcd(u,v)=1, p?u²−dv² and , where is the Legendre symbol. In the paper we mainly determine the value of by expressing p in terms of appropriate binary quadratic forms. As applications, for we obtain a general criterion for and a criterion for εd to be a cubic residue of p, where εd is the fundamental unit of the quadratic field . We also give a general criterion for , where {Un} is the Lucas sequence defined by U₀=0, U₁=1 and Un+1=PUn−QUn−1 (n?1). Furthermore, we establish a general result to illustrate the connections between cubic congruences and binary quadratic forms.     

Eulerian numbers with fractional order parameters

Summary The aim of this paper is to generalize the well-known Eulerian numbers, defined by the recursion relationE(n, k) = (k + 1)E(n – 1, k) + (n – k)E(n – 1, k – 1), to the case thatn is replaced by . It is shown that these Eulerian functionsE(, k), which can also be defined in terms of a generating function, can be represented as a certain sum, as a determinant, or as a fractional Weyl integral. TheE(, k) satisfy recursion formulae, they are monotone ink and, as functions of , are arbitrarily often differentiable. Further, connections with the fractional Stirling numbers of second kind, theS(, k), > 0, introduced by the authors (1989), are discussed. Finally, a certain counterpart of the famous Worpitzky formula is given; it is essentially an approximation ofx in terms of a sum involving theE(, k) and a hypergeometric function.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.