Strings, Sets, and Binomial Coefficients
Counting strings over restricted alphabets, permutations and combinations, integer solutions to equations, lattice paths, and coefficients in multinomial expansions.
Applied Combinatorics, Strings, Sets, and Binomial Coefficients
17 exercises
Exercise 3
Matt is designing a website authentication system. He knows passwords are most secure if they contain letters, numbers, and symbols. However, he doesn't quite understand that this additional security is defeated if he specifies in which positions each character type appears. He decides that valid passwords for his system will begin with three letters (uppercase and lowercase both allowed), followe…
Exercise 4
How many ternary strings of length are there in which the zeroes appear only in odd-numbered positions?
Exercise 5
Suppose we are making license plates of the form where are capital letters in the English alphabet and are decimal digits (i.e., elements of the set ) subject to the restriction that at least one digit is nonzero and at least one letter is . How many license plates can we make?
Exercise 6
Mrs. Steffen's third grade class has students in it. The students are divided into three groups (numbered , , and ), each having students.
The students in group earned extra minutes of recess by winning a class competition. Before going out for their extra recess time, they form a single file line. In how many ways can they line up?
When all students come in from recess together, they a…
Exercise 8
In this exercise, we consider strings made from uppercase letters in the English alphabet and decimal digits. How many strings of length can be constructed in each of the following scenarios?
The first and last characters of the string are letters.
The first character is a vowel, the second character is a consonant, and the last character is a digit.
Vowels (not necessarily distinct) appear in the…
Exercise 9
A database uses -character strings as record identifiers. The valid characters in these strings are upper-case letters in the English alphabet and decimal digits. (Recall there are letters in the English alphabet and decimal digits.) How many valid record identifiers are possible if a valid record identifier must meet all of the following criteria:
Letter(s) from the set occur in exactly thr…
Exercise 10
Let be the set of the lowercase English letters and decimal digits. How many -strings of length satisfy all of the following properties (at the same time)?
The first and last symbols of the string are distinct digits (which may appear elsewhere in the string).
Precisely four of the symbols in the string are the letter ''.
Precisely three characters in the string are elements of the set an…
Exercise 12
The sport of korfball is played by teams of eight players. Each team has four men and four women on it. Halliday High School has seven men and women interested in playing korfball. In how many ways can they form a korfball team from their 18 interested students?
Exercise 14
An ice cream shop has a special on banana splits, and Xing is taking advantage of it. He's astounded at all the options he has in constructing his banana split:
He must choose three different flavors of ice cream to place in the asymmetric bowl the banana split is served in. The shop has 20 flavors of ice cream available.
Each scoop of ice cream must be topped by a sauce, chosen from six different o…
Exercise 15
Suppose that a teacher wishes to distribute identical pencils to Ahmed, Barbara, Casper, and Dieter such that Ahmed and Dieter receive at least one pencil each, Casper receives no more than five pencils, and Barbara receives at least four pencils. In how many ways can such a distribution be made?
Exercise 17
How many integer solutions are there to the equation provided that , and ? What if we add the restriction that ?
Exercise 18
How many integer solutions are there to the inequality provided that , , and ?
Exercise 19
A teacher has identical pieces of candy. He wants to distribute them to his class of students, although he is willing to take some leftover candy home. (He does not insist on taking any candy home, however.) The student who won a contest in the last class is to receive at least pieces of candy as a reward. Of the remaining students, of them insist on receiving at least one piece of candy,…
Exercise 21
Let and be positive integers. Give a combinatorial argument to prove that for integers ,
Exercise 26
How many lattice paths from to are there that do not pass through ?
Exercise 28
The setting for this problem is the fictional town of Mascotville, which is laid out as a grid. Mascots are allowed to travel only on the streets, and not “as the yellow jacket flies.” Buzz, the Georgia Tech mascot, wants to go visit his friend Thundar, the North Dakota State University mascot, who lives blocks east and blocks north of Buzz's hive. However, Uga VIII has recently moved into the…
Exercise 30
Determine the coefficient on in . (Be careful, as and now appear in multiple terms!)
Adapted from Applied Combinatorics © 2006–2025 Mitchel T. Keller, William T. Trotter. Licensed under CC BY-SA 4.0. Source: Applied Combinatorics. Imported at revision 07286c4.