in reply to Re^6: Algorithm complexity
in thread Algorithm complexity

no you don't . since 1940 until 2005 they have only been able to check all pairs up to 1.25 x 10^15 and it turned out there was only one pair of such numbers . please notice that it took 65 years and they did not find another one , so it's not a matter of weeks/months .. it's almost 7 decades.

Replies are listed 'Best First'.
Re^8: Algorithm complexity
by LanX (Saint) on Jul 08, 2009 at 11:27 UTC
    Did I say x==15 ??? Does x have to be 15 to suppose it's a hard problem?

    Please note those "checks" in the referenced article were done with a computer and not with pure mathematical proving! And this computer wasn't build "65 years" ago!

    Better find another problem this one is a boomerang. 8)

    Cheers Rolf