Evan noticed that when , and , the expression was composite. Given this information, find the number of positive integers such that is prime.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Notice that if ω 3 = 1 , then ω 5 + ω 4 + 1 = ω 2 + ω + 1 = 0 , and hence follows n 2 + n + 1 ∣ n 5 + n 4 + 1 : Indeed , if ω is a root of both of the polynomials then one divides the other. Being 1 2 + 1 + 1 = 1 5 + 1 4 + 1 = 3 , the other factor will be 1 for n = 1 , but neither of the factors will be 1 henceforward. So, n = 1 is the only solution.