1987 IMO Problems/Problem 6

Revision as of 20:52, 25 October 2007 by Temperal (talk | contribs) (creation)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ be an integer greater than or equal to 2. Prove that if $k^2 + k + n$ is prime for all integers $k$ such that $0 \leq k \leq \sqrt{n/3}$, then $k^2 + k + n$ is prime for all integers $k$ such that $0 \leq k \leq n - 2$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

1987 IMO (Problems) • Resources
Preceded by
Problem 5
1 2 3 4 5 6 Followed by
Last question
All IMO Problems and Solutions