Hello,

I was wondering how much it would cost to reproduce all this search.
I mean let's say that amicable numbers up to 2^64 costed 4 hexaflops to find (I have no idea of the true order of magnitude.)
Would it be possible given the list of these amicable pairs to verify they are indeed amicable pairs (easy) and no other exist in this range (hard ?) with say 2 teraflops instead ?
If not, would there be some auxiliary results that could be saved on top of amicable pairs that would permit to verify everything with far less cost ?
It would be great to shift from "Trust the server, the calculus was done rigorously" to "Look if you have one month worth of calculus, you can check what took years you achieve" :)

Thanks, best regards,
Laurent Lyaudet