AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

1987 IMO Problems/Problem 6

From AoPSWiki

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)
Preceded by
Problem 5
1 2 3 4 5 6 Followed by
Last question
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us