Some Normal Numbers Generated by Arithmetic Functions
From MaRDI portal
Abstract: Let . A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let phi denote Euler's totient function, let sigma be the sum-of-divisors function, and let lambda be Carmichael's lambda-function. We show that if f is any function formed by composing phi, sigma, or lambda, then the number [ 0. f(1) f(2) f(3) dots ] obtained by concatenating the base g digits of successive f-values is g-normal. We also prove the same result if the inputs 1, 2, 3, dots are replaced with the primes 2, 3, 5, dots. The proof is an adaptation of a method introduced by Copeland and Erdos in 1946 to prove the 10-normality of 0.235711131719ldots.
Recommendations
- Normal numbers created from primes and polynomials
- A combinatorial method for constructing normal numbers
- On a problem on normal numbers raised by Igor Shparlinski
- The number of large prime factors of integers and normal numbers
- Normal numbers generated using the smallest prime factor function
- The normality of digits in almost constant additive functions
- Some new methods for constructing normal numbers
- Normality of some decimals generated by primes in a residue class
- Construction of normal numbers by classified prime divisors of integers
Cited in
(7)- Popular subsets for Euler's \(\varphi \)-function
- On Amicable Numbers
- scientific article; zbMATH DE number 4173100 (Why is no real title available?)
- A fresh look at the notion of normality
- The number of preimages of iterates of and
- Digital problems in the theory of partitions
- Agafonov's theorem for finite and infinite alphabets and probability distributions different from equidistribution
This page was built for publication: Some Normal Numbers Generated by Arithmetic Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981925)