Difference between revisions of "User talk:Bobthesmartypants"
(→Bobthesmartypants's question collection) |
(→Bobthesmartypants's question collection) |
||
| Line 3: | Line 3: | ||
2. Suppose you have a rectangular box, with side lengths <math>a</math> and <math>b</math>, where <math>a,b\in\mathbb{Z}</math>. 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. | 2. Suppose you have a rectangular box, with side lengths <math>a</math> and <math>b</math>, where <math>a,b\in\mathbb{Z}</math>. 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. | ||
| + | |||
| + | 3. In a country, there is a perticular 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> have <math>F_{n-1}</math> cities leading out of it. What values of <math>n</math> are there such that this setup is possible? | ||
Revision as of 13:02, 21 May 2013
Bobthesmartypants's question collection
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?
2. Suppose you have a rectangular box, with side lengths 
and 
, where 
. 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.
3. In a country, there is a perticular 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, 
have 
cities leading out of it. What values of 
are there such that this setup is possible?
