Are there any known techniques for quickly finding a composite number with at least one large prime factor?
Being aware that the above might sound vague. Let's say quickly is anything less than O(n) complexity, and large factor as anything greater than sqrt(C) ,where C is the composite.
To be clear, I don't need to know what the prime factor is, instead I only need to know that the chosen composite contains a large prime factor.
I recall perusing properties of binomial coefficients with respect to the above, but I can't seem to find it.