1. The problem statement, all variables and given/known data use Eular's formula to find the greatest prime number under : If I wasn't forced to use this method I would set up a program to loop through checking for primes 2. Relevant equations F(n) = n^2 + n + 41(0 to 39) or depending on your PoV f(n) = n^2 - n + 41(1 to 40) Where the number is above 41 3. The attempt at a solution Now I'm not even sure where to start with this mess as I do not understand how the "formula" is supposed to work But my first number is 68, so f(68) = 68^2 + 68 + 41. = (40 + 28) ^ 2 + (40 + 28) + 41 Now I do not see any rational of what to do next.