Summing pairs of numbers to primes

1,440.7K Views

For any even number N, partition the integers from 1 to N into pairs such that the sum of the two numbers in each pair is a prime number.

Hint:  Chebyshev proved that the following property (Bertrand’s Postulate) holds:  for any k > 1, there exists a prime number p in the range k < p < 2*k.

Share
Add Comment

  • 0 Answer(s)
  • Your Answer

    By posting your answer, you agree to the privacy policy and terms of service.
  • More puzzles to try-