Projects
Reading
People
Chat
SU\G
(đž)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Complexity of Leading Digit Sequences
Xinwei He
,
Adolf Hildebrand
,
Yuchen Li
,
Yunyi Zhang
Type:
Preprint
Publication Date:
2018-03-31
Citations:
0
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Complexity of Leading Digit Sequences
2018
Xinwei He
Adolf Hildebrand
Yuchen Li
Yunyi Zhang
+
PDF
Chat
The sum of digits of polynomial values in arithmetic progressions
2012
Thomas Stoll
+
The sum of digits of polynomial values in arithmetic progressions
2011
Thomas Stoll
+
The sum of digits of polynomial values in arithmetic progressions
2011
Thomas Stoll
+
PDF
Chat
The Number of Non-Zero Digits of n!
2002
Florian Luca
+
PDF
Chat
On the sum of digits of some sequences of integers
2012
Javier Cilleruelo
Florian Luca
Juanjo Rué
Ana ZumalacĂĄrregui
+
PDF
Chat
Counting numbers that are divisible by the product of their digits
2024
Qizheng He
Carlo Sanna
+
$B'$
2022
Yann Bugeaud
+
Arithmetic Progressions with Restricted Digits
2018
Aled Walker
Alexander Walker
+
Arithmetic Progressions with Restricted Digits
2018
Aled Walker
Alexander Walker
+
On the base $b$ expansion of the number of trailing zeroes of $b^k!$
2010
Antonio M. OllerâMarcĂ©n
JosĂ© MarĂa Grau
+
On the base $b$ expansion of the number of trailing zeroes of $b^k!$
2010
Antonio M. OllerâMarcĂ©n
J. M. Grau
+
On the base $b$ expansion of the number of trailing zeroes of $b^k!$
2010
Antonio M. OllerâMarcĂ©n
JosĂ© MarĂa Grau
+
Linear complexity of prime n-square sequences
2008
Young-Joon Kim
Hong-Yeop Song
+
On the minimal Hamming weight of a multi-base representation
2018
Daniel Krenn
Vorapong Suppakitpaisarn
Stephan M. Wagner
+
On the minimal Hamming weight of a multi-base representation
2018
Daniel Krenn
Vorapong Suppakitpaisarn
Stephan Wagner
+
PDF
Chat
Arithmetic Progressions with Restricted Digits
2020
Aled Walker
Alexander Walker
+
Numbers with Integer Complexity Close to the Lower Bound
2012
Harry Altman
Joshua Zelinsky
+
Numbers with Integer Complexity Close to the Lower Bound
2012
Harry Altman
Joshua Zelinsky
+
The sum of digits of $n$ and $n^2$
2010
K. G. Hare
S. Laishram
T. Stoll
Works That Cite This (0)
Action
Title
Year
Authors
Works Cited by This (17)
Action
Title
Year
Authors
+
An introduction to Benford's law
2015
Arno Berger
Theodore P. Hill
+
The First Digit Problem
1976
Ralph A. Raimi
+
Complexity of sequences and dynamical systems
1999
SĂ©bastien Ferenczi
+
PDF
Chat
The Significant-Digit Phenomenon
1995
Theodore P. Hill
+
PDF
Chat
The Distribution of Leading Digits and Uniform Distribution Mod 1
1977
Persi Diaconis
+
PDF
Chat
Complexity of infinite words associated with beta-expansions
2004
Christiane Frougny
Zuzana MasĂĄkovĂĄ
Edita PelantovĂĄ
+
PDF
Chat
Benfordâs law for coefficients of modular forms and partition functions
2010
Theresa C. Anderson
Larry Rolen
Ruth Stoehr
+
Fast growing sequences of numbers and the first digit phenomenon
2014
Bruno Massé
Dominique Schneider
+
PDF
Chat
Représentation géométrique de suites de complexité $2n+1$
1991
Pierre Arnoux
GĂ©rard Rauzy
+
Benford's Law
2012
Mark J. Nigrini