(07-06-2023, 07:54 PM)mnrvovrfc Wrote: Welcome to the forums.Hi and thanks for the feedback, greatly appreciated. I should have noted that the time to execution increases exponentially (or something like that) as the number of anti-primes you desire goes up.
I have never understood this need for speed, and even less, the desire to make the executable smaller. Because usually it comes from people needing to compare one thing to the other. Just use it, dude, if it's easy enough and convenient.
That comment wasn't aimed at the OP nor at anybody else in particular.
The program that I wrote to try to create prime palindromes out of 19-digit _INTEGER64, had performance that satisfied me. It had to search through an input file for possible candidates. For each candidate, it had to calculate if it were prime or not. I wasn't expecting the program to blaze through things with a lowly dual-core CPU and only 4GB RAM. The thing is I don't have time nor patience to "do" C++ to see if it could run faster and perhaps gobble up more RAM.
I was asking the community to just take a quick look and see if I am missing any commands, functions, or features of QB64 that I could leverage. I put a little more detail in my reply to bplus. This would help greatly as we increase the number of anti-primes calculated.
Your prime app sounds very nice.
Thanks!