title: Prime Numbers
signature: def primeNumbers(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(
        2, 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        74, 
        false    
      )}")   
  
  
      println(s"TEST-2...${driver(
        46, 
        false    
      )}")   
  
  
      println(s"TEST-3...${driver(
        38, 
        false    
      )}")   
  
  
      println(s"TEST-4...${driver(
        51, 
        false    
      )}")   
  
  
      println(s"TEST-5...${driver(
        48, 
        false    
      )}")   
  
  
      println(s"TEST-6...${driver(
        6, 
        false    
      )}")   
  
  
      println(s"TEST-7...${driver(
        14, 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        31, 
        true    
      )}")   
  
  
      println(s"TEST-9...${driver(
        10, 
        false    
      )}")   
  
  }
  
source_py: def prime_numbers(n):
      if (n <= 1):
          return False
      for i in range(2, n):
          if ((n % i) == 0):
              return False
      return True
source_cpp: bool prime_numbers(int n) {
    if ( n <= 1 ) return false;
    for ( int i = 2;
    i < n;
    i ++ ) if ( n % i == 0 ) return false;
    return true;
  }