Project Euler/27

Solution

Solution: https://git.charlesreid1.com/cs/euler/src/branch/master/java/Problem027.java

Implemented 2 nested for loops to search for parameter values by brute force. Keep running track of consecutive number of primes generated, and best a/b. Return them at the end.

This algorithm did not have any trickness, or require any special optimization. Used a standard prime number sieve, nothing special.