title: Primality Test Set 1 Introduction And School Method 1
signature: function primalityTestSet1IntroductionAndSchoolMethod1($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        15, 
        false));
      
      printf("TEST-1...%s\n",driver(
        90, 
        false));
      
      printf("TEST-2...%s\n",driver(
        38, 
        false));
      
      printf("TEST-3...%s\n",driver(
        65, 
        false));
      
      printf("TEST-4...%s\n",driver(
        91, 
        false));
      
      printf("TEST-5...%s\n",driver(
        16, 
        false));
      
      printf("TEST-6...%s\n",driver(
        48, 
        false));
      
      printf("TEST-7...%s\n",driver(
        74, 
        false));
      
      printf("TEST-8...%s\n",driver(
        14, 
        false));
      
      printf("TEST-9...%s\n",driver(
        47, 
        true));
      
  }
  
  main();
  ?>
source_py: def primality_test_set_1_introduction_and_school_method_1(n):
      if (n <= 1):
          return False
      if (n <= 3):
          return True
      if (((n % 2) == 0) or ((n % 3) == 0)):
          return False
      i = 5
      while ((i * i) <= n):
          if (((n % i) == 0) or ((n % (i + 2)) == 0)):
              return False
          i = (i + 6)
      return True
source_cpp: bool primality_test_set_1_introduction_and_school_method_1(int n) {
    if ( n <= 1 ) return false;
    if ( n <= 3 ) return true;
    if ( n % 2 == 0 || n % 3 == 0 ) return false;
    for ( int i = 5;
    i * i <= n;
    i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return false;
    return true;
  }