To all:
I would not answer someone's email from fuckaround.org and I find it utterly
inconsiderate and tasteless
to send an email with that return address in the first place.
And don't tell me that person is not entitled to do so - of course, he or she
is. But so am I to not respond
to such
In all fairness - no one has proven that the problem is indeed difficult or not
(as in
can be solved in polynomial time or not). I am not disputing the fact that the
problem is difficult - but just because no one knows an easy (polynomial)
answer does not mean that such solution does not exist.
This is hardly anything remotely resembling a formal proof, of course. But
it should give you the basic idea -- it's a difficult problem because the
numbers are big.
Your argument only applies to your algorithm. The question is whether there
exists something
else besides a trial / brute force
To be sure we should use another library:
$ cat gmp5.c
#include stdio.h
#include gmp.h
...
To be sure one needs to go back to the mathematical definition of what is a
prime.
To use a program as proof is really not a proof. What you have proven is that
GMP is correct in determining that 2 is
