Difference between revisions of "2010 UNCO Math Contest II Problems"
m (→Problem 6) |
m (→Problem 11) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 14: | Line 14: | ||
the original number. | the original number. | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 1|Solution]] |
==Problem 2== | ==Problem 2== | ||
Line 34: | Line 34: | ||
</asy> | </asy> | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 2|Solution]] |
==Problem 3== | ==Problem 3== | ||
Line 41: | Line 41: | ||
What is the smallest possible value of the sum <math>r+s+t</math>? | What is the smallest possible value of the sum <math>r+s+t</math>? | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 3|Solution]] |
==Problem 4== | ==Problem 4== | ||
Line 47: | Line 47: | ||
Factor <math>n^4+2n^3+2n^2+2n+1</math> completely. | Factor <math>n^4+2n^3+2n^2+2n+1</math> completely. | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 4|Solution]] |
==Problem 5== | ==Problem 5== | ||
Line 66: | Line 66: | ||
(b) Generalize this to an <math>N \times N</math> grid. | (b) Generalize this to an <math>N \times N</math> grid. | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 5|Solution]] |
==Problem 6== | ==Problem 6== | ||
Line 76: | Line 76: | ||
three times <math>C</math>, what is the number <math>A</math>? | three times <math>C</math>, what is the number <math>A</math>? | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 6|Solution]] |
==Problem 7== | ==Problem 7== | ||
Line 86: | Line 86: | ||
What is <math>R</math>? | What is <math>R</math>? | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 7|Solution]] |
==Problem 8== | ==Problem 8== | ||
Line 93: | Line 93: | ||
express your answer. Generalize this result. | express your answer. Generalize this result. | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 8|Solution]] |
==Problem 9== | ==Problem 9== | ||
Line 101: | Line 101: | ||
(b) Find integers <math>A, B, C</math> and <math>D</math> so that <math>A^3+B^4+C^5=3^D.</math> | (b) Find integers <math>A, B, C</math> and <math>D</math> so that <math>A^3+B^4+C^5=3^D.</math> | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 9|Solution]] |
==Problem 10== | ==Problem 10== | ||
Line 111: | Line 111: | ||
Since there is no subset of size <math>4</math> satisfying these conditions, the answer for <math>n=5</math> is <math>3</math>. | Since there is no subset of size <math>4</math> satisfying these conditions, the answer for <math>n=5</math> is <math>3</math>. | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 10|Solution]] |
==Problem 11== | ==Problem 11== | ||
Line 128: | Line 128: | ||
draw((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); | draw((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); | ||
draw((4,1)--(5,0)--(6,1)--(5,2)--cycle,black); | draw((4,1)--(5,0)--(6,1)--(5,2)--cycle,black); | ||
− | draw((3,-1)--(3,3), | + | draw((3,-1)--(3,3),dashed); |
</asy> | </asy> | ||
Line 139: | Line 139: | ||
− | [[2010 | + | [[2010 UNCO Math Contest II Problems/Problem 11|Solution]] |
+ | |||
+ | == See Also == | ||
+ | {{UNCO Math Contest box|year=2010|n=II|before=[[2009 UNCO Math Contest II]]|after=[[2011 UNCO Math Contest II]]}} |
Latest revision as of 21:12, 7 November 2014
University of Northern Colorado MATHEMATICS CONTEST FINAL ROUND January 30, 2010.
For Colorado Students Grades 7-12.
• The ten digits are
• The positive integers are
• The prime numbers are
Contents
Problem 1
Find a -digit integer less than
where each digit is odd and the sum of the cubes of the digits is
the original number.
Problem 2
The rectangle has dimensions .
The diagonal
is divided into five
segments of equal length. Find the
total area of the shaded regions.
Problem 3
Suppose , and
are three different positive integers and that their product is
, i.e.,
What is the smallest possible value of the sum
?
Problem 4
Factor completely.
Problem 5
(a) In the grid shown, four coins are
randomly placed in different squares. What is
the probability that no two coins lie
in the same row or column?
(b) Generalize this to an grid.
Problem 6
is a
-digit number
.
is a
-digit number formed by augmenting
with a
on the right, i.e.
.
is another
-digit number formed by placing a
on the left
, i.e.
. If
is
three times
, what is the number
?
Problem 7
and
are each
-digit
numbers (like
and
), and all four digits are different.
The sum
is a
-digit number made up of two more different digits (
is not necessarily prime).
Further, the difference
consists of yet two more different digits (again,
is not
necessarily prime). The number
is a two digit
number which uses the remaining two digits.
What is
?
Problem 8
Simplify , using exponential notation to
express your answer. Generalize this result.
Problem 9
(a) Find integers , and
so that
Express your answers in exponential form.
(b) Find integers and
so that
Problem 10
Let where
. What is the maximum number of elements in a subset
of
,
which has at least three elements, such that
for all
in
? As an example, the subset
of
has the property that the sum of any two elements is strictly bigger
than the third element, but the subset
does not since
is
greater than
.
Since there is no subset of size
satisfying these conditions, the answer for
is
.
Problem 11
(a) The square grid has
dots equally
spaced. How many squares (of all sizes)
can you make using four of these dots
as vertices? Two examples are shown.
(b) How many for a ?
(c) How many for a ?
(d) How many for an grid of dots?
See Also
2010 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
Preceded by 2009 UNCO Math Contest II |
Followed by 2011 UNCO Math Contest II | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
All UNCO Math Contest Problems and Solutions |