View Single Post
Old 2005-12-29, 21:32   #1
Citrix's Avatar
Jun 2003

1,579 Posts
Default Finding smooth numbers

Given a number n, how does one find the closest number that has all factors under a 1000? I can go and test each number, but is there a faster method?

What would be the running time of this faster algorithm? Is it in polynomial time?

Citrix is offline   Reply With Quote