IOQM 2024 Q14 particle movement
For example, after the first step, there are \(3^{79}\) particles each at (1,1), (0,1) and (-1,1). After the second step, there are \(3^{78}\) particles each at (-2,2) and (2,2), \(2 \times 3^{78}\) particles each at (-1,2) and (1,2), and \(3^{79}\) particles at (0,2). After 80 steps, the number of particles at (79,80) is:
Solution:
Original problem has large numbers like 3^80. So let's see how to solve a smaller problem.
Let there be 3^2 particles with the same rules.
Let's figure out what happens after 2 steps.
Initially 9 particles at (0,0)
First step:
(0,1): 3 particles
(1,1): 3 particles
(-1,1): 3 particles
Second step:
From (0,1):
1 on (0,2).
1 on (1,2).
1 on (-1,2).
From (1,1):
1 on (0,2).
1 on (1,2).
1 on (2,2).
From (-1,1):
1 on (0,2).
1 on (-1,2).
1 on (-2,2).
In the first step we had 3 subgroups and each of them size 3.
In the second step we had 9 subgroups and each of them size 1.
Now, list the positions with number of particles:
3 on (0,2)
2 on (1,2)
2 on (-1,2)
1 on (2,2)
1 on (-2,2)
Let's figure out the possible paths taken by particles to reach on each co-ordinate:
(0,0) to (0,2) => RL,LR,SS => 3 particles = 2!/(1!.1!) + 2!/2!
(0,0) to (1,2) => RS,SR => 2 particles = 2!/(1!.1!)
(0,0) to (-1,2) => LS,SL => 2 particles = 2!/(1!.1!)
(0,0) to (2,2) => RR => 2 particles = 2!/2!
(0,0) to (-2,2) => LL => 1 particles = 2!/2!
So number of particles at a co-ordinate is same as number of ways to reach there.
And each particle took a different path to reach its destination.
Extending the same logic to 3^80 particles:
Problem restatement
-
We start with particles at .
-
During each of 80 “time steps” every particle moves exactly one unit up ( ) and, horizontally, chooses
-
R :
-
S :
-
L :
-
Because is divisible by 3 for every , the rule “” always splits each clump perfectly evenly. Consequently:
-
After 1 split every subgroup has size ;
-
after 2 splits every subgroup has size ;
-
…
-
after 80 splits every subgroup has size .
Hence each of the particles follows a distinct 80‑step word of ; there is a one‑to‑one correspondence
Coordinates after 80 steps
Let a particular particle use
-
right moves (),
-
left moves (),
-
straight moves (),
with .
The net horizontal displacement is
We want the particles that finish at .
Thus
Solve the system
-
(from the first equation);
-
Substitute in the second: .
Because are non‑negative integers:
-
,
-
.
The only integer satisfying both is .
Then and .
So every particle that ends at must have
Counting the admissible paths
Place the single somewhere among the 80 steps; the remaining 79 steps are all .
The number of distinct orderings is the multinomial count
Because each path corresponds to exactly one particle at time 80, we obtain
Quick sanity check with the statement’s example
After two steps the problem statement reports
-
particles at and (paths and ),
-
at and (two paths each),
-
at (three paths).
Indeed these multiplicities match the number of admissible 2‑step sequences that reach each .
The identical reasoning extended to 80 steps gives a total of 80 admissible sequences reaching , confirming the result.
________________
Now, what if I modify the problem like this:
Initially there are 2^80 particles and at each step half the particles move to (x,y+1) and other half to (x+1,y+1). Then how many will be there at (79,80) after 80 steps?
Answer: 80 again.
Coming back to original problem, how many will there be at (78,80) and (77,80) after 80 moves?
A. For (78,80) there are 2 ways:
A1. 78R + 2S = 80!/(78!.2!)
A2. 79R + 1L = 80!(79!)
Add them to get the answer.
B. For (77,80):
B1. 77R, 3S = 80!/(77!3!)
B2. 78R, 1L, 1S = 80!/(78!)
Add them to get the answer.
____________________________
Comments
Post a Comment