It is not the case that 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.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.