Let [x] denote the greatest integer function. Find the largest prime P such that the condition above is true.
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.
Firstly we have n 2 = 3 P or n 2 = 3 P + 1 or n 2 = 3 P + 2 .
Therefore, concluding from the three cases, the largest prime P is 5 .