Given positive integer M. For any n∈N+, let h(n) be the number of elements in [n] that are coprime to M. Define β:=Mh(M). Proof: there are at least 3M elements n in [M], satisfy
∣h(n)−βn∣≤β⋅2ω(M)−3+1.
Here [n]:={1,2,…,n} for all positive integer n.
Proposed by Bin Wang