Homework 2#
Due: Thursday, September 3, 2026 23:58
Submit: Gradescope, through
Blackboard’s assignment area.
Please write your homework by hand. Start each exercise on a new page, scan your work to a legible PDF, and clearly mark the pages associated with every exercise.
1. (A constrained integer sum) #
Points: 8
How many integer solutions are there to
2. (A route through specified points) #
Points: 12
A northeast lattice path uses only unit steps to the right or unit steps up.
How many northeast lattice paths from
Every required path breaks into four path segments: from
3. (Anagrams with letters and digits) #
Points: 10
How many anagrams of ABRACADABRA676767 have every digit before every
letter?
First position the digits, then the letters.
4. (Drawing colored balls) #
Points: 12
A bag contains an unlimited supply of red balls and blue balls, and exactly 10 yellow balls. A person draws 15 balls.
How many possible outcomes are there if the order of the draws is irrelevant? Thus an outcome records only how many balls of each color are drawn.
How many possible outcomes are there if the balls are drawn one at a time and placed in a row?
For each part, first pretend that yellow balls are unlimited. Then remove the impossible outcomes: ones where you choose more yellow balls than are available.
5. (Passwords with increasing digits) #
Points: 10
A password has length 12. Each character is either one of the 26 lowercase
letters or one of the decimal digits
How many passwords satisfy these conditions?
Choose the three positions occupied by digits. Next choose the three digit values; their increasing-order requirement then determines which chosen digit goes in each digit position. Finally fill the letter positions.