Mathematics(Level -2)

1) Check for prime bool is Prime(int n) { if(n<= 1) return false; if(n==2 ||| n==3) return true; if(n%2==0 || n%3==0) return false; // Check from 5 to square root of n // Iterate i by (i+6) for(int i=5; i<= sqrt(n;...