Using the wonderful modpwr() from Paul Pollack's NTH library for the TI-92, I
have quickly verified the following results I found on Entropia.com:
7017133 61 F 1901619961404080441 14-May-99 11:35 jay2001
PII_40
7029787 62 F 3764452186385609519 31-May-99 02:47 love_fest
synergy
9780157 55 F 49538835694371671 17-Jun-99 07:45 Vincent
vinc
For each of them, the TI-92 quickly returned that 2^exponent mod factor = 1,
and very quickly too (yay!). A calculator factoring program is a real
possibility. I'll get to work coding a "front-end" right away. However, I
think I recently read that some people had their computers race ahead and
factor large exponents (like 25million) up to some small number, like 2^40.
Have those results been posted anywhere? If this TI-92 program is distributed
far and wide, repeating already-done work would be a waste. Thanks.
S.T.L.
Happily coding away in TI-92+ BASIC.
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
