Difference between revisions of "2007 UNCO Math Contest II Problems/Problem 10"
(Created page with "== Problem == A quaternary “number” is an arrangement of digits, each of which is <math>0, 1, 2, 3.</math> Some examples: <math>001, 3220, 022113.</math> (a) How many <math...") |
Mathisfun04 (talk | contribs) (→Solution) |
||
| Line 13: | Line 13: | ||
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
== See Also == | == See Also == | ||
Revision as of 19:57, 5 December 2016
Problem
A quaternary “number” is an arrangement of digits, each of which is 
Some examples: 
(a) How many 
-digit quaternary numbers are there in which each of 
appear at least once?
(b) How many 
-digit quaternary numbers are there in which each of 
appear at least
once? Test your answer with 
(c) Generalize.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2007 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Last question | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
