# Integer Factorization

### Overview

Given a composite integer $$n$$, can it be decomposed as a product of smaller integers (hopefully as a unique product of prime factors)?

As easy as it may sound, integer factorization in polynomial time on a classical computer stands one of the unsolved problems in computation for centuries!

Lets start dumb, all we need to do is check all the numbers $$1 < p < n$$ such that $$p|n$$or programmatically `n%p==0`&#x20;

```python
def factors(n):
    divisors = []
    for p in range(1,n):
        if n%p==0:
            divisors.append(p)
    return divisors
```

Seems like its an $$O(n)$$algorithm! whats all the deal about?\
By polynomial time, we mean polynomial time in $$b$$when $$n$$is a b-bit number, so what we looking at is actually a $$O(2^b)$$which is actually exponential (which everyone hates)

Now taking a better look at it, one would realize that a factor of $$n$$can't be bigger than $$\sqrt{n}$$\
Other observation would be, if we already checked a number (say 2) to not be a divisor, we dont need to check any multiple of that number since it would not be a factor.


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://cryptohack.gitbook.io/cryptobook/integer-factorization.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.