Edit - Stack Overflow

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

I do agree that factorization by brute-force trying out all possible factors would take too long. But that does not mean that more clever algorithms are not possible (this is even true without thinking about quantum computers). As an example consider the problem of finding out if a given number N is or is not a prime number. If N is, say, a 1000 digit number one could also think that this is an impossible task, but in fact this can be done on ordinary computers, see en.wikipedia.org/wiki/Primality_test The test is just more complicated than trying out every possible divisor.

Falk Tandetzky
– Falk Tandetzky

2020-06-29 09:39:15 +00:00
Commented Jun 29, 2020 at 9:39

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>

formatting help »
answering help »

Collectives™ on Stack Overflow