PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
smooth number (Definition)

A $ k$-smooth number $ n$ is an integer such that its prime divisors are less than $ k$. For example, 14824161510814728 is 7-smooth since its prime factors are just 2 and 3 (and thus its divisors are all either powers of those two primes or multiples of 6).

For small $ k$, the number of smooth numbers less than a given $ x$ can be estimated with the formula

$\displaystyle \frac{1}{\pi(k)!} \prod_{i = 1}^{\pi(k)} \frac{\log x}{\log p_i},$
where $ \pi(x)$ is the prime counting function and $ p_i$ is the $ i$th prime.

Smooth numbers have many applications, such as the many classic factorization algorithms which specifically call for smooth numbers in their initialization steps, as well as fast Fourier transform algorithms that also require smooth numbers.



"smooth number" is owned by CompositeFan. [ full author list (2) | owner history (1) ]
(view preamble)

View style:

See Also: rough number


Attachments:
examples of smooth numbers (Example) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: Fourier transform, algorithms, applications, prime counting function, number, multiples, primes, divisors, prime factors, prime divisors, integer
There are 2 references to this entry.

This is version 2 of smooth number, born on 2002-12-27, modified 2008-07-01.
Object id is 3855, canonical name is SmoothNumber.
Accessed 1703 times total.

Classification:
AMS MSC11A05 (Number theory :: Elementary number theory :: Multiplicative structure; Euclidean algorithm; greatest common divisors)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)