Difference between revisions of "2000 SMT/Advanced Topics Problems"
(Created page with "==Problem 1== How many different ways are there to paint the sides of a tetrahedron with exactly 4 colours? Each side gets its own colour, and two colourings are the same if o...") |
m |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
==Problem 1== | ==Problem 1== | ||
| − | How many different ways are there to paint the sides of a tetrahedron with exactly 4 | + | How many different ways are there to paint the sides of a tetrahedron with exactly 4 colors? Each side |
gets its own colour, and two colourings are the same if one can be rotated to get the other. | gets its own colour, and two colourings are the same if one can be rotated to get the other. | ||
| Line 6: | Line 6: | ||
==Problem 2== | ==Problem 2== | ||
| − | Simplify <math>\left(\frac{-1+i\sqrt{3}}{2}\right)^{6}+\left(\frac{-1 | + | Simplify <math>\left(\frac{-1+i\sqrt{3}}{2}\right)^{6}+\left(\frac{-1-i\sqrt{3}}{2}\right)^{6}</math> to the form <math>a+bi</math> |
[[2000 SMT/Advanced Topics Problems/Problem 2|Solution]] | [[2000 SMT/Advanced Topics Problems/Problem 2|Solution]] | ||
Latest revision as of 07:43, 22 July 2020
Contents
Problem 1
How many different ways are there to paint the sides of a tetrahedron with exactly 4 colors? Each side gets its own colour, and two colourings are the same if one can be rotated to get the other.
Problem 2
Simplify 
to the form 
Problem 3
Evaluate 
Problem 4
Five positive integers from 1 to 15 are chosen without replacement. What is the probability that their sum is divisible by 3?
Problem 5
Find all 3-digit numbers which are the sums of the cubes of their digits
Problem 6
6 people each have a hat. If they shuffle their hats and redistribute them, what is the probability that exactly one person gets their own hat back?
Problem 7
Assume that 
are positive intergers and 
. Find 
.
Problem 8
How many non-isomorphic graphs with 9 vertices, with each vertex connected to exactly 6 other vertices, are there? (Two graphs are isomorphic if one can relabel the vertices of one graph to make all edges be exactly the same.)
Problem 9
The Cincinnati Reals are playing the Houston Alphas in the last game of the Swirled Series. The Alphas are leading by 1 run in the bottom of the 9th (last) inning, and the Reals are at bat. Each batter has a 1/3 chance of hitting a single and a 2/3 chance of making an out. If the Reals hit 5 or more singles before they make 3 outs, they will win. If the Reals hit exactly 4 singles before making 3 outs, they will tie the game and send it into extra innings, and they will have a 3/5 chance of eventually winning the game (since they have the added momentum of coming from behind). If the Reals hit fewer than 4 singles, they will LOSE! What is the probability that the Alphas hold off the Reals and win, sending the packed Alphadome into a frenzy? Express the answer as a fraction.
Problem 10
I call two people A and B and think of a natural number 
. Then I give the number to A and the number 
to B. I tell them that they have both been given natural numbers, and further that they are consecutive natural numbers. However, I don’t tell A what B’s number is and vice versa. I start by asking A if he knows B’s number. He says “no”. Then I ask B if he knows A’s number, and he says “no” too. I go back to A and ask, and so on. A and B can both hear each other’s responses. Do I ever get a “yes” in response? If so, who responds first with “yes” and how many times does he say “no” before this? Assume that both A and B are very intelligent and logical. You may need to consider multiple cases.
