This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori on-line! See this thread for details.
I have a super easy question... I'm working on a program to determine whether very large numbers (100 digits or more) are prime. The method I've coded here isn't 100% accurate, but it's a lot faster than something that would be more accurate so I'm ok with it. I know it's a little messy right now, but my issue is the "modulo" evaluation on line 43 doesn't actually evaluate. When I debug, it goes through the line and appears to do the calculation, but it merrily finishes out the loop, giving me a "prime number" every time. Anyone have any ideas?
(also, I realize I tagged this as Java code so it highlighted some weird stuff, but when I tagged it as "scheme" or "lisp" I lost all the cool formatting.)