Normal numbers generated using the smallest prime factor function
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.
- Construction of normal numbers using the distribution of the kth largest prime factor
- Using large prime divisors to construct normal numbers
- The number of large prime factors of integers and normal numbers
- The number of prime factors function on shifted primes and normal numbers
- Construction of normal numbers by classified prime divisors of integers. II
- Construction of normal numbers using the distribution of the kth largest prime factor
- scientific article; zbMATH DE number 3670537 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- Note on Normal Decimals
- On a problem on normal numbers raised by Igor Shparlinski
- Some new methods for constructing normal numbers
- Prime-like sequences leading to the construction of normal numbers
- Construction of normal numbers using the distribution of the kth largest prime factor
- Constructing normal numbers using residues of selective prime factors of integers
- The number of prime factors function on shifted primes and normal numbers
- Some Normal Numbers Generated by Arithmetic Functions
- Partitioning the Set of Primes to Create r-Dimensional Sequences Which are Uniformly Distributed Modulo [0, 1) r
- Using large prime divisors to construct normal numbers
- Normal numbers and the middle prime factor of an integer
- Creating normal numbers using the prime divisors of consecutive integers
This page was built for publication: Normal numbers generated using the smallest prime factor function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258228)
