Normal numbers generated using the smallest prime factor function (Q2258228): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40316-014-0022-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010122233 / rank
 
Normal rank

Revision as of 00:57, 20 March 2024

scientific article
Language Label Description Also known as
English
Normal numbers generated using the smallest prime factor function
scientific article

    Statements

    Normal numbers generated using the smallest prime factor function (English)
    0 references
    0 references
    0 references
    3 March 2015
    0 references
    In a series of recent papers [Bull. Aust. Math. Soc. 84, No. 2, 337--349 (2011; Zbl 1231.11086); Ann. Sci. Math. Qué. 36, No. 2, 349--359 (2012; Zbl 1295.11081); Bull. Aust. Math. Soc. 88, No. 1, 158--168 (2013; Zbl 1282.11089)], the authors constructed large families of normal numbers using the distribution of the values of the largest prime factor function. Given an integer \(q\geq 2\), an irrational number \(\eta\) is called a \(q\)-normal number if the \(q\)-ary expansion of \(\eta\) is such that any preassigned sequence of length \(k\geq 1\), taken within this expansion, occurs with the expected limiting frequency, namely \(1/q^k\). It is shown that a concatenation of the successive values of \(p(n)\) can yield a normal number, where \(p(n)\) stands for the smallest prime factor of \(n\). This idea is expanded to create various large families of normal numbers.
    0 references
    0 references
    normal numbers
    0 references
    smallest prime factor
    0 references

    Identifiers