No solution to this problem yet. It has turned out to be harder than 2^n mod n = 465. I'm still expecting to find a solution though so still have some processors dedicated to it. I told Max Alekseyev I was optimistic one would be found soon, he said "Will see ;)"
^_^
One fun thing about having a computational search like this, is checking on your computers after a few hours or in the mornings. After I get up and ready for work, I can't wait to see if the fishing nets caught anything. :)
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment