We show that if p ≠ 5 is a prime, then the numbers $1/p\left(\genfrac{}{}{0pt}{}{p}{m₁,...,m_t}\right)|t\ge 1,m_i\ge 0fori=1,...,tand{\sum }_{i=1}^t{m}_i=p$ cover all the nonzero residue classes modulo p.

Récemment, B. Green et T. Tao ont montré que : l’ensemble des nombres premiers contient des progressions arithmétiques de toutes longueurs répondant ainsi à une question ancienne à la formulation particulièrement simple. La démonstration n’utilise aucune des méthodes “transcendantes” ni aucun des grands théorèmes de la théorie analytique des nombres. Elle est écrite dans un esprit proche de celui de la théorie ergodique, en particulier de celui de la preuve par Furstenberg du théorème de Szemerédi,...

The paper extends the results given by M. Křížek and L. Somer, On a connection of number theory with graph theory, Czech. Math. J. 54 (129) (2004), 465–485 (see [5]). For each positive integer $n$ define a digraph $\Gamma \left(n\right)$ whose set of vertices is the set $H=\{0,1,\cdots ,n-1\}$ and for which there is a directed edge from $a\in H$ to $b\in H$ if $a^3\equiv b(modn).$ The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph $\Gamma \left(n\right)$ is proved. The formula for the number of fixed points of $\Gamma \left(n\right)$ is established....

Topological and combinatorial properties of dynamical systems called odometers and arising from number systems are investigated. First, a topological classification is obtained. Then a rooted tree describing the carries in the addition of 1 is introduced and extensively studied. It yields a description of points of discontinuity and a notion of low scale, which is helpful in producing examples of what the dynamics of an odometer can look like. Density of the orbits is also discussed.

We show that if a > 1 is any fixed integer, then for a sufficiently large x>1, the nth Cullen number Cₙ = n2ⁿ +1 is a base a pseudoprime only for at most O(x log log x/log x) positive integers n ≤ x. This complements a result of E. Heppner which asserts that Cₙ is prime for at most O(x/log x) of positive integers n ≤ x. We also prove a similar result concerning the pseudoprimality to base a of the Woodall numbers given by Wₙ = n2ⁿ - 1 for all n ≥ 1.

We give several different $q$-analogues of the following two congruences of Z.-W. Sun: $$\sum _{k=0}^{(p^r-1)/2}\frac{1}{8^k}\left(\genfrac{}{}{0pt}{}{2k}{k}\right)\equiv \left(\frac{2}{p^r}\right)(mod{p}^2)\text{and}\sum _{k=0}^{(p^r-1)/2}\frac{1}{{16}^k}\left(\genfrac{}{}{0pt}{}{2k}{k}\right)\equiv \left(\frac{3}{p^r}\right)(mod{p}^2),$$ where $p$ is an odd prime, $r$ is a positive integer, and $\left(\frac{m}{n}\right)$ is the Jacobi symbol. The proofs of them require the use of some curious $q$-series identities, two of which are related to Franklin’s involution on partitions into distinct parts. We also confirm a conjecture of the latter author and Zeng in 2012.