Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 exptools 1/6/84; site ihuxl.UUCP
Path: utzoo!watmath!clyde!burl!hou3c!hocda!houxm!ihnp4!ihuxl!suemcm
From: suemcm@ihuxl.UUCP (Sue McMullen)
Newsgroups: net.math
Subject: mathproof
Message-ID: <1115@ihuxl.UUCP>
Date: Tue, 15-May-84 18:11:58 EDT
Article-I.D.: ihuxl.1115
Posted: Tue May 15 18:11:58 1984
Date-Received: Wed, 16-May-84 04:43:39 EDT
Organization: AT&T Bell Labs, Naperville, IL
Lines: 44

I need to do the following for my MTH230 Discrete Structures class
at North Central College:

	Prove or disprove that:
	
	Every positive odd integer >=3 is the sum of a prime and
	a power of two.
	
	
	For example:
			 0
		3 = 2 + 2 
		
			 1
		5 = 3 + 2
		
			 1
		7 = 5 + 2
		
			 1	   2
		9 = 7 + 2  or 5 + 2
		
			  2 
		11 = 7 + 2 
		
		etc.
		
		
	The background for this problem that has been learned in the
	class is the various ways to prove problems, i.e. direct proof,
	proof by contradiction, proof by mathematical induction.  As 
	far as any information on the properties of the primes and the
	powers of two that is yet to be determined.
	
	
	ANY HELP AT ALL WILL BE GREATLY APPRECIATED!!!!
	
	
	Please send responses to the net, ihlpi!suemcm, ihuxl!suemcm or
	call me on x0935.
	
	
	Thanks again!!!