Math 221 C
Discrete Mathematics for Computer Science
Fall 1999

Problems and Exercises

Notation: 	n	manditory problem


		{n} 	optional problem


		(n)	helper problem


		[n]	ungraded problem


Bracketed problems do not have to be turned in.


HW	Sec	Prob	Description/Notes
==	===	====	=================

#9	4.1	2	factoring diagrams
		3	lcm
		4	factor pairs
		5ab	tree diagrams to factor
		6ab	short division to factor	
		7-11	factors

	4.2	1,2,7a	divisibilty tests
		19	factor tree
		21	division from prime factorization

#10	4.3	5-8	gcd, lcm
		9ab	Euclidean algorithm (only if we cover it)
		10,11b	3-way gcd and lcm
		21	how long to lap?

#11	6.1	1bdf	what fraction?
		2bcd	shading octagons
		7b	don't do it; answer this question:
			   how could you make this a better task?
		32	basketball math

#12	6.2	4abcd	fraction sums
		8abef	fraction differences

#13	6.2 	9,10	multiplication models
		11	area of a plot of land
		15abcf	fraction division
		16	material yardage from width and area
		23	division algorithms for fractions
		
		

Back to Math 221 Home Page