Problem 7 on projecteuler.net. Super simple; I must be getting good at this. Instead of what I did in the past and regenerate prime numbers I simply stored them all in an array so I didn't have to generate them all to check if every number was prime. I just needed to check of subsequent numbers were divisible by a previous prime number. Since prime numbers aren't even I should have imcremented by 2 instead of 1...I'll fix that later.
Easy problem. Happy Halloween.