2007 UNCO Math Contest II Problems/Problem 10: Difference between revisions

Latest revision as of 17:56, 8 June 2021

A quaternary “number” is an arrangement of digits, each of which is $0, 1, 2, 3.$ Some examples: $001, 3220, 022113.$

(a) How many $6$ -digit quaternary numbers are there in which each of $0, 1$ appear at least once?

(b) How many $n$ -digit quaternary numbers are there in which each of $0, 1, 2,$ appear at least once? Test your answer with $n=3.$

(c) Generalize.

(a) $4^6-2\cdot3^6+2^6$

(b) $4^n-3\cdot 3^n+3\cdot 2^n-1^n$

(c) Generalize

@@ 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 ==

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