Hi guys,

let's debate on the Factorization Problem. For those of you who don't know about it, I'll put it simply :

Say $\displaystyle n = pq$ with $\displaystyle p$ and $\displaystyle q$ primes ($\displaystyle 1$ is not considered as prime)

$\displaystyle \rightarrow$ The Factorization Problem consists of finding $\displaystyle p$ and $\displaystyle q$ knowing only $\displaystyle n$.

Some documents about it can be found here :

$\displaystyle \rightarrow$

Integer Factorization
$\displaystyle \rightarrow$

RSA Labs
The goal of this thread is, in my opinion, to debate about this problem, which has been apprehended but failed to be solved since the very beginnings of mathematics.

$\displaystyle \rightarrow$ Why hasn't it be solved.

$\displaystyle \rightarrow$ Why is it so hard.

$\displaystyle \rightarrow$ How could it possibly be solved.

$\displaystyle \rightarrow$ Any other stuff.

$\displaystyle \rightarrow$ Trolling is

**not** welcome, thanks a lot