title: Composite Number
signature: function compositeNumber($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(
        62, 
        true));
      
      printf("TEST-1...%s\n",driver(
        13, 
        false));
      
      printf("TEST-2...%s\n",driver(
        29, 
        false));
      
      printf("TEST-3...%s\n",driver(
        72, 
        true));
      
      printf("TEST-4...%s\n",driver(
        30, 
        true));
      
      printf("TEST-5...%s\n",driver(
        20, 
        true));
      
      printf("TEST-6...%s\n",driver(
        10, 
        true));
      
      printf("TEST-7...%s\n",driver(
        47, 
        false));
      
      printf("TEST-8...%s\n",driver(
        91, 
        true));
      
      printf("TEST-9...%s\n",driver(
        52, 
        true));
      
  }
  
  main();
  ?>
source_py: def composite_number(n):
      if (n <= 1):
          return False
      if (n <= 3):
          return False
      if (((n % 2) == 0) or ((n % 3) == 0)):
          return True
      i = 5
      while ((i * i) <= n):
          if (((n % i) == 0) or ((n % (i + 2)) == 0)):
              return True
          i = (i + 6)
      return False
source_cpp: bool composite_number(int n) {
    if ( n <= 1 ) return false;
    if ( n <= 3 ) return false;
    if ( n % 2 == 0 || n % 3 == 0 ) return true;
    for ( int i = 5;
    i * i <= n;
    i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return true;
    return false;
  }