06.09.2021 Views

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

186 D. Hints to Selected Problems<br />

1=5c − 3d.<br />

218. Tohave<br />

we must have<br />

ax + b<br />

(x − r 1 )(x − r 2 ) = c<br />

x − r 1<br />

+<br />

d<br />

x − r 2<br />

cx − r 2 c + dx − r 1 d = ax + b.<br />

221. You can save yourself a tremendous amount of frustrating algebra if you<br />

arbitrarily choose one of the solutions and call it r 1 and call the other solution<br />

r 2 and solve the problem using these algebraic symbols in place of the actual<br />

roots.1 Not only will you save yourself some work, but you will get a formula<br />

you could use in other problems. When you are done, substitute in the actual<br />

values of the solutions and simplify.<br />

222.a. Once again it will save a lot of tedious algebra if you use the symbols r 1 and<br />

r 2 for the solutions as in Problem 221 and substitute the actual values of the<br />

solutions once you have a formula for a n in terms of r 1 and r 2 .<br />

222.d. Think about how the binomial theorem might help you.<br />

224.a. A Catalan path could touch the x-axis several times before it reaches (2n, 0).<br />

Its first touch can be any point (2i, 0) between (2, 0) and (2n, 0). For the path<br />

to touch first at (2i, 0), the path must start with an upstep and then proceed as<br />

a Dyck path from (1, 1) to (2i −1, 1). From there it must take a downstep. Can<br />

you see a bijection between such Dyck paths and Catalan paths of a certain<br />

kind?<br />

224.b. Does the right-hand side of the recurrence remind you of some products you<br />

have worked with?<br />

224.c.<br />

1 · 3 · 5 ···(2i − 3)<br />

i!<br />

=<br />

(2i − 2)!<br />

(i − 1)!2 i i! .<br />

226. Try drawing a Venn Diagram.<br />

228. Try drawing a Venn Diagram.<br />

231.b. For each student, how big is the set of backpack distributions in which that<br />

student gets the correct backpack? It might be a good idea to first consider<br />

cases with n =3, 4, and 5.<br />

Additional Hint: For each pair of students (say Mary and Jim, for example)<br />

how big is the set of backpack distributions in which the students in this pair<br />

get the correct backpack. What does the question have to do with unions or<br />

1We use the words roots and solutions interchangeably.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!