Difference between revisions of "User talk:Bobthesmartypants/Problems"
(→Questions) |
(→Questions) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Problem 2:''' Suppose you have a rectangular box, with side lengths <math>a</math> and <math>b</math>, where <math>a</math> and <math>b</math> are positive integers. We launch a point-like ball from one of the vertices with an angular degree of <math>60^{\circ}</math>. The ball bounces off the sides of the box. Pretend there is no friction, drag, or anything else to slow down the ball. Prove or disprove that the ball won't ever hit a vertex again. | '''Problem 2:''' Suppose you have a rectangular box, with side lengths <math>a</math> and <math>b</math>, where <math>a</math> and <math>b</math> are positive integers. We launch a point-like ball from one of the vertices with an angular degree of <math>60^{\circ}</math>. The ball bounces off the sides of the box. Pretend there is no friction, drag, or anything else to slow down the ball. Prove or disprove that the ball won't ever hit a vertex again. | ||
| − | '''Problem 3:''' In a country, there is a particular way the cities inside are connected. One city has only one road leading out of it. One city has two roads leading out of it. Two cities have three roads leading out of it. Three cities have 5 roads leading out of it. In general, <math>F_n</math> cities have <math>F_{n-1}</math> roads leading out of it. What values of <math>n</math> are there such that this setup is possible? | + | '''Problem 3:''' In a country, there is a particular way the cities inside are connected. One city has only one road leading out of it. One city has two roads leading out of it. Two cities have three roads leading out of it. Three cities have 5 roads leading out of it. In general, <math>F_n</math> cities have <math>F_{n-1}</math> roads leading out of it. Assume that all roads leading out of one city will enter another city, and vice versa. What values of <math>n</math> are there such that this setup is possible? |
| − | '''Problem 4:''' What is the | + | '''Problem 4:''' What is the longest path possible on a truncated cube with edge lengths of <math>1</math> if no edge can be used twice? |
| + | |||
| + | '''Problem 5:''' (Assume that there is no friction, and drag, and the ball follows the law of reflection.) Suppose we have an <math>n</math>-gon. There is a point-like ball at the midpoint of one of the sides of the <math>n</math>-gon (call that side Side A). It is launched to the midpoint of another side (call that Side B). Let <math>k</math> be the number of sides clockwise to Side A but counterclockwise to Side B (not including Side A and Side B). Define <math>\delta_n(k)</math> to be <math>k</math> if the ball hits every side of the <math>n</math>-gon before returning to the launch point, and otherwise <math>0</math>. Find the closed form for the sum <cmath>\sum^{n-2}_{k=0}{\delta_n(k)}</cmath> | ||
Latest revision as of 17:18, 24 May 2013
Questions
Problem 1: Bob is rolling a 
-sided die. Every time he rolls a number that he has already rolled before, he rolls again. He stops when he has rolled all the numbers. What is the expected number of rolls it will take Bob?
Problem 2: Suppose you have a rectangular box, with side lengths 
and 
, where and are positive integers. We launch a point-like ball from one of the vertices with an angular degree of 
. The ball bounces off the sides of the box. Pretend there is no friction, drag, or anything else to slow down the ball. Prove or disprove that the ball won't ever hit a vertex again.
Problem 3: In a country, there is a particular way the cities inside are connected. One city has only one road leading out of it. One city has two roads leading out of it. Two cities have three roads leading out of it. Three cities have 5 roads leading out of it. In general, 
cities have 
roads leading out of it. Assume that all roads leading out of one city will enter another city, and vice versa. What values of 
are there such that this setup is possible?
Problem 4: What is the longest path possible on a truncated cube with edge lengths of 
if no edge can be used twice?
Problem 5: (Assume that there is no friction, and drag, and the ball follows the law of reflection.) Suppose we have an -gon. There is a point-like ball at the midpoint of one of the sides of the -gon (call that side Side A). It is launched to the midpoint of another side (call that Side B). Let 
be the number of sides clockwise to Side A but counterclockwise to Side B (not including Side A and Side B). Define 
to be if the ball hits every side of the -gon before returning to the launch point, and otherwise 
. Find the closed form for the sum ![\[\sum^{n-2}_{k=0}{\delta_n(k)}\]](http://latex.artofproblemsolving.com/f/3/2/f32c9dc859ef47d6251d714c2c1a03dd1a3f505e.png)
