//Include some libraries #include #include #include #include //Create a long double PI const double PI = 3.141592653589793238; //Set the initial value of primes and total to 0 int primes = 0; int total = 0; //Create a constant for the maximal value a randomly chosen number can be const int ranMax = 10000; //Create a constant for the amount of pairs the program will check (increase this number if you want to get more and more accurate values for pi) const int n = 100000; //Create a function which returns an integer chosen between 0 and ranMax (100) int ranNum(){ //Use the modulo in order to get the rest of rand() divided by ranMax, therefore it will return a value between 0 and ranMax return rand() % ranMax; } //Create a function which, for two given integers a and b, returns true if they are relatively prime and false if they aren't bool arePrime(int a, int b){ //2 numbers a relatively prime if their highest common divisor is equal to 1 //Use Euclid's method int i; while(b != 0){ i = a; a = b; b = i % b; } //Return true if a = 1, otherwise return false return (a == 1); } //Declare the main function int main(){ //Initialize a random seed in order to use the rand() function properly srand(time(NULL)); //Repeat the loop n (1000) times while(total < n){ //Check if 2 randomly chosen numbers are relatively prime if(arePrime(ranNum(),ranNum())){ //If they are, increase the primes integer by 1 primes++; } //No matter if they are or not, increase the total value of numbers checked by 1 total++; } //Evaluate the value of the random pi using the formula const double ranPi = sqrt(total*6.0/primes); //Evaluate the accuracy of the random pi const float relErr = 100.0*fabs(ranPi-PI)/PI; //Set the decimal precision of the console up to 10 std::cout.precision(10); //Print what happend while the program was running for the user std::cout<<"Pi = "<

GET PI USING RANDOMNESS (commented)