AI Tutor
Back to Strings, Sets, and Binomial Coefficients

Exercise 5

Avg difficulty 2.5

Suppose we are making license plates of the form l1l2l3−d1d2d3l_1l_2l_3-d_1d_2d_3 where l1,l2,l3l_1,l_2,l_3 are capital letters in the English alphabet and d1,d2,d3d_1,d_2,d_3 are decimal digits (i.e., elements of the set {0,1,2,3,4,5,6,7,8,9}\{0,1,2,3,4,5,6,7,8,9\}) subject to the restriction that at least one digit is nonzero and at least one letter is KK. How many license plates can we make?

Keller & Trotter, Applied Combinatorics, Strings, Sets, and Binomial Coefficients — Exercises, Exercise 5

AI Tutor

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.