A lower bound on the number of rough numbers

Abstract: Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers

x

and

y

, let

P h i (x, y)

denote the number of positive integers at most

x

with no prime factors less than

y

. In this paper we establish the lower bound

P h i (n, p) g e q l f l o o r 2 n / p f l o o r + 1

when

p g e q 11

is prime and

n g e q 2 p

.

This page was built for publication: A lower bound on the number of rough numbers