English

On the counts of p-rough numbers

Number Theory 2024-02-14 v5

Abstract

The p-rough numbers are those numbers all of whose prime factors are greater than p. These are exactly those numbers left after Eratosthenes sieve has been advanced from 2 through the prime p. Here we show that for fixed p there is a line of symmetry for the function Φ(x,p)\Phi(x,p), and we introduce the function ΔΦ(x,p)\Delta \Phi(x,p) which is the difference between Φ(x,p)\Phi(x,p) and the line of symmetry. ΔΦ(x,p)\Delta \Phi(x,p) is periodic and bounded and has a rotational symmetry.

Keywords

Cite

@article{arxiv.2308.07570,
  title  = {On the counts of p-rough numbers},
  author = {Fred B. Holt},
  journal= {arXiv preprint arXiv:2308.07570},
  year   = {2024}
}

Comments

17 pages, 9 figures