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
Multiplication par un entier d'une fraction continue périodique