Let $a$ be a $0-1$ sequence with a finite number of terms equal to 1. The distance sequence ${\delta }^{\left(a\right)}$ of $a$ is defined as a sequence of the numbers of $(1-1)$-couples of given distances. The paper investigates such pairs of $0-1$ sequences $a,b$ that a is different from $b$ and ${\delta }^{\left(a\right)}={\delta }^{\left(b\right)}$.

Let m ≥ 2 be a positive integer. Given a set E(ω) ⊆ ℕ we define $r_N^{\left(m\right)}\left(\omega \right)$ to be the number of ways to represent N ∈ ℤ as a combination of sums and differences of m distinct elements of E(ω). In this paper, we prove the existence of a “thick” set E(ω) and a positive constant K such that $r_N^{\left(m\right)}\left(\omega \right)<K$ for all N ∈ ℤ. This is a generalization of a known theorem by Erdős and Rényi. We also apply our results to harmonic analysis, where we prove the existence of certain thin sets.

In uniform distribution theory, discrepancy is a quantitative measure for the irregularity of distribution of a sequence modulo one. At the moment the concept of digital (t,s)-sequences as introduced by Niederreiter provides the most powerful constructions of s-dimensional sequences with low discrepancy. In one dimension, recently Faure proved exact formulas for different notions of discrepancy for the subclass of NUT digital (0,1)-sequences. It is the aim of this paper to generalize the concept...

In this paper we derive a sequence from a movement of center of~mass of arbitrary two planets in some solar system, where the planets circle on concentric circles in a same plane. A trajectory of center of mass of the planets is discussed. A sequence of points on the trajectory is chosen. Distances of the points to the origin are calculated and a distribution function of a sequence of the distances is found.

We present a method for constructing almost periodic sequences and functions with values in a metric space. Applying this method, we find almost periodic sequences and functions with prescribed values. Especially, for any totally bounded countable set $X$ in a metric space, it is proved the existence of an almost periodic sequence ${\left\{{\psi }_k\right\}}_{k\in \mathbb{Z}}$ such that $\{{\psi }_k;k\in \mathbb{Z}\}=X$ and ${\psi }_k={\psi }_{k+lq\left(k\right)}$, $l\in \mathbb{Z}$ for all $k$ and some $q\left(k\right)\in \mathbb{N}$ which depends on $k$.

Recently, Cilleruelo, Kumchev, Luca, Rué and Shparlinski proved that for each integer a ≥ 2 the sequence of fractional parts ${aⁿ/n}_{n=1}^{\infty }$ is everywhere dense in the interval [0,1]. We prove a similar result for all Pisot numbers and Salem numbers α and show that for each c > 0 and each sufficiently large N, every subinterval of [0,1] of length $c{N}^{-0.475}$ contains at least one fractional part Q(αⁿ)/n, where Q is a nonconstant polynomial in ℤ[z] and n is an integer satisfying 1 ≤ n ≤ N.

Soit $D^{*}\left(N\right)$ la discrépance “à l’origine” de la suite $\left(\left\{n\frac{1+\sqrt{5}}{2}\right\}\right)$. Nous montrons que $lim\; sup\frac{D^{*}\left(N\right)}{\mathrm{Log}N}=\frac{3}{20}{\left(\mathrm{Log}\frac{1+\sqrt{5}}{2}\right)}^{-1}=0.31\cdots$, quantité inférieure à celle correspondant à la suite de van der Corput. Les techniques utilisées sont celles liées au développement en fraction continue.

On étudie la discrépance absolue de la suite de Farey d’ordre $n$ et on montre, en utilisant notamment une majoration d’une intégrale portant sur la fonction sommatoire de la fonction de Möbius, qu’elle est égale à $\frac{1}{n}$ exactement, ce qui est la valeur locale au point d’abscisse $\frac{1}{n}$.