This project solve some problems in class. These problems are difficult to calculate answer by hand.
- Problem01 - The probability of gcd(a,n) = 1, where a is given and n is randomly selected.
- Final Project - The robustness test of CLT
-
Notifications
You must be signed in to change notification settings - Fork 0
ChampDBG/RandomProcess
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published