document.write( "Question 638960: 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.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. \n" ); document.write( "
Algebra.Com's Answer #402523 by jim_thompson5910(35256)\"\" \"About 
You can put this solution on YOUR website!
This is simply a guess and check problem. Doing this will give you the following\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "4 = 2 + 2
\n" ); document.write( "6 = 3 + 3
\n" ); document.write( "8 = 3 + 5
\n" ); document.write( "10 = 3 + 7
\n" ); document.write( "12 = 5 + 7
\n" ); document.write( "14 = 3 + 11
\n" ); document.write( "16 = 3 + 13
\n" ); document.write( "18 = 5 + 13
\n" ); document.write( "20 = 3 + 17
\n" ); document.write( "22 = 3 + 19
\n" ); document.write( "24 = 5 + 19
\n" ); document.write( "26 = 3 + 23
\n" ); document.write( "28 = 5 + 23
\n" ); document.write( "30 = 7 + 23
\n" ); document.write( "32 = 3 + 29
\n" ); document.write( "34 = 3 + 31
\n" ); document.write( "36 = 5 + 31
\n" ); document.write( "38 = 7 + 31\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Note: This list is NOT unique. Notice how 16 = 3+13 and 16 = 5+11. Also, notice how 20 = 3+17 and 20 = 7+13. So there is more than one way to write some integers as a sum of two primes. \n" ); document.write( "
\n" );