EPTA Robot Gazelle start at a city in Uganda and travels at a speed of 10 miles per hour toward Kenya. After reaching Kenya the Gazelle returns, traveling over exactly the same distance, at only 2 miles per hour. What is the gazelles average speed over the entire Journy? (assume that the Gazelle turned around instantly once it reached Kenya.)
Math Puzzles - Page 6
| Forum Index > General Forum |
|
Kimmural
Canada1111 Posts
A Robot Gazelle start at a city in Uganda and travels at a speed of 10 miles per hour toward Kenya. After reaching Kenya the Gazelle returns, traveling over exactly the same distance, at only 2 miles per hour. What is the gazelles average speed over the entire Journy? (assume that the Gazelle turned around instantly once it reached Kenya.) | ||
|
skyglow1
New Zealand3962 Posts
On June 17 2005 16:27 Lord)Lw( wrote: This one shouldn't be to hard for any of you but might as well post it. A Robot Gazelle start at a city in Uganda and travels at a speed of 10 miles per hour toward Kenya. After reaching Kenya the Gazelle returns, traveling over exactly the same distance, at only 2 miles per hour. What is the gazelles average speed over the entire Journy? (assume that the Gazelle turned around instantly once it reached Kenya.) Hmm average speed = total distance/total time taken so I'm guessing if we assume the distance between uganda and kenya is 10 miles, it would've taken him 1 hour to get to kenya, and 5 hours to get back to uganda, and the distance is 20 miles altogether, so thats 20/(5+1) = 3.3 recurring mile per hour?? skyglow1 | ||
|
Kimmural
Canada1111 Posts
 | ||
|
Zeller
United States1109 Posts
| ||
|
MannerKiss
United States2398 Posts
| ||
|
lightman
United States731 Posts
On June 17 2005 13:39 loloko2 wrote: PLEASE HELP PLEASE HELP PLEASE HELP PLEASE HELP PLEASE HELP OK HERE IS ANOTHER ONE, I NEED HELP ON THIS, BECAUSE IT WAS FOR HOMEWORK A FEW DAYS AGO AND I NEED ALOT OF HELP , PLEASE... Why does the equation X^n + Y^n = Z^n it doesnt have integer solutions if n > = 3 . Find me a solution please. Or if it cant be done then explain why you cant?. PLEASE HELP PLEASE HELP PLEASE HELP PLEASE HELP PLEASE HELP Well, it took more than 200 years, until Andrew Wiles (a Mathematician from Princetown) through 1987-1994 came up to solve that problem. The answer loloko2, X^n + Y^n = Z^n doesn't have integer solutions if n > = 3, is because that all eliptical cuvers are modular, a mathematical conjecture enounces by Tagimura Siyama during the late 1940s. Oh and by the way, that problem is aka "Fermat's Last Theorem" | ||
|
wasted
Germany1789 Posts
please resolve the bridge riddle. or at least tell me via pm  | ||
|
Cloud
Sexico5880 Posts
On June 17 2005 18:20 lightman wrote: Well, it took more than 200 years, until Andrew Wiles (a Mathematician from Princetown) through 1987-1994 came up to solve that problem. The answer loloko2, X^n + Y^n = Z^n doesn't have integer solutions if n > = 3, is because that all eliptical cuvers are modular, a mathematical conjecture enounces by Tagimura Siyama during the late 1940s. Oh and by the way, that problem is aka "Fermat's Last Theorem" My teacher said that if you solved it you would win a fields medal or something like that, which would be the equivalent to nobel, but i guess everyone knows the answer now --v? | ||
|
WiredBomb
United States398 Posts
| ||
|
Cloud
Sexico5880 Posts
| ||
|
lightman
United States731 Posts
Given an equilateral triangle with a side that lenghts L. Each one of the three sides is divided into n+1 equal parts, and for each point that divides a side, you draw n parallel lines to each one of the three sides. Calculate the total number of triangles obtained, this is, the total number of equilateral triangles that will have by side-lenght L/n , 2L/n , .....L. | ||
|
Pacifist
Israel1683 Posts
1 and 2 guy cross (2 sec) 1 guy comes back (1 sec) 5 and 10 guy cross (10 sec) 2 guy comes back(2 sec) 1 and 2 guy cross(2 sec) TOTAL: 17 sec | ||
|
badteeth
Netherlands1416 Posts
1 and 2 go --> 2 seconds 1 goes back --> 1 second 5 and 10 go --> 10 seconds 2 goes back --> 2 seconds 2 and 1 go --> 2 seconds 17 seconds | ||
|
wasted
Germany1789 Posts
now i feel stupid 5 and 10 can't go together, since one of them had to go back, which would kill the deadline. nice one by me... | ||
|
Pacifist
Israel1683 Posts
On June 17 2005 14:29 EvilTeletubby wrote: Well, you could do something like, first guy says the color of the hat in front of him, so the next guy knows what to say.... and then depending upon how the guy says the color of his hat (ie, says it softly or loudly, quickly vs quiet, etc.), the in front of him would know if his hat is the same color as the previous. This would guarantee everyone but the first prisoner would live. He has 50/50 shot. ^_^ u cant change quality of voice or something like that assume that each prisoner speaks in a monotonous voice, the only distinguishable aspects of his voice is "black" or "white" | ||
|
lightman
United States731 Posts
On June 17 2005 19:01 BCloud wrote: My teacher won national math olympics these would be piece of cake for her Dude, these problems are a piece of cake for anyone with basic (but solid) calculus knowledge. It just happens that you are not going to find much of that people in a BW forum. | ||
|
lightman
United States731 Posts
On June 17 2005 18:56 BCloud wrote: My teacher said that if you solved it you would win a fields medal or something like that, which would be the equivalent to nobel, but i guess everyone knows the answer now --v? Oh and Andrew won nothing, and he has said he doesn't really want anything. What he sure won was a place in history as one of the greatest by solving one of the most (the most for some people) intriguing math problems of all time. Oh and by the way, do you suck your teacher's cock or something? | ||
|
baal
10541 Posts
| ||
|
BigBalls
United States5354 Posts
On June 17 2005 19:06 lightman wrote: So far it looks like BigBalls is good at this I congratulate him for both being smart and intereseted, and for being passionate and hunger to this. But also I may say so far I sense his talent hasn't been challenged yet, so I'll start to warm him up (or anyone else that accepts the challenge). It's easy, requires some reasoning and math and that's it: Given an equilateral triangle with a side that lenghts L. Each one of the three sides is divided into n+1 equal parts, and for each point that divides a side, you draw n parallel lines to each one of the three sides. Calculate the total number of triangles obtained, this is, the total number of equilateral triangles that will have by side-lenght L/n , 2L/n , .....L. haha, im a little drunk, just got back from a wedding reception, ill take a look at this tomorrow, looks pretty cool, ill try doing some sort of induction on it, im pretty sure thats the best way to approach it, ill give it a look tomorrow oh yeah, and that other problem with the 34 - ? 24 - etc, can the writer give me a clue or something lol, i dont know where to start on it | ||
|
z7-TranCe
Canada3158 Posts
so which one of you paste bandits is gonna come fix my computer | ||
| ||
