Posted by **Ron** on Friday, April 5, 2013 at 7:41am.

Let n be 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 should 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.

## Answer this Question

## Related Questions

- math - Can someone help me with prime and composite numbers? Prime numbers are ...
- MATH - Let’s agree to say that a positive integer is prime-like if it is not ...
- math - Let’s agree to say that a positive integer is prime-like if it is not ...
- Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
- discrete math - Could someone help me with this induction proof. I know its true...
- MATH - Find the only positive integer whose cube is the sum of the cubes of ...
- Discrete Math - Could someone help me with this induction proof. I know its true...
- Math - the only perfect number of the form x(n) + y(n) A perfect number is an ...
- Math ? - If p is a positive integer and is greater than 3. How many prime ...
- Math ? - If p is a positive integer and is greater than 3. How many prime ...