Wednesday
April 16, 2014

Homework Help: Discrete Math

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

First Name:
School Subject:
Answer:

Related Questions

discrete math - Could someone help me with this induction proof. I know its true...
DISCRETE MATHS - We need to show that 4 divides 1-n2 whenever n is an odd ...
Discrete Math - 1. Assume that n is a positive integer. Use the proof by ...
Discrete Math - Could someone help me with this induction proof. I know its true...
Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
math - if a lesser integer is being subtracted from a greater integer, is the ...
math - if a greater integer is being subtracted from a lesser integer, is the ...
Discrete Math - If n is a positive integer and n > 1,prove that (n) + (n-1) ...
MATH - Find the only positive integer whose cube is the sum of the cubes of ...
DISCRETE MATHS - Prove that if n is an odd positive integer, then 1 ≡ n2 (...

Search
Members