Math Is Fun Forum

Hello,

A random walk has two reflecting barriers at 0 and 3. By reflecting I mean that when they are reached the next move must be in the opposite direction. Each move is one unit right or left. Is that understandable?

My question is in how many ways can she finish on 3 if she makes 999 moves?:)

Hi bobbym;

Did you try those two formulas out? Didn't I ask you earlier in this thread?

Hi;

Was that supposed to be funny? Eric is much less talkative than you are and rarely even explains where those magical answers come from. He heads for the security elevators and goes down [removed by administrator]... When he returns he has the answers he needs. DL, knows nothing.

Please email me the code and I will bring over pizza.

bobbym and anonimnystefy

That is what I have.

Your brother was kind enough to loan me your copy. Interesting comments in the glossings?

[Code fixed by admin]

Solve[{12 ==1/a Sqrt[2] \[Sqrt]((a + b + c) (1/2 (a + b + c) - a) (1/2 (a + b + c) - b) (1/2 (a + b + c) - c)), 14 == 1/b Sqrt[2] \[Sqrt]((a + b + c) (1/2 (a + b + c) - a) (1/2 (a + b + c) - b) (1/2 (a + b + c) - c)), 
   83 == 1/c Sqrt[2] \[Sqrt]((a + b + c) (1/2 (a + b + c) - a) (1/2 (a + b + c) - b) (1/2 (a + b + c) - c)), 12 == (b*c)/(2 R)}, {a, b, c, R}] // N

Only had to try 84 and 83.

Meaning what?

How wonderful of you but I can do that.

Please post all the results when you get them.

Your brother tried to help me with it while you were sleeping. I do not handle geogebra that well. How do you know that answer is okay?

Hello bobbym;

I need to see your solution and how you know it is right.:)

I could not get this one.