Let n be a positive integer greater than 1. We call n prime if the only positive integers that (exactly) divide n are 1 and n itself. For example, the first seven primes are 2, 3, 5, 7, 11, 13, and 17. (We shall learn more about primes in Chapter 4.) Use the method of exhaustion to show that every integer in the universe 4, 6, 8, …, 36, 38 can be written as the sum of two primes.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.