there is a question about making a program to find prime factorization.

And it says : " Your algorithm must be quicker for some types of numbers than for others of similar size"

i dont know what "others of similar size" means.

i guess that kind of numbers : 2^n.

since i set my initial test number t=2

but i cant find those numbers of "similar size"