INPUT: an integer $n$ and a integer $d$
QUESTION: does $n$ have a prime factor less than $d$?
Does a polynomial time algorithm exist that can tell whether or not $n$ has a prime factor $< d$?
Would iterating through all possible primes $< d$ take too long?