Math 300 , Spring 2004, Day 2, Wednesday Feb 4 Hit reload to get most current version

Reading: Continue with 1-2.  Look ahead at 1-3 tree
"Combinatorics"--the tools of counting--is a subject that can get amazingly hard amazingly quickly.  Some people are gifted at it (they often end up working for the government in the code-breaking/making area).  We'll just look at some of the most mainstream and useful problems.
Multiplication principle:  A TREE is a more general tool, useful even (especially?) when general principles don't quite work.  We'll see more examples later.  If you're having trouble figuring out a problem, cut the numbers down (e.g.10 and 3 objects to 4 or 5 and 2) and start drawing trees to look for structures.

nchooserNumber of combinations , "committees" of n things taken r at a time:
"n choose r" = binomial coefficient.



HW:  p. 14, #6, #8
A)  When I first moved to NY, license plates were 3 letters followed by 3 numbers (TKU397)
    a) How many different license plates could there be back then?
    b) Now there are 7 characters--there is still some pattern, but I expect eventually there won't be.  How many plates can there be if any of the 7 characters can be any letter or any digit?
    c) Can you count "exactly 3 letters, together, but anywhere in the list" (ACD2355, 2ACD355, etc.). ?
    **d) I'm not sure what the present patterns are, but there seem to be clumps of letters and digits.  Observe in the parking lot(s) and see if you can see the likely structures (not counting vanity plates.)    Can you count how many, if your analysis of the structures is correct?
B) Ann, Betty, Carol, Xavier and Zane are going to the movies.  They want to sit Girl, Boy, Girl, Boy, Girl.  How many possible ways are there to do this?
How many ways if Ann and Xavier refuse to sit next to each other? (You'll need a tree, or a list...and/or a trick.)


Sievers home  Math300-Sp04/Dayp2.htm  11pm 2/3/02
This page belongs to Sally Sievers who is solely responsible for its content. Please see our statement of responsibility.