This way and that

A particle in R 3 \mathbb{R}^{3} , starting at the origin, moves in six steps of positive integral length in the sequence east, north, up, east, north, up, where "east" means in the positive x x -direction, "north" in the positive y y -direction and "up" in the positive z z -direction. The combined length of the six integral steps is 10. 10.

If the expected (magnitude of the) distance between the starting and finishing points of the particle is S , S, then find 1000 S . \lfloor 1000*S \rfloor.

Comments:

  • For example, one possible path for the particle is 2 2 units east, 2 2 units north, 1 1 unit up, 1 1 unit east, 3 3 units north and 1 1 unit up.

  • By "positive integral length" I mean that each step has a length 1. \ge 1.

  • Each possible path has an equal chance of being taken.


The answer is 6089.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Let the respective lengths of the six successive steps be a , b , c , d , e , f . a,b,c,d,e,f. Then we have the condition that

a + b + c + d + e + f = 10 a + b + c + d + e + f = 10 such that each variable is an integer 1. \ge 1.

We can simplify this condition by replacing each variable x x with x x' such that x = x 1. x' = x - 1. Then the equation become

a + b + c + d + e + f = 4 a' + b' + c' + d' + e' + f' = 4 such that each variable is an integer 0. \ge 0.

This is a 'stars and bars' equation with ( 9 4 ) = 126 \binom{9}{4} = 126 solutions.

Now what matters here as far as calculating S S is concerned is the total distances east, north and up the particle moves after six steps. To this end, we focus on the (ordered) partitions of 4 4 into three non-negative integers. These partitions are ( 4 , 0 , 0 ) , ( 3 , 1 , 0 ) , ( 2 , 2 , 0 ) , ( 2 , 1 , 1 ) . (4,0,0), (3,1,0), (2,2,0), (2,1,1). For each of these partitions, we can assign one element to A = ( a + d ) , A = (a + d), one to B = ( b + e ) B = (b + e) and one to C = ( c + f ) . C = (c + f). That is, we could assign the ordered triplet ( A , B , C ) (A,B,C) any of the permutations of these four partitions. So we now need to look at each of these partitions separately.

  • ( 4 , 0 , 0 ) (4,0,0) : There are 3 3 triplets ( A , B , C ) (A,B,C) associated with this partition. With, for example, A = 4 , A = 4, we must then look at the equation a + d = 4 a + d = 4 where a , d , a,d, are non-negative integers. This is again a stars and bars equation with ( 5 4 ) = 5 \binom{5}{4} = 5 solutions. Then with B = b + e = 0 B = b + e = 0 and C = c + f = 0 C = c + f = 0 each being "solved" in one way only, we have 5 1 1 = 5 5*1*1 = 5 paths associated with the triplet ( A , B , C ) = ( 4 , 0 , 0 ) , (A,B,C) = (4,0,0), and since there are 3 3 permutations of this partition we have 3 5 = 15 3*5 = 15 paths associated with this partition. For each of these paths, the distance between the starting and finishing points of the particle is 6 2 + 2 2 + 2 2 = 44 = 2 11 . \sqrt{6^{2} + 2^{2} + 2^{2}} = \sqrt{44} = 2\sqrt{11}.

  • ( 3 , 1 , 0 ) (3,1,0) : There are 6 6 triplets associated with this partition. With, for example, A = 3 , B = 1 A = 3, B = 1 and C = 0 , C = 0, we can solve A = a + d = 3 A = a + d = 3 in 4 4 ways, B = b + e = 1 B = b + e = 1 in 2 2 ways and C = c + f = 0 C = c + f = 0 in one way. Thus there are 6 4 2 1 = 48 6*4*2*1 = 48 paths associated with this partition, each having a "distance" of 5 2 + 3 2 + 2 2 = 38 . \sqrt{5^{2} + 3^{2} + 2^{2}} = \sqrt{38}.

  • ( 2 , 2 , 0 ) (2,2,0) : Quickly, we have 3 3 triplets, each associated with 3 3 1 = 9 3*3*1 = 9 paths for a total of 27 27 paths, each with a distance of 4 2 + 4 2 + 2 2 = 6. \sqrt{4^{2} + 4^{2} + 2^{2}} = 6.

  • ( 2 , 1 , 1 ) (2,1,1) : Again quickly, we have 3 3 triplets, each associated with 3 2 2 = 12 3*2*2 = 12 paths for a total of 36 36 paths, each with a distance of 4 2 + 3 2 + 3 2 = 34 . \sqrt{4^{2} + 3^{2} + 3^{2}} = \sqrt{34}.

Thus S = 1 126 ( 15 2 11 + 48 38 + 27 6 + 36 34 ) = 6.089721..... , S = \dfrac{1}{126}(15*2\sqrt{11} + 48*\sqrt{38} + 27*6 + 36*\sqrt{34}) = 6.089721.....,

and so 1000 S = 6089 . \lfloor 1000*S \rfloor = \boxed{6089}.

Well done in extending your previous problem into three dimensions! I did it pretty much the same way: partitioning into three and further each into two. I still don't understand why you are more comfortable using "stars and bars" on whole numbers rather than natural numbers.

Raghav Vaidyanathan - 6 years, 1 month ago

Log in to reply

Thanks! I'm glad that you reached the same answer; I'm always a bit nervous when I post a question that I actually have posted the correct answer. As for my "stubbornness" with stars and bars, I think that I initially learned the method (so many years ago) just with whole numbers, and old habits die hard. :P I'll try and be less stubborn in the future. haha :)

Brian Charlesworth - 6 years, 1 month ago

Log in to reply

Haha! True. It is due to the same reason that I use it the way I do. I have posted a related problem , inspired from this one. Do check it out if you have the time!

Raghav Vaidyanathan - 6 years, 1 month ago

Log in to reply

@Raghav Vaidyanathan Great! I look forward to trying it out later. :)

Brian Charlesworth - 6 years, 1 month ago

Great, entertaining problem! Thanks! I never used "stars and bars", working with more "pedestrian" techniques instead, but I managed to get the result anyway. (I did not count all the paths initially, but I added up what I got from the four cases.)

I'm finally learning some combinatorics,...it's never too late!

Otto Bretscher - 6 years, 1 month ago

Log in to reply

Haha. Thanks! I'm glad that you enjoyed working on the problem. There's always more than one path to a common solution. :)

Brian Charlesworth - 6 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...