Spiral primes is a problem in which one must find the side length of the square spiral for which the ratio of primes along both diagonals first falls below 10%. More information on this spiral can be found on Ulam spiral.
In order to solve this problem I started by creating an
ArrayList of all the diagonal numbers and check for their primality. However, creating an
ArrayList from scratch for every loop was inefficient and soon I have implemented a method to return just the diagonal numbers for the current loop:
getLastDiagonal() returns the bottom right diagonal number in the square spiral, so for
n = 2 it returns 9. Afterwards it is straight forward to obtain the first diagonal number with the method
getFirstDiagonal(), so we get 3 as the first diagonal number in the second spiral square.
Having the first and last diagonal numbers, and the offset between each diagonal number in a certain size
n square spiral makes it easy to return all the diagonal numbers.
Thus, one just needs to accumulate the number of primes as we keep adding square spirals and divide by the total number of diagonal numbers.
The full solution can be found here.