Math 221 C
Discrete Mathematics for Computer Science
Fall 1999

Problems and Exercises

Notation: 	n	manditory problem

			Do it and write up a nice solution to be graded.

		{n} 	optional problem

			Usually this will be an interesting problem that you 
			are capable of doing and may find interesting, but 
			I will not require you to know the information in
			the problem.  It is truly optional.  

		(n)	helper problem

			These are problems that you do not need to turn in,
			but may be helpful with other problems. It may be 
			similar to another problem and have a solution in
			the book, to it may be an easier problem of the same
			general type, etc.
			You might want to look these over as you come to them,
			but if you are convinced that you could do the problem,
			just move on to the next one.  The material from
			these problems will be covered in other problems.

		[n]	ungraded problem

			This might be extra practice (good review for tests)
			or simply a problem that you should know how to do
			but which you do not have to write up for grading.
			You are responsible for the material in these problems,
			and the material may or may not be covered in other
			problems.

Bracketed problems do not have to be turned in.


PS	Sec		Description/Notes
==	===	 	=================
#1 	1.1	(1,3)	patterns in computations
		(6),7	magic squares
		9,10	more patterns in computations

	1.2	1,2	different solution methods (no algebra allowed, please)
		[6]	sums in cross (fill in circles)
		10(ab)c	filling in circles
		
#2 	1.3	[7] 	triangle fill-in
		8	four coins
		12	21 cents -- what coins?
		[13]	pearls in velvet bags
		16	Peter and Jill get paid the same (no algebra)
		17	chopping logs
		18,19	fence posts

	1.4	7	a pattern in a sum
		[16]	squares in addition table [why does it work?]

	1.5	2a	what input gives this output?
		9	who married whom?
		(12),13	same birthdays

#3	any three marked problems from Van de Walle handout 
		(pages 56-57 of 2nd edition)

#4 	2.1 	3,5,7,8	set notation
		11,14	Venn diagrams
		22	how many subsets
		30,31	blood types and Venn diagrams

	2.2	(16),17	Venn diagrams and counting
		[34,35]	Venn diagrams

Back to Math 221 Home Page