# Techniques for finding composites with at least one large prime factor

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.

• Any even number $C$ has a factor $C/2 > \sqrt{C}$ when $C$ is larger than 4 – Slugger Jun 18 '16 at 19:38
• Oops, I missed the prime factor part. Thanks for spotting that. – niobe Jun 18 '16 at 19:45
• What do you mean by large? Are you talking about 100 digits, a million digits? – almagest Jun 18 '16 at 19:52
• @almagest In my original post I did clarify that the prime factor be greater than sqrt(C), where C is the composite. – niobe Jun 18 '16 at 19:56
• @niobe Fine I understand that part. But how big is $n$? I ask because you can get large primes, composites with large prime factors etc as fast as you can type by using a package like Mathematica, but only up to a certain limit on size. I am trying to get an idea of how big you want to go. – almagest Jun 18 '16 at 20:00

If you want to "happen upon" such a number rather than constructing it, you might try a large Mersenne number $M_p = 2^p -1, p$ prime, check that it's composite using Miller-Rabin, then trial divide by $q=2kp+1$ (hopefully finding nothing) until you are satisfied that the remaining factors are big enough.