Function calculates all number not greater than ' m ' which are relatively prime with n .
static int countRelPrime ( int n , int m ) { int [ ] a = new int [ 20 ] ; int i = 0 , j = 0 ; int pz = prime . Count ; while ( n != 1 && i < pz ) {