title: Primality Test Set 1 Introduction And School Method
signature: function primality_test_set_1_introduction_and_school_method(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(37, true);
      @printf("TEST-0...%s\n",result);
      
      result = driver(39, false);
      @printf("TEST-1...%s\n",result);
      
      result = driver(73, true);
      @printf("TEST-2...%s\n",result);
      
      result = driver(8, false);
      @printf("TEST-3...%s\n",result);
      
      result = driver(28, false);
      @printf("TEST-4...%s\n",result);
      
      result = driver(66, false);
      @printf("TEST-5...%s\n",result);
      
      result = driver(20, false);
      @printf("TEST-6...%s\n",result);
      
      result = driver(36, false);
      @printf("TEST-7...%s\n",result);
      
      result = driver(6, false);
      @printf("TEST-8...%s\n",result);
      
      result = driver(51, false);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def primality_test_set_1_introduction_and_school_method(n):
      if (n <= 1):
          return False
      for i in range(2, n):
          if ((n % i) == 0):
              return False
      return True
source_cpp: bool primality_test_set_1_introduction_and_school_method(int n) {
    if ( n <= 1 ) return false;
    for ( int i = 2;
    i < n;
    i ++ ) if ( n % i == 0 ) return false;
    return true;
  }