Charles Kicey - Academia.edu (original) (raw)
Uploads
Papers by Charles Kicey
edu Abstract-Computer simulation is a widely used powerful tool for solving real world problems. ... more edu Abstract-Computer simulation is a widely used powerful tool for solving real world problems. Pseudo random number plays an important role in computer simulation and modeling. It acts like the real random number. We discuss the asymptotic properties of pseudo random numbers as the period size of a random number generator approaches to infinity . Our results show that the pseudo random number converges to the true random number in mean, variance, skewness, kurtosis, moment, and distribution.
Discrete Mathematics, Oct 2014
A circular Pascal array is a periodization of the familiar Pascal’s triangle. Using simple operat... more A circular Pascal array is a periodization of the familiar Pascal’s triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain lattice paths within corridors, which are related to Dyck paths. This link provides new,
short proofs of some nontrivial formulas found in the lattice-path literature.
edu Abstract-Computer simulation is a widely used powerful tool for solving real world problems. ... more edu Abstract-Computer simulation is a widely used powerful tool for solving real world problems. Pseudo random number plays an important role in computer simulation and modeling. It acts like the real random number. We discuss the asymptotic properties of pseudo random numbers as the period size of a random number generator approaches to infinity . Our results show that the pseudo random number converges to the true random number in mean, variance, skewness, kurtosis, moment, and distribution.
Discrete Mathematics, Oct 2014
A circular Pascal array is a periodization of the familiar Pascal’s triangle. Using simple operat... more A circular Pascal array is a periodization of the familiar Pascal’s triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain lattice paths within corridors, which are related to Dyck paths. This link provides new,
short proofs of some nontrivial formulas found in the lattice-path literature.