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...") |
(→Solution) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 13: | Line 13: | ||
== Solution == | == Solution == | ||
| + | (a) <math>4^6-2\cdot3^6+2^6</math> | ||
| + | (b) <math>4^n-3\cdot 3^n+3\cdot 2^n-1^n</math> | ||
| + | |||
| + | (c) Generalize | ||
== See Also == | == See Also == | ||
Latest revision as of 17:56, 8 June 2021
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
(a) 
(b) 
(c) Generalize
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 | ||
