On binary representations of integers with digits .
Prodinger, Helmut (2000)
Integers
Similarity:
Displaying similar documents to “Counting optimal joint digit expansions.”
On binary representations of integers with digits .
Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle.
Khovanova, Tanya, Lewis, Joel Brewster (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Signed bits and fast exponentiation
Wieb Bosma (2001)
Journal de théorie des nombres de Bordeaux
Similarity:
An exact analysis is given of the benefits of using the non-adjacent form representation for integers (rather than the binary representation), when computing powers of elements in a group in which inverting is easy. By counting the number of multiplications for a random exponent requiring a given number of bits in its binary representation, we arrive at a precise version of the known asymptotic result that on average one in three signed bits in the non-adjacent form is non-zero. This...
Counting Keith numbers.
Klazar, Martin, Luca, Florian (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Minimal percolating sets in bootstrap percolation.
Morris, Robert (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Berry-Esseen bounds for the number of maxima in planar regions.
Bai, Zhi-Dong, Hwang, Hsien-Kuei, Tsai, Tsung-Hsi (2003)
Electronic Journal of Probability [electronic only]
Similarity:
Completely q-multiplicative functions: the Mellin transform approach
Peter J. Grabner (1993)
Acta Arithmetica
Similarity:
A note on linear recurrent Mahler numbers.
Barat, Guy, Frougny, Christiane, Pethő, Attila (2005)
Integers
Similarity:
Palindromes in different bases: a conjecture of J. Ernest Wilkins.
Goins, Edray Herber (2009)
Integers
Similarity:
Jumping sequences.
Butler, Steve, Graham, Ron, Zang, Nan (2008)
Journal of Integer Sequences [electronic only]
Similarity:
The fraction of subspaces of with a specified number of minimal weight vectors is asymptotically Poisson.
Bender, Edward A., Canfield, E.Rodney (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On multiplicatively dependent linear numeration systems, and periodic points
Christiane Frougny (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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.