Magnawa, Marc Cyrel M.

| 2018–09963 Physics 116

 
P1
Question: Given r = q = 1/2, P1 (0) = 0.2, P1 (0) = 0.2, and P1 (0) = 0.2, find P2  (N ), for N = 1, 2, 3, 4, 5, 100, 101.
P3

It was already established that

    
P1 0 q r P1
P2  (N ) = r 0 q  P2  (N − 1). (1)
P3 q r 0 P3

For simplicity, set q = r, since q = r = 1/2.

Thus, for N = 1,
             
P1 0 q r P1 0 r r P1 0 1 1 P1 0 1 1 0.2
P2  (1) = r 1 1
0 q  P2  (0) = r 0 r  P2  (0) = 1 0 1 P2  (0) = 1 0 1 0.3 .
r 2
P3 q r 0 P3 r r 0 P3 1 1 0 P3 1 1 0 0.5

For N = 2,
          
P1 0 q r P1 0 r r  0 1 1 P1 
P2  (2) = r 0 q  P2  (1) = r 0 r  r 1 0 1 P2  (0)
P3 q r 0 P3 r r 0 1 1 0 P3
 
        
2r r r P1 2 1 1 P1 2 1 1 0.2
1
= r  r 2r r  P2  (0) = r2 1 2 1 P2  (0) = 1 2 1 0.3 .
4
r r 2r P3 1 1 2 P3 1 1 2 0.5

For N = 3,
          
P1 0 q r P1 0 r r  2 1 1 P1 
P2  (3) = r 0 q  P2  (2) = r 0 r  r2 1 2 1 P2  (0)
P3 q r 0 P3 r r 0 1 1 2 P3
 
        
2r 3r 3r P1 2 3 3 P1 2 3 3 0.2
1
= r2 3r 2r 3r P2  (0) = r3 3 2 3 P2  (0) = 3 2 3 0.3 .
8
3r 3r 2r P3 3 3 2 P3 3 3 2 0.5

For N = 4,
          
P1 0 q r P1 0 r r  2 3 3 P1 
P2  (4) = r 0 q  P2  (3) = r 0 r  r3 3 2 3 P2  (0)
P3 q r 0 P3 r r 0 3 3 2 P3
 
        
6r 5r 5r P1 6 5 5 P1 6 5 5 0.2
1
= r3 5r 6r 5r P2  (0) = r4 5 6 5 P2  (0) = 5 6 5 0.3 .
16
5r 5r 6r P3 5 5 6 P3 5 5 6 0.5

For N = 5,
          
P1 0 q r P1 0 r r  6 5 5 P1 
P2  (5) = r 0 q  P2  (4) = r 0 r  r4 5 6 5 P2  (0)
P3 q r 0 P3 r r 0 5 5 6 P3
 
        
10r 11r 11r P1 10 11 11 P1 10 11 11 0.2
1
= r4 11r 10r 11r P2  (0) = r5 11 10 11 P2  (0) = 11 10 11 0.3 .
32
11r 11r 10r P3 11 11 10 P3 11 11 10 0.5

1
    
0 q r 0 r r
For simplicity, let T = r 0 q  = r 0 r . Then,
q r 0 r r 0
 N  
0 r r aN bN bN
TN = r 0 r  = r N  bN aN bN  , a, b ∈ Z. (2)
r r 0 bN bN aN

Furthermore, it can be inductively shown that

3
X
TN = aN + bN + bN = aN + 2bN = 2N .


ij
(3)
j=1

Additionally, it can be inferred by induction that aN is always off by 1 from bN (that is, |aN − bN | = 1 ∀N ∈ Z).
For all odd cases, aN + 1 = bN ; for even cases, aN = bN + 1.

First, examining all odd cases of N ,

aN + 2bN = 2N
aN + 2(aN + 1) = 2N
3aN + 1 = 2N . (4)

Dividing both sides of (4) by 3,

1 2N
aN + = . (5)
3 3
Taking the floor of both sides,
   N
1 2
aN + = . (6)
3 3

Since aN ∈ Z, then aN + 13 = aN . As such, (6) can be simplified to

 

2N


aN = , (7)
3
N
 
2
bN = aN + 1 = + 1. (8)
3

From (7) and (8), equation (2), for odd values of N , can be written as
 
j Nk j Nk j Nk
2 2 2
 3 3 +1 3 + 1     

j k j k j k
  2N  1 1 1 0 1 1 
TN = rN  N
 
2N 2N 2N 1 1 1 + 1 0 1
 3 +1 3 3 =r  3
+ 1
1 1 1 1 1 0
  
j N k j Nk j Nk 
2 2 2
3 +1 3 +1 3
           
 2N
  1 1 1 1 1 1 1 0 0   2N   1 1 1 1 0 0 
= rN 1 1 1 + 1 1 1 − 0 1 0 = rN + 1 1 1 1 − 0 1 0 .
 3 3
1 1 1 1 1 1 0 0 1 1 1 1 0 0 1
  
(9)

Next, examining all even cases of N , solving for aN and bN using the same process:

(bN + 1) + 2bN = 2N
3bN + 1 = 2N
1 2N
bN + =
3 3

2
    N
1 2
bN + = ;
3 3
 N
2
bN = , (10)
3
2N
 
aN = bN + 1 = + 1. (11)
3
Rewriting (2) for even values of N using (10) and (11),
 
j Nk j Nk j Nk
2 2 2
 3 +1 3 3      

j k j k j k
  2N  1 1 1 1 0 0 
TN = rN   = rN
 
2N 2N 2N 1 1 1 + 0 1 0 . (12)
 3 3 +1 3   3
1 1 1 0 0 1
  
 j Nk j Nk j Nk 
2 2 2
3 3 3 +1
 
1 1 1
For simplicity, let A = 1 1 1. Since r = 1/2, from (9) and (12),
1 1 1
 N   
1 2



 2N + 1 A − I , N odd,
N 3
T =  N   (13)
 1 2

 A + I , N even.
2N 3
From (1) and (13),
   
P1 P1
P2  (N ) = TN P2  (0). (14)
P3 P3
Equation (14) can now be used as such:
For N = 100,
            
P1 0.2  100   0.2  100  1 1 1 1 0 0  0.2
P2  (100) = T100 0.3 = 1 2 1 2

A + I 0.3 = 100 1 1 1 + 0 1 0 0.3
2100 3 2  3
P3 0.5 0.5 1 1 1 1 0 1 0.5

 
j 100 k j 100 k j 100 k
2 2 2
 3 +1 3 3  
j 100 k  0.2
 
1  j 100 k j 100 k
 0.3 .
= 100   2 2
+1 2
2  3 3 3 
 0.5
 j 100 k j 100 k j 100 k 
2 2 2
3 3 3 +1

For N = 101,
     
P1 0.2  101    0.2
P2  (101) = T101 0.3 = 1 2
+ 1 A − I 0.3
2101 3
P3 0.5 0.5
      
 1 1 1 1 0 0  0.2
1  2101
 
= 101 + 1 1 1 1 + 0 1 0 0.3
2 3
1 1 1 1 0 1 0.5
 
 
j 101 k j 101 k j 101 k
2 2 2
 3 3 + 1 3 + 1  
  0.2
1 j k j k j k 
= 101  2101 2101 2101  0.3 .
2 + 1 + 1
 3 3 3
 
j 101 k  0.5

j 101 k j 101 k
2 2 2
3 +1 3 +1 3