Integers with identical digits
Introduction à l'algorithme de Jacobi-Perron
Invariant measures and ergodic properties of number theoretical endomorphisms
Iterated Cesàro averages, frequencies of digits, and Baire category
Iterated digit sums, recursions and primality
We examine the congruences and iterate the digit sums of integer sequences. We generate recursive number sequences from triple and quintuple product identities. And we use second order recursions to determine the primality of special number systems.
Jak lze snáze a jistěji děliti nežli způsobem obyčejným?
Konvergenz von Teilen der harmonischen Reihe.
L'anneau... et l'algorithme euclidien.
Large and small gaps between consecutive Niven numbers.
Le p-pliage de papier
Lois nouvelles des puissances des nombres
Lucas sequences and repdigits
Let be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are and , respectively. We show that the Diophantine equation has only finitely many solutions in , where , is even and . Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral points on...
Lüroth-type alternating series representations for real numbers
Méthodes de crible et fonctions sommes des chiffres
Midy's theorem for periodic decimals.
Minimal redundant digit expansions in the gaussian integers
We consider minimal redundant digit expansions in canonical number systems in the gaussian integers. In contrast to the case of rational integers, where the knowledge of the two least significant digits in the “standard” expansion suffices to calculate the least significant digit in a minimal redundant expansion, such a property does not hold in the gaussian numbers : We prove that there exist pairs of numbers whose non-redundant expansions agree arbitrarily well but which have different least significant...
More on Divisibility Criteria for Selected Primes
This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].
Multidimensional Euclidean algorithms.
Multi-parametric extensions of Newman's phenomenon.
Multiplication par un entier d'une fraction continue périodique