Clan x86

General Forums => Academic / School => Math and Other Problems => Topic started by: Ender on July 04, 2007, 10:38:10 pm

Title: Bug on a Triangle (AIME #13)
Post by: Ender on July 04, 2007, 10:38:10 pm
A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is m/n, where m and n are relatively prime positive integers, find m+n.
Title: Re: Bug on a Triangle (AIME #13)
Post by: Chavo on July 05, 2007, 08:34:49 am
I'm not a huge math buff but...relatively prime?  I don't think numbers can be 'relatively' prime unless you are restricting the problem to a closed set and even then it doesn't exactly make a lot of sense to say it :)
Title: Re: Bug on a Triangle (AIME #13)
Post by: rabbit on July 05, 2007, 10:25:49 am
Relatively prime: 10 and 11 are relatively prime because neither divides the other.
Title: Re: Bug on a Triangle (AIME #13)
Post by: iago on July 05, 2007, 12:27:21 pm
683?
Title: Re: Bug on a Triangle (AIME #13)
Post by: Ender on July 05, 2007, 08:48:55 pm
683?

Correct :D Solution? :P
Title: Re: Bug on a Triangle (AIME #13)
Post by: iago on July 06, 2007, 11:40:35 am
683?

Correct :D Solution? :P

Well, first I captured myself a whole bunch of ants and made a triangle out of sugar. Then...

<edit>
(9:41:33 AM) Nick: if a_i is the probability of landing on the starting spot after 0 moves (i.e. a_0=1, a_1=0)  then a_i+1=(1-a_i)/2
(9:42:39 AM) Nick: or the probability of the current point being not on the starting point (1-a_i)  divided by two since half the time you will land back at the start

I don't know what it means, but is it right? :P
Title: Re: Bug on a Triangle (AIME #13)
Post by: Ender on July 06, 2007, 11:45:15 pm
Yep, that works =) That's a nice conceptual shortcut, actually. The way he did it you don't even have to look for a pattern by getting your hands dirty, you just have to evaluate the anchor case and use the logic stated.

I'll explain what he did. Let's say the bug is on its nth move. If the bug got to the starting point on its (n-1)th move (lol @ notation) then it has a zero probability of getting to the starting point on its nth move. So you take the probability that it DIDN'T get to the starting point on the (n-1)th move, which is 1 - a_n-1, which implies that the bug is on one of the two vertices that's not the starting point. In this situation, the bug has two places to move to, and each are equally likely, so you take half the probability, to make it (1 - a_n-1) / 2.

I probably should have used LaTeX on that hehe... I may get around to prettifying it later.

By the way, why doesn't Nick visit these forums? :P (i.e. without the iago proxy ;-))
Title: Re: Bug on a Triangle (AIME #13)
Post by: iago on July 07, 2007, 12:29:45 am
It's more fun for me if I get to be a middleman. He explains his answers to me and I totally don't understand them, it's fun :)
Title: Re: Bug on a Triangle (AIME #13)
Post by: Ender on July 07, 2007, 12:31:01 am
Hehe. >:( Did you get my explanation?
Title: Re: Bug on a Triangle (AIME #13)
Post by: iago on July 07, 2007, 12:40:21 am
It sounds like what he told me. To be honest, I didn't put much thought in it. I just find myself not caring about math problems :P
Title: Re: Bug on a Triangle (AIME #13)
Post by: rabbit on July 07, 2007, 11:04:08 am
(http://latex.sidoh.org/?render=1%20-%20a_%7Bn-1%7D)

(http://latex.sidoh.org/?render=%5Cfrac%7B1%20-%20a_%7Bn-1%7D%7D%7B2%7D)