title: Eulers Criterion Check If Square Root Under Modulo P Exists
signature: eulersCriterionCheckIfSquareRootUnderModuloPExists :: Integer -> Integer -> Bool
  eulersCriterionCheckIfSquareRootUnderModuloPExists n p = 
source_py: def eulers_criterion_check_if_square_root_under_modulo_p_exists(n, p):
      n = (n % p)
      for x in range(2, p, 1):
          if (((x * x) % p) == n):
              return True
      return False
source_cpp: bool eulers_criterion_check_if_square_root_under_modulo_p_exists(int n, int p) {
    n = n % p;
    for ( int x = 2;
    x < p;
    x ++ ) if ( ( x * x ) % p == n ) return true;
    return false;
  }