Given a bound , a positive integer is -smooth when all of its prime factors are at most .
For a finite set of primes, an integer is -smooth when every prime dividing it belongs to . Bounding the largest prime factor is equivalent to restricting the integer to be -smooth for a suitable finite .
The largest prime factor of an integer is the greatest prime number dividing .

Articles by others on the same topic (1)

A **smooth number** (or **friable number**) is a positive integer that has no prime factors larger than a certain number. In mathematical terms, a number \( n \) is called \( B \)-smooth if all of its prime factors are less than or equal to \( B \).