CSCI 1323 (Discrete Structures), Spring 2012: 
Homework 2
- Credit:
- 20 points.
 
Do the following problems.
You do not need to turn in answers for the ones
marked ``Not to turn in''. 
Most such problems will be those for which the
textbook provides an answer in the back of the book,
so you can check your work.
- (Not to turn in.)
	Do problem 2, parts (c) and (d), on p. 43 of the textbook.
 
 
- (5 points)
	Do problem 2, parts (e), (f), (g), and (h),
	on p. 43 of the textbook.
 
 
- (Not to turn in.)
	Do problem 5, part (a), on p. 44 of the textbook.
 
 
- (Not to turn in.)
	Do problem 9, parts (a) and (b), on pp. 44-45 of the textbook.
 
 
- (Not to turn in.)
	Do problem 15, parts (a) and (b), on p. 46 of the textbook.
 
 
- (5 points)
	Using the predicate symbols shown and appropriate quantifiers,
	write each English-language statement as a predicate wff.
	(The domain is the whole world.)
 
 is `` is `` is a positive integer.'' is a positive integer.''
  is `` is `` is prime.'' is prime.''
  is `` is `` .'' .''
 
 
- Some positive integers are prime.
- Not all positive integers are prime.
- For every positive integer  , there is a positive
		integer , there is a positive
		integer such that such that is prime and is prime and . .
- There is a largest prime.
	
 
 
 
- (Not to turn in.)
	Do problem 25, part (a), on p. 49 of the textbook.
 
 
- (Not to turn in.)
	Do problem 8 on p. 61 of the textbook.
 
 
- (Not to turn in.)
	Do problem 10 on p. 61 of the textbook.
 
 
- (Not to turn in.)
	Do problem 15 on p. 61 of the textbook.
 
 
- (5 points)
	Do problem 17 on p. 62 of the textbook.
 
 
- (5 points)
	Do problem 19 on p. 62 of the textbook.
 
 
- (Not to turn in.)
	Do problem 24 on p. 62 of the textbook.
 
 
- (Not to turn in.)
	Do problem 32 on p. 62 of the textbook.
 
 
	
 
Berna Massingill 
2012-01-31