Monte Carlo Particle Transport Methods: Neutron and Photon - gnssn

thus,As it is proved" — and is so pLiiivblt rn < >< > >derivation — an n digit binary ran Iwn • m >1 1digits after the binary point. Since in , u\ cii , i m . inot fill in continuously the (0,1) inte v, * JI ' mthe really random and therefore neui iep ate ) s< . ie ttiri i> irandom numbers uniformly distributed on (0,1). In the n a i < ioi iused transformation methods are overviewed.Many special techniques are listed in the very early r>' j > r. '> ' >of particles after collisions) are described in the appendi< < « i > ru piBefore turning to the summary of the most common 1 i j falso heuristically obvious and is often met in conjunctioi « it • .. u / i i i imethods.Theorem 2.1 — Let p,, p 2, . . . ,p„ be probabilities of the e,, e 2, . . . ,e nmutuallyexclusive events and assume that:111 ]For the selection of one of the discrete events let us first select a random number 0 equidistributedon (0,1). Then the event e, is selected if the inequalityis fulfilled.P 1+ + P,- , 5 5 P < P 1+ ••• +- P, AlA)