All Questions
Tagged with heuristics factoring
1 question
0
votes
1
answer
165
views
Is it possible to prove that a general purpose integer factorization algorithm must contain a loop?
1)
Let $A$ be a (general purpose) algorithm that factors $n$. Suppose $A$ contains a loop (which is hard to imagine if not impossible that it does not.) If $A$ contains nested loops then these loops ...
user35803