|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{for|the floating-point meaning in computing|normal number (computing)}}
| | After you've your desired number most typically associated with gems, you can get yourself prepared intelligently to fight myself against any capacity you like. This particular really is exciting since it aids you enjoy like a veteran and you can malfunction just about anyone should a playing skills are solid.<br><br>Develop a gaming program to deal with. Similar to recommended assignments time, this training video game program will improve manage a child's lifestyle. When the times have been set, stick to all the schedule. Do Hardly back as a cause of whining or selling. The schedule is only efficient if you just keep going.<br><br>Gemstone are known as your [http://Www.Google.com/search?q=games+primary&btnI=lucky games primary] forex. The Jewels are often purchase resources along among speeding up numerous vitally important tasks. The Other jewels can also be used to buy bonus items. Apart from that, additionally, it can let the leader seen any undesired debris when you want to obtain a much more gems. Players may very well obtain Gems through answering numerous tasks or it could be that using the clash of clans get into available online.<br><br>Battle of Clans is definitely a popular sport made to end up being brandished on multiple systems, the car . iOS and also operating system. The overall game is incredibly intriguing but presently there comes a spot associated with legend, where the player gets trapped because of not enough gems. However, this problem is becoming able to easily end up resolved.<br><br>Most of us can use this approach to acquisition the majority of any time in the course of 1hr and one day. For archetype to acquisition the majority of dispatch up 4 a too long time, acting x equals 15, 400 abnormal and / or you receive y equals 51 gems.<br><br>Furthermore question the extent what it''s a 'strategy'" game. A good moron without strategy in virtually any respect will advance amongst gamers over time. So long as you will sign in occasionally as well as be sure your digital 'builders'" are building something, your game power could increase. That''s most there's going without training shoes. Individuals who're the most effective each of us in the game are, typically, those who are actually playing a long, plus those who gave real cash to buy extra builders. (Applying two builders, an greater one can possibly may easily be obtained for 500 gems which cost $4.99 and the next one costs 1000 gems.) When it comes to four builders, you 'll advance amongst people about doubly as fast whereas a guy with a set of builders.<br><br>A lot of our options are screened and approved from the finest virus recognition software and so anti-virus in the market to ensure a security-level as large as you can, in case you fear for protection of your computer or perhaps your cellular device, no situations. In case you cherished this informative article as well as you wish to acquire more information with regards to [http://Prometeu.net/ clash of clans hacks] generously check out our webpage. In case you nevertheless have nearly doubts, take a glance at the movie and you'll focus on it operates and it's not 100% secure! It will only take a few moments of energy! |
| | |
| In [[mathematics]], a '''normal number''' is a [[real number]] whose infinite sequence of [[positional notation|digits]] in every [[radix|base]] <var>b</var><ref>The only bases considered here are natural numbers greater than 1</ref> is distributed uniformly in the sense that each of the <var>b</var> digit values has the same [[natural density]] 1/<var>b</var>, also all possible <var>b</var><sup>2</sup> pairs of digits are equally likely with density <var>b</var><sup>−2</sup>, all <var>b</var><sup>3</sup> triplets of digits equally likely with density <var>b</var><sup>−3</sup>, etc.
| |
| | |
| In lay terms, this means that no digit, or combination of digits, occurs more frequently than any other, and this is true whether the number is written in base 10, binary, or any other base. A normal number can be thought of as an infinite sequence of coin flips ([[Binary number|binary]]) or rolls of a die (base 6). Even though there ''will'' be sequences such as 10, 100, or more consecutive tails (binary) or fives (base 6) or even 10, 100, or more repetitions of a sequence such as tail-head (two consecutive coin flips) or 6-1 (two consecutive rolls of a die), there will also be equally many of any other sequence of equal length. No digit or sequence is "favored".
| |
| | |
| While a general proof can be given that [[almost all]] real numbers are normal (in the sense that the set of exceptions has [[Lebesgue measure]] zero), this proof is not [[Constructive proof|constructive]] and only very few specific numbers have been shown to be normal. For example, it is widely believed that the numbers [[square root of 2|{{sqrt|2}}]], [[pi|π]], and ''[[e (mathematical constant)|e]]'' are normal, but a proof remains elusive.
| |
| | |
| == Definitions ==
| |
| Let Σ be a finite [[alphabet (computer science)|alphabet]] of ''b'' digits, and Σ<sup>∞</sup> the set of all [[sequence]]s that may be drawn from that alphabet. Let ''S'' ∈ Σ<sup>∞</sup> be such a sequence. For each ''a'' in Σ let ''N<sub>S</sub>''(''a'', ''n'') denote the number of times the letter ''a'' appears in the first ''n'' digits of the sequence ''S''. We say that ''S'' is '''simply normal''' if the [[limit of a sequence|limit]]
| |
| | |
| :<math>\lim_{n\to\infty} \frac{N_S(a,n)}{n} = \frac{1}{b}</math>
| |
| | |
| for each ''a''. Now let ''w'' be any finite [[String (computer science)#Formal theory|string]] in Σ<sup>∗</sup> and let ''N<sub>S</sub>''(''w'', ''n'') to be the number of times the string ''w'' appears as a [[substring]] in the first ''n'' digits of the sequence ''S''. (For instance, if ''S'' = 01010101..., then ''N<sub>S</sub>''(010, 8) = 3.) ''S'' is '''normal''' if, for all finite strings ''w'' ∈ Σ<sup>∗</sup>,
| |
| | |
| :<math>\lim_{n\to\infty} \frac{N_S(w,n)}{n} = \frac{1}{b^{|w|}}</math>
| |
| | |
| where | ''w'' | denotes the length of the string ''w''.
| |
| In other words, ''S'' is normal if all strings of equal length occur with equal [[Asymptotic analysis|asymptotic]] frequency. For example, in a normal binary sequence (a sequence over the alphabet {0,1}), 0 and 1 each occur with frequency <sup>1</sup>⁄<sub>2</sub>; 00, 01, 10, and 11 each occur with frequency <sup>1</sup>⁄<sub>4</sub>; 000, 001, 010, 011, 100, 101, 110, and 111 each occur with frequency <sup>1</sup>⁄<sub>8</sub>, etc. Roughly speaking, the [[probability]] of finding the string ''w'' in any given position in ''S'' is precisely that expected if the sequence had been produced at [[random sequence|random]].
| |
| | |
| Suppose now that ''b'' is an [[integer]] greater than 1 and ''x'' is a [[real number]]. Consider the infinite digit sequence expansion ''S<sub>x, b</sub>'' of ''x'' in the base ''b'' [[numeral system|positional number system]] (we ignore the decimal point). We say that ''x'' is '''simply normal in base ''b''''' if the sequence ''S<sub>x, b</sub>'' is simply normal<ref name=Bug78>{{harvnb|Bugeaud|2012|p=78}}</ref> and that ''x'' is '''normal in base ''b''''' if the sequence ''S<sub>x, b</sub>'' is normal.<ref name=Bug79>{{harvnb|Bugeaud|2012|p=79}}</ref> The number ''x'' is called a '''normal number''' (or sometimes an '''absolutely normal number''') if it is normal in base ''b'' for every integer ''b'' greater than 1.<ref name=Bug102>{{harvnb|Bugeaud|2012|p=102}}</ref><ref name=AB413>{{harvnb|Adamczewski|Bugeaud|2010|p=413}}</ref>
| |
| | |
| A given infinite sequence is either normal or not normal, whereas a real number, having a different base-''b'' expansion for each integer ''b'' ≥ 2, may be normal in one base but not in another.<ref name=Cas59>{{harvnb|Cassels|1959}}</ref><ref name=Sch60>{{harvnb|Schmidt|1960}}</ref> For bases ''r'' and ''s'' with log ''r'' / log ''s'' rational (so that ''r'' = ''b''<sup>''m''</sup> and ''s'' = ''b''<sup>''n''</sup>) every number normal in base ''r'' is normal in base ''s''. For bases ''r'' and ''s'' with log ''r'' / log ''s'' irrational, there are uncountably many numbers normal in each base but not the other.<ref name=Sch60/>
| |
| | |
| A [[disjunctive sequence]] is a sequence in which every finite string appears. A normal sequence is disjunctive, but a disjunctive sequence need not be normal. A ''[[rich number]]'' in base ''b'' is one whose expansion in base ''b'' is disjunctive:<ref name=Bug92>{{harvnb|Bugeaud|2012|p=92}}</ref> one that is disjunctive to every base is called ''absolutely disjunctive'' or is said to be a ''lexicon''. A lexicon contains all writings, which have been or will be ever written, in any possible language. A number normal in base ''b'' is rich in base ''b'', but not necessarily conversely. The real number ''x'' is rich in base ''b'' if and only if the set { ''x b<sup>n</sup>'' mod 1} is [[Dense set|dense]] in the [[unit interval]].<ref name=Bug92/>
| |
| | |
| We defined a number to be simply normal in base ''b'' if each individual digit appears with frequency 1/''b''. For a given base ''b'', a number can be simply normal (but not normal or ''b''-dense), ''b''-dense (but not simply normal or normal), normal (and thus simply normal and ''b''-dense), or none of these. A number is '''absolutely non-normal''' or '''absolutely abnormal''' if it is not simply normal in any base.<ref name=Bug102/><ref name=Martin2001>{{harvtxt|Martin|2001}}</ref>
| |
| | |
| == Properties and examples == | |
| The concept of a normal number was introduced by [[Émile Borel]] in 1909. Using the [[Borel-Cantelli lemma]], he proved the normal number theorem: [[almost all]] real numbers are normal, in the sense that the set of non-normal numbers has [[Lebesgue measure]] zero (Borel 1909). This theorem established the existence of normal numbers. In 1917, [[Wacław Sierpiński]] showed that it is possible to specify a particular such number. Becher and Figueira proved in 2002 that there is a [[computable number|computable]] normal number (no digits of their number are known, however).
| |
| | |
| The set of non-normal numbers, though "small" in the sense of being a [[null set]], is "large" in the sense of being [[uncountable]]. For instance, there are uncountably many numbers whose decimal expansion does not contain the digit 5, and none of these are normal.
| |
| | |
| [[Champernowne constant|Champernowne's number]]
| |
| : 0.1234567891011121314151617...,
| |
| obtained by concatenating the decimal representations of the natural numbers in order, is normal in base 10, but it might not be normal in some other bases.
| |
| | |
| The [[Copeland–Erdős constant]]
| |
| : 0.235711131719232931374143...,
| |
| obtained by concatenating the [[prime number]]s in base 10, is normal in base 10, as proved by Copeland and Erdős (1946). More generally, the latter authors proved that the real number represented in base ''b'' by the concatenation
| |
| : 0.''f''(1)''f''(2)''f''(3)...,
| |
| where ''f''(''n'') is the ''n''<sup>th</sup> prime expressed in base ''b'', is normal in base ''b''. [[Abram Samoilovitch Besicovitch|Besicovitch]] (1935) proved that the number represented by the same expression, with ''f''(''n'') = ''n''<sup>2</sup>,
| |
| : 0.149162536496481100121144...,
| |
| obtained by concatenating the [[square number]]s in base 10, is normal in base 10. Davenport & Erdős (1952) proved that the number represented by the same expression, with ''f'' being any polynomial whose values on the positive integers are positive integers, expressed in base 10, is normal in base 10.
| |
| | |
| Nakai & Shiokawa (1992) proved that if ''f''(''x'') is any non-constant [[polynomial]] with real coefficients such that ''f''(''x'') > 0 for all ''x'' > 0, then the real number represented by the concatenation
| |
| : 0.[''f''(1)][''f''(2)][''f''(3)]...,
| |
| where [''f''(''n'')] is the [[Floor and ceiling functions|integer part]] of ''f''(''n'') expressed in base ''b'', is normal in base ''b''. (This result includes as special cases all of the above-mentioned results of Champernowne, Besicovitch, and Davenport & Erdős.) The authors also show that the same result holds even more generally when ''f'' is any function of the form
| |
| : ''f''(''x'') = α·''x''<sup>β</sup> + α<sub>1</sub>·''x''<sup>β<sub>1</sub></sup> + ... + α<sub>''d''</sub>·''x''<sup>β<sub>''d''</sub></sup>,
| |
| where the αs and βs are real numbers with β > β<sub>1</sub> > β<sub>2</sub> > ... > β<sub>d</sub> ≥ 0, and ''f''(''x'') > 0 for all ''x'' > 0. | |
| | |
| Every [[Chaitin's constant]] <math>\ \Omega</math> is a normal number (Calude, 1994).
| |
| A [[computable number|computable]] normal number was constructed in (Becher 2002). Although these constructions do not directly give the digits of the numbers constructed, the second shows that it is possible in principle to enumerate all the digits of a particular normal number.
| |
| | |
| Bailey and Crandall show an explicit [[uncountably infinite]] class of ''b''-normal numbers by perturbing [[Stoneham number]]s.<ref name="BaileyCrandall2002">{{harvtxt|Bailey|Crandall|2002}}.</ref>
| |
| | |
| It has been an elusive goal to prove the normality of numbers which were not explicitly constructed for the purpose. It is for instance unknown whether [[square root of 2|{{sqrt|2}}]], [[pi|π]], [[natural logarithm of 2|ln(2)]] or [[e (mathematical constant)|e]] is normal (but all of them are strongly conjectured to be normal, because of some empirical evidence). It is not even known whether all digits occur infinitely often in the decimal expansions of those constants. It has been conjectured that every [[irrational number|irrational]] [[algebraic number]] is normal; while no counterexamples are known, there also exists no algebraic number that has been proven to be normal in any base.
| |
| | |
| ===Non-normal numbers===
| |
| No [[rational number]] is normal to any base, since the digit sequences of rational numbers are [[Repeating decimal|eventually periodic]].<ref>{{harvtxt|Murty|2007|p=483}}.</ref>
| |
| | |
| {{harvnb|Martin|2001}} has given a simple example of an irrational absolutely non-normal number.<ref name=Bug113>Bugeaud (2012) p.113</ref> Let ''d''<sub>2</sub> = 4 and
| |
| | |
| :<math>d_{j} = j^{d_{j-1} / (j-1)} \ , </math>
| |
| :<math>\xi = \prod_{j=2}^\infty \left({1 - \frac{1}{d_j}}\right) \ . </math>
| |
| | |
| Then ξ is absolutely non-normal and a [[Liouville number]]; hence a [[transcendental number]].
| |
| | |
| ===Properties===
| |
| Additional properties of normal numbers include:
| |
| | |
| * Every positive number ''x'' is the product of two normal numbers. For instance if ''y'' is [[Uniform distribution (continuous)|chosen uniformly at random]] from the interval (0,1) then [[almost surely]] ''y'' and ''x''/''y'' are both normal, and their product is ''x''.
| |
| | |
| * If ''x'' is normal in base ''b'' and ''q'' ≠ 0 is a rational number, then <math>x \cdot q</math> is normal in base ''b''. (Wall 1949)
| |
| | |
| * If <math>A\subseteq\N</math> is ''dense'' (for every <math>\alpha<1</math> and for all sufficiently large ''n'', <math>|A \cap \{1,\ldots,n\}| \geq n^\alpha</math>) and <math>a_1,a_2,a_3,\ldots</math> are the base-''b'' expansions of the elements of ''A'', then the number <math>0.a_1a_2a_3\ldots</math>, formed by concatenating the elements of ''A'', is normal in base ''b'' (Copeland and Erdős 1946). From this it follows that Champernowne's number is normal in base 10 (since the set of all positive integers is obviously dense) and that the Copeland-Erdős constant is normal in base 10 (since the [[prime number theorem]] implies that the set of primes is dense).
| |
| | |
| * A sequence is normal [[if and only if]] every ''block'' of equal length appears with equal frequency. (A block of length ''k'' is a substring of length ''k'' appearing at a position in the sequence that is a multiple of ''k'': e.g. the first length-''k'' block in ''S'' is ''S''[1..''k''], the second length-''k'' block is ''S''[''k''+1..2''k''], etc.) This was implicit in the work of Ziv and Lempel (1978) and made explicit in the work of Bourke, Hitchcock, and Vinodchandran (2005).
| |
| | |
| * A number is normal in base ''b'' if and only if it is simply normal in base ''b<sup>k</sup>'' for every integer <math>k \geq 1</math>. This follows from the previous block characterization of normality: Since the n<sup>th</sup> block of length ''k'' in its base ''b'' expansion corresponds to the n<sup>th</sup> digit in its base ''b<sup>k</sup>'' expansion, a number is simply normal in base ''b<sup>k</sup>'' if and only if blocks of length ''k'' appear in its base ''b'' expansion with equal frequency.
| |
| | |
| * A number is normal if and only if it is simply normal in every base. This follows from the previous characterization of base ''b'' normality.
| |
| | |
| * A number is ''b''-normal if and only if there exists a set of positive integers <math>m_1<m_2<m_3<\cdots</math> where the number is simply normal to bases ''b''<sup>''m''</sup> for all <math>m\in\{m_1,m_2,\ldots\}.</math><ref>{{harvtxt|Long|1957}}.</ref> No finite set suffices to show that the number is ''b''-normal.
| |
| | |
| * The set of normal sequences is '''closed under finite variations''': adding, removing, or changing a [[finite set|finite]] number of digits in any normal sequence leaves it normal.
| |
| | |
| == Connection to finite-state machines ==
| |
| Agafonov showed an early connection between [[finite-state machine]]s and normal sequences: every infinite subsequence selected from a normal sequence by a [[regular language]] is also normal. In other words, if one runs a finite-state machine on a normal sequence, where each of the finite-state machine's states are labeled either "output" or "no output", and the machine outputs the digit it reads next after entering an "output" state, but does not output the next digit after entering a "no output state", then the sequence it outputs will be normal (Agafonov 1968).
| |
| | |
| A deeper connection exists with finite-state gamblers (FSGs) and information lossless finite-state compressors (ILFSCs).
| |
| | |
| <ul>
| |
| <li> A '''finite-state gambler''' (a.k.a. '''finite-state [[martingale (probability theory)|martingale]]''') is a finite-state machine over a finite alphabet <math>\Sigma</math>, each of whose states is labelled with percentages of money to bet on each digit in <math>\Sigma</math>. For instance, for an FSG over the binary alphabet <math>\Sigma = \{0,1\}</math>, the current state ''q'' bets some percentage <math>q_0 \in [0,1]</math> of the gambler's money on the bit 0, and the remaining <math>q_1 = 1-q_0</math> fraction of the gambler's money on the bit 1. The money bet on the digit that comes next in the input (total money times percent bet) is multiplied by <math>|\Sigma|</math>, and the rest of the money is lost. After the bit is read, the FSG transitions to the next state according to the input it received. A FSG ''d'' '''succeeds''' on an infinite sequence ''S'' if, starting from $1, it makes unbounded money betting on the sequence; i.e., if
| |
| | |
| :<math>\limsup_{n\to\infty} d(S \upharpoonright n) = \infty,</math>
| |
| | |
| where <math>d(S \upharpoonright n)</math> is the amount of money the gambler ''d'' has after reading the first ''n'' digits of ''S'' (see [[limit superior]]).
| |
| | |
| <li> A '''finite-state compressor''' is a finite-state machine with output strings labelling its [[state transition table|state transitions]], including possibly the empty string. (Since one digit is read from the input sequence for each state transition, it is necessary to be able to output the empty string in order to achieve any compression at all). An information lossless finite-state compressor is a finite-state compressor whose input can be uniquely recovered from its output and final state. In other words, for a finite-state compressor ''C'' with state set ''Q'', ''C'' is information lossless if the function <math>f: \Sigma^* \to \Sigma^* \times Q</math>, mapping the input string of ''C'' to the output string and final state of ''C'', is [[Injective function|1-1]]. Compression techniques such as [[Huffman coding]] or [[Shannon-Fano coding]] can be implemented with ILFSCs. An ILFSC ''C'' '''compresses''' an infinite sequence ''S'' if
| |
| | |
| :<math>\liminf_{n\to\infty} \frac{|C(S \upharpoonright n)|}{n} < 1,</math>
| |
| | |
| where <math>|C(S \upharpoonright n)|</math> is the number of digits output by ''C'' after reading the first ''n'' digits of ''S''. Note that the [[data compression ratio|compression ratio]] (the [[limit inferior]] above) can always be made to equal 1 by the 1-state ILFSC that simply copies its input to the output.
| |
| | |
| </ul>
| |
| | |
| Schnorr and Stimm showed that no FSG can succeed on any normal sequence, and Bourke, Hitchcock and Vinodchandran showed the [[conversion (logic)|converse]]. Therefore:
| |
| :''A sequence is normal if and only if there is no finite-state gambler that succeeds on it''.
| |
| Ziv and Lempel showed:
| |
| :''A sequence is normal if and only if it is incompressible by any information lossless finite-state compressor''
| |
| (they actually showed that the sequence's optimal compression ratio over all ILFSCs is exactly its ''[[information entropy|entropy]] rate'', a quantitative measure of its deviation from normality, which is 1 exactly when the sequence is normal). Since the [[LZ78|LZ compression algorithm]] compresses asymptotically as well as any ILFSC, this means that the LZ compression algorithm can compress any non-normal sequence. (Ziv Lempel 1978)
| |
| | |
| These characterizations of normal sequences can be interpreted to mean that "normal" = "finite-state random"; i.e., the normal sequences are precisely those that appear random to any finite-state machine. Compare this with the [[algorithmically random sequence]]s, which are those infinite sequences that appear random to any algorithm (and in fact have similar gambling and compression characterizations with [[Turing machine]]s replacing finite-state machines).
| |
| | |
| == Connection to equidistributed sequences ==
| |
| A number ''x'' is normal in base ''b'' [[if and only if]] the sequence <math>{\left( b^k x \right) }_{k=0}^\infty</math> is [[Equidistributed sequence|equidistributed]] modulo 1,<ref name=Bug89>{{harvnb|Bugeaud|2012|p=89}}</ref><ref name=EPSW127>{{harvnb|Everest|van der Poorten|Shparlinski|Ward|2003|p=127}}</ref> or equivalently, using [[Weyl's criterion]], if and only if
| |
| :<math>\lim_{n\rightarrow\infty}\frac{1}{n}\sum_{k=0}^{n-1}e^{2 \pi i m b^k x}=0 \quad\text{ for all integers } m\geq 1.</math>
| |
| | |
| This connection leads to the terminology that ''x'' is normal in base β for any real number β if the sequence <math>\left({x \beta^k}\right)_{k=0}^\infty</math> is equidistributed modulo 1.<ref name=EPSW127/>
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==References==
| |
| {{refbegin|2}}
| |
| *{{citation | last1=Adamczewski | first1=Boris | last2=Bugeaud | first2=Yann | chapter=8. Transcendence and diophantine approximation | editor1-last=Berthé | editor1-first=Valérie | editor2-last=Rigo | editor2-first=Michael | title=Combinatorics, automata, and number theory | location=Cambridge | publisher=[[Cambridge University Press]] | series=Encyclopedia of Mathematics and its Applications | volume=135 | pages=410–451 | year=2010 | isbn=978-0-521-51597-9 | zbl=pre05879512 }}
| |
| *{{citation
| |
| | last = Agafonov | first = V. N.
| |
| | journal = [[Proceedings of the USSR Academy of Sciences|Soviet Mathematics Doklady]]
| |
| | pages = 324–325
| |
| | title = Normal sequences and finite automata
| |
| | volume = 9
| |
| | year = 1968}}.
| |
| *{{citation
| |
| | last1 = Bailey | first1 = D. H. | author1-link = David H. Bailey
| |
| | last2 = Crandall | first2 = R. E. | author2-link = Richard Crandall
| |
| | journal = [[Experimental Mathematics (journal)|Experimental Mathematics]]
| |
| | pages = 175–190
| |
| | title = On the random character of fundamental constant expansions
| |
| | url = http://www.nersc.gov/~dhbailey/dhbpapers/baicran.pdf
| |
| | volume = 10
| |
| | year = 2001}}.
| |
| *{{citation
| |
| | last1 = Bailey | first1 = D. H. | author1-link = David H. Bailey
| |
| | last2 = Crandall | first2 = R. E. | author2-link = Richard Crandall
| |
| | issue = 4
| |
| | journal = Experimental Mathematics
| |
| | pages = 527–546
| |
| | title = Random generators and normal numbers
| |
| | url = http://www.emis.de/journals/EM/expmath/volumes/11/11.4/pp527_546.pdf
| |
| | volume = 11
| |
| | year = 2002}}.
| |
| *{{citation
| |
| | last1 = Bailey | first1 = D. H. | author1-link = David H. Bailey
| |
| | last2 = Misiurewicz | first2 = M. | author2-link = Michał Misiurewicz
| |
| | issue = 9
| |
| | journal = [[Proceedings of the American Mathematical Society]]
| |
| | pages = 2495–2501
| |
| | title = A strong hot spot theorem
| |
| | url = http://repositories.cdlib.org/lbnl/LBNL-53656_Journal/
| |
| | volume = 134
| |
| | year = 2006
| |
| | doi = 10.1090/S0002-9939-06-08551-0}}.
| |
| *{{citation
| |
| | last1 = Becher | first1 = V.
| |
| | last2 = Figueira | first2 = S.
| |
| | doi = 10.1016/S0304-3975(01)00170-0
| |
| | journal = Theoretical Computer Science
| |
| | pages = 947–958
| |
| | title = An example of a computable absolutely normal number
| |
| | volume = 270
| |
| | year = 2002}}.
| |
| *{{citation
| |
| | last = Besicovitch | first = A. S. | author-link = Abram Samoilovitch Besicovitch
| |
| | journal = Mathematische Zeitschrift
| |
| | pages = 146–156
| |
| | title = The asymptotic distribution of the numerals in the decimal representation of the squares of the natural numbers
| |
| | volume = 39
| |
| | year = 1935
| |
| | doi = 10.1007/BF01201350}}.
| |
| *{{citation
| |
| | last = Borel | first = E. | author-link = Émile Borel
| |
| | journal = [[Rendiconti del Circolo Matematico di Palermo]]
| |
| | pages = 247–271
| |
| | title = Les probabilités dénombrables et leurs applications arithmétiques
| |
| | volume = 27
| |
| | year = 1909
| |
| | doi = 10.1007/BF03019651}}.
| |
| *{{citation
| |
| | last1 = Bourke | first1 = C.
| |
| | last2 = Hitchcock | first2 = J. M.
| |
| | last3 = Vinodchandran | first3 = N. V.
| |
| | doi = 10.1016/j.tcs.2005.09.040
| |
| | issue = 3
| |
| | journal = Theoretical Computer Science
| |
| | pages = 392–406
| |
| | title = Entropy rates and finite-state dimension
| |
| | volume = 349
| |
| | year = 2005}}.
| |
| *{{citation | last=Bugeaud | first=Yann | title=Distribution modulo one and Diophantine approximation | series=Cambridge Tracts in Mathematics | volume=193 | location=Cambridge | publisher=[[Cambridge University Press]] | year=2012 | isbn=978-0-521-11169-0 | zbl=pre06066616 }}
| |
| *{{citation
| |
| | last = Calude | first = C. | author-link = Cristian S. Calude
| |
| | contribution = Borel normality and algorithmic randomness
| |
| | editor1-last = Rozenberg | editor1-first = G.
| |
| | editor2-last = Salomaa | editor2-first = Arto | editor2-link=Arto Salomaa
| |
| | title = [[International Conference on Developments in Language Theory|Developments in Language Theory: At the Crossroads of Mathematics, Computer Science and Biology]]
| |
| | pages = 113–119
| |
| | publisher = [[World Scientific]], Singapore
| |
| | year = 1994}}.
| |
| *{{citation
| |
| | last1 = Calude | first1 = C.S.| author-link = Cristian S. Calude
| |
| | last2 = Zamfirescu | first2 = T.
| |
| | issue = Supplement
| |
| | journal = Publicationes Mathematicae Debrecen
| |
| | pages = 619–623
| |
| | title = Most numbers obey no probability laws
| |
| | volume = 54,
| |
| | year = 1999}}.
| |
| *{{citation
| |
| | last = Cassels | first = J. W. S. | author-link = J. W. S. Cassels
| |
| | journal = Colloquium Mathematicum
| |
| | pages = 95–101
| |
| | title = On a problem of Steinhaus about normal numbers
| |
| | volume = 7
| |
| | year = 1959}}.
| |
| *{{citation
| |
| | last = Champernowne | first = D. G. | author-link = D. G. Champernowne
| |
| | doi = 10.1112/jlms/s1-8.4.254
| |
| | journal = [[London Mathematical Society|Journal of the London Mathematical Society]]
| |
| | pages = 254–260
| |
| | title = The construction of decimals normal in the scale of ten
| |
| | volume = 8
| |
| | year = 1933
| |
| | issue = 4}}.
| |
| *{{citation
| |
| | last1 = Copeland | first1 = A. H. | author1-link = Arthur Herbert Copeland
| |
| | last2 = Erdős | first2 = P. | author2-link = Paul Erdős
| |
| | doi = 10.1090/S0002-9904-1946-08657-7
| |
| | journal = [[Bulletin of the American Mathematical Society]]
| |
| | pages = 857–860
| |
| | title = Note on normal numbers
| |
| | volume = 52
| |
| | year = 1946
| |
| | issue = 10}}.
| |
| * {{citation | last1=Dajani | first1=Karma | last2=Kraaikamp | first2=Cor | title=Ergodic theory of numbers | series=[[Carus Mathematical Monographs]] | volume=29 | location=Washington, DC | publisher=[[Mathematical Association of America]] | year=2002 | isbn=0-88385-034-6 | zbl=1033.11040 }}.
| |
| *{{citation
| |
| | last1 = Davenport | first1 = H. | author1-link = Harold Davenport
| |
| | last2 = Erdős | first2 = P. | author2-link = Paul Erdős
| |
| | doi = 10.4153/CJM-1952-005-3
| |
| | journal = [[Canadian Journal of Mathematics]]
| |
| | pages = 58–63
| |
| | title = Note on normal decimals
| |
| | volume = 4
| |
| | year = 1952}}.
| |
| * {{citation | last1=Everest | first1=Graham | last2=van der Poorten | first2=Alf | author2-link=Alfred van der Poorten | last3=Shparlinski | first3=Igor | last4=Ward | first4=Thomas | title=Recurrence sequences | series=Mathematical Surveys and Monographs | volume=104 | location=[[Providence, RI]] | publisher=[[American Mathematical Society]] | year=2003 | isbn=0-8218-3387-1 | zbl=1033.11006 }}.
| |
| *{{citation
| |
| | last1= Khoshnevisan
| |
| | first1 = Davar
| |
| | title = Normal numbers are normal
| |
| | year = 2006
| |
| | journal = [[Clay Mathematics Institute]] Annual Report 2006
| |
| | pages= 15, continued pp. 27–31
| |
| | url = http://www.claymath.org/library/annual_report/ar2006/06report_normalnumbers.pdf
| |
| }}.
| |
| *{{citation
| |
| | last = Long | first = C. T.
| |
| | issue = 2
| |
| | journal = [[Pacific Journal of Mathematics]]
| |
| | pages = 1163–1165
| |
| | title = Note on normal numbers
| |
| | url = http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.pjm/1103043507
| |
| | volume = 7
| |
| | year = 1957}}.
| |
| *{{citation | last=Martin | first=G. | year=2001 | title=Absolutely abnormal numbers | journal=[[American Mathematical Monthly]] | volume=108 | pages=746–754 }}
| |
| *{{citation
| |
| | title = Problems in analytic number theory
| |
| | last1= Murty
| |
| | first1= Maruti Ram
| |
| | edition= 2
| |
| | publisher= Springer
| |
| | year = 2007
| |
| | isbn = 0-387-72349-8
| |
| }}.
| |
| *{{citation
| |
| | last1 = Nakai | first1 = Y. | author1-link = Yoshinobu Nakai
| |
| | last2 = Shiokawa | first2 = I. | author2-link = Iekata Shiokawa
| |
| | journal = [[Acta Arithmetica]]
| |
| | pages = 271–284
| |
| | title = Discrepancy estimates for a class of normal numbers
| |
| | volume = 62
| |
| | issue = 3
| |
| | year = 1992}}.
| |
| *{{citation
| |
| | last = Schmidt | first = W. | author-link = Wolfgang M. Schmidt
| |
| | journal = Pacific Journal of Mathematics
| |
| | pages = 661–672
| |
| | title = On normal numbers
| |
| | url = http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.pjm/1103038420
| |
| | volume = 10
| |
| | year = 1960}}.
| |
| *{{citation
| |
| | last1 = Schnorr | first1 = C. P. | author1-link = Claus P. Schnorr
| |
| | last2 = Stimm | first2 = H.
| |
| | doi = 10.1007/BF00289514
| |
| | journal = Acta Informatica
| |
| | pages = 345–359
| |
| | title = Endliche Automaten und Zufallsfolgen
| |
| | volume = 1
| |
| | year = 1972
| |
| | issue = 4}}.
| |
| *{{citation
| |
| | last = Sierpiński | first = W. | author-link = Wacław Sierpiński
| |
| | journal = Bulletin de la Société Mathématique de France
| |
| | pages = 125–144
| |
| | title = Démonstration élémentaire d'un théorème de M. Borel sur les nombres absolutment normaux et détermination effective d'un tel nombre
| |
| | volume = 45
| |
| | year = 1917}}.
| |
| *{{citation
| |
| | last = Wall | first = D. D. | author-link = Donald Dines Wall
| |
| | location = Berkeley, California
| |
| | publisher = University of California
| |
| | series = Ph.D. thesis
| |
| | title = Normal Numbers
| |
| | year = 1949}}.
| |
| *{{citation
| |
| | last1 = Ziv | first1 = J. | author1-link = Jacob Ziv
| |
| | last2 = Lempel | first2 = A. | author2-link = Abraham Lempel
| |
| | doi = 10.1109/TIT.1978.1055934
| |
| | journal = [[IEEE Transactions on Information Theory]]
| |
| | pages = 530–536
| |
| | title = Compression of individual sequences via variable-rate coding
| |
| | url = http://citeseer.ist.psu.edu/ziv78compression.html
| |
| | volume = 24
| |
| | year = 1978
| |
| | issue = 5}}.
| |
| {{refend|2}}
| |
| | |
| ==Further reading==
| |
| *{{citation | last=Harman | first=Glyn | authorlink=Glyn Harman | chapter=One hundred years of normal numbers | editor1-last=Bennett | editor1-first=M. A. | editor2-last=Berndt | editor2-first=B.C. | editor2-link=Bruce C. Berndt | editor3-last=Boston | editor3-first=N. | editor3-link=Nigel Boston | editor4-last=Diamond | editor4-first=H.G. | editor5-last=Hildebrand | editor5-first=A.J. | editor6-last=Philipp | editor6-first=W. | title=Surveys in number theory: Papers from the millennial conference on number theory | location=Natick, MA | publisher=A K Peters | pages=57-74 | year=2002 | isbn=1-56881-162-4 | zbl=1062.11052 }}
| |
| *{{citation
| |
| | last = Quéfflec | first = Martine
| |
| | contribution = Old and new results on normality
| |
| | doi = 10.1214/074921706000000248
| |
| | editor1-last = Denteneer | editor1-first = Dee
| |
| | editor2-last = den Hollander | editor2-first = F.
| |
| | editor3-last = Verbitskiy | editor3-first = E.
| |
| | arxiv = math.DS/0608249
| |
| | location = Beachwood, Ohio
| |
| | pages = 225–236
| |
| | publisher = [[Institute of Mathematical Statistics]]
| |
| | series = IMS Lecture Notes – Monograph Series
| |
| | title = Dynamics & Stochastics: Festschrift in honor of M. S. Keane
| |
| | volume = 48
| |
| | year = 2006
| |
| | isbn = 0-940600-64-1
| |
| | zbl=1130.11041
| |
| }}
| |
| | |
| ==External links==
| |
| *[http://sprott.physics.wisc.edu/pickover/pimatrix.html We are in Digits of Pi and Live Forever] by [[Clifford A. Pickover]]
| |
| | |
| == See also ==
| |
| * [[Champernowne constant]]
| |
| * [[De Bruijn sequence]]
| |
| * [[Infinite monkey theorem]]
| |
| * [[The Library of Babel]]
| |
| * [[Illegal number]]
| |
| | |
| == External links ==
| |
| *{{MathWorld|title=Normal number|id=NormalNumber}}
| |
| | |
| [[Category:Number theory]]
| |
| [[Category:Sets of real numbers]]
| |