O násobení desetinných čísel
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Page 1 Next
Julián P. Vervaet (1886)
Časopis pro pěstování mathematiky a fysiky
Iurie Boreico, Daniel El-Baz, Thomas Stoll (2014)
Journal de Théorie des Nombres de Bordeaux
Let and denote by the sum-of-digits function in base . For considerIn 1983, F. M. Dekking conjectured that this quantity is greater than and, respectively, less than for infinitely many , thereby claiming an absence of a drift (or Newman) phenomenon. In this paper we prove his conjecture.
Florian Luca (2012)
Communications in Mathematics
We answer a question of Bednarek proposed at the 9th Polish, Slovak and Czech conference in Number Theory.
Thomas Stoll (2006)
Acta Arithmetica
Mordechai Lewin (1975)
Journal für die reine und angewandte Mathematik
P. Erdös, M. Joó, I. Joó (1992)
Bulletin de la Société Mathématique de France
Prodinger, Helmut (2000)
Integers
Kovács, Attila (1999)
Mathematica Pannonica
Joël Rivat (2009)
Journal de Théorie des Nombres de Bordeaux
The goal of this paper is to outline the proof of a conjecture of Gelfond [6] (1968) in a recent work in collaboration with Christian Mauduit [11] concerning the sum of digits of prime numbers, reflecting the lecture given in Edinburgh at the Journées Arithmétiques 2007.
János Galambos (1973)
Compositio Mathematica
Mordechay B. Levin, Meir Smorodinsky (2005)
Journal de Théorie des Nombres de Bordeaux
In this paper we extend Champernowne’s construction of normal numbers in base to the case and obtain an explicit construction of the generic point of the shift transformation of the set . We prove that the intersection of the considered lattice configuration with an arbitrary line is a normal sequence in base .
Christiane Frougny (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.
Christiane Frougny (2010)
RAIRO - Theoretical Informatics and Applications
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers β and γ respectively, such that β and γ are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.
Bodo Volkmann, Peter Szüsz (1983)
Journal für die reine und angewandte Mathematik
Gica, Alexandru, Panaitopol, Laurenţiu (2003)
Journal of Integer Sequences [electronic only]
Hubert Delange (1976)
Acta Arithmetica
Keith, Mike (1998)
Journal of Integer Sequences [electronic only]
David W. Boyd, Janice Cook, Patrick Morton (1989)
R. Buttsworth, K. Matthews (1990)
Acta Arithmetica
De Koninck, Jean-Marie, Luca, Florian (2005)
Integers
Page 1 Next