title: Composite Number
signature: def compositeNumber(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Boolean , expected: Boolean): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Boolean): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        62, 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        13, 
        false    
      )}")   
  
  
      println(s"TEST-2...${driver(
        29, 
        false    
      )}")   
  
  
      println(s"TEST-3...${driver(
        72, 
        true    
      )}")   
  
  
      println(s"TEST-4...${driver(
        30, 
        true    
      )}")   
  
  
      println(s"TEST-5...${driver(
        20, 
        true    
      )}")   
  
  
      println(s"TEST-6...${driver(
        10, 
        true    
      )}")   
  
  
      println(s"TEST-7...${driver(
        47, 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        91, 
        true    
      )}")   
  
  
      println(s"TEST-9...${driver(
        52, 
        true    
      )}")   
  
  }
  
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;
  }