So still no response on how large the largest n-th they will throw at us?

Well, we don't know ourselves...
When we try to make our own things, for testing purposes, we are, too, limited by the machine's BASIC limits. But our (critor's) algorithm is valid for any input.
We have not coded anything for the z80 but e do know there are limits....

Just try to make something good enough for "relatively large" numbers (even though some small nmuerbs already take time to compute, so...)

The question is, will your program reach answers that large before your batteries die?

Well mine works up to 9999999999999... So hopefully nothing beyond that

Haha good question. Especially as it is in Basic so it might take a long while to reach those numbers. Oh and actually I messed up those numbers, it only goes to 8999999999999. I can't figure out why though.

The first one is not prime and the second one is not a palindrome anyway

Hi all,


Come and check if you've won!
http://tiplanet.org/forum/viewtopic.php?f=49&t=11914&lang=en

Oh my gosh, that is awesome o.o I want to check out Weregoose's program because that probably has some really hacky code o.o