title: Composite Number
signature: compositeNumber(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          62, 
          true)
      }");
  
      print("TEST-1...${driver(
          13, 
          false)
      }");
  
      print("TEST-2...${driver(
          29, 
          false)
      }");
  
      print("TEST-3...${driver(
          72, 
          true)
      }");
  
      print("TEST-4...${driver(
          30, 
          true)
      }");
  
      print("TEST-5...${driver(
          20, 
          true)
      }");
  
      print("TEST-6...${driver(
          10, 
          true)
      }");
  
      print("TEST-7...${driver(
          47, 
          false)
      }");
  
      print("TEST-8...${driver(
          91, 
          true)
      }");
  
      print("TEST-9...${driver(
          52, 
          true)
      }");
  
      return 0;
  }
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;
  }