I write down own code, ignore that

Given a simple symmetric random walk (S,),20 with So = 0, we define the following random variables: . The total number of periods from 0 to 2/V the random walk spends above zero: C2N = |[ne {1, ...,2N] : S, > 0}1. . The time of the last visit to 0) before time 2N: Law = max {0