0 Members and 1 Guest are viewing this topic.

Can we pre-calculate and store answers that aren't the very first values, as long as it's not a straightforward list of all the answers? I had an idea of speeding mine up by storing, say, every 100th prime palindrome and using them as base points for calculations to reduce computation time for large inputs/outputs. If this isn't allowed, I think it should probably be made clear that except for a few starting values, your algorithm must go through all prime palindromes to get up to the target.EDIT: Also, do we have an official ruling yet on the largest input our programs need to work on? They could certainly be different for different platforms/languages, but establishing some would be really nice.

I have a question: What program do we submit if we're doing Axe? The compiled executable, or the source?

Quote from: dinosteven on April 24, 2013, 08:08:07 amI have a question: What program do we submit if we're doing Axe? The compiled executable, or the source?You'd have to give both.

So, my calculation of "300 per second" was off by quite a bit. I forgot to calculate in non-primes and the wasted cycles there I only get about 30 primes per second, but my algorithm could be better refined (And this is at 6MHz)

Edit: Runer suggested that I don't post timings so as not to discourage anyone, so I'll just say that my program can get the 5953rd palprime in under an hour.