Let denote the smallest prime number greater than 200 for which there are positive integers and satisfying . What is
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.
We can use Fermat's theorem on sums of two squares-
If a prime p can be expressed as p = a 2 + b 2 , where a and b are positive integers, then p ≡ 1 ( m o d 4 )
The smallest such possible p is p = 2 2 9 . By trial and error, we have a = 2 and b = 1 5 , so a + b = 1 7 .