Numbers with many small prime factors (e.g., 2·3·5·7·...) have factorizations requiring exponentially more bits than log n, which is mathematically sound.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.