title: Primality Test Set 5Using Lucas Lehmer Series
signature: function primality_test_set_5using_lucas_lehmer_series(p)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(p, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(p), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(11, false);
      @printf("TEST-0...%s\n",result);
      
      result = driver(27, false);
      @printf("TEST-1...%s\n",result);
      
      result = driver(31, true);
      @printf("TEST-2...%s\n",result);
      
      result = driver(47, false);
      @printf("TEST-3...%s\n",result);
      
      result = driver(3, true);
      @printf("TEST-4...%s\n",result);
      
      result = driver(14, false);
      @printf("TEST-5...%s\n",result);
      
      result = driver(41, false);
      @printf("TEST-6...%s\n",result);
      
      result = driver(72, false);
      @printf("TEST-7...%s\n",result);
      
      result = driver(39, false);
      @printf("TEST-8...%s\n",result);
      
      result = driver(22, false);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def primality_test_set_5using_lucas_lehmer_series(p):
      checkNumber = ((2 ** p) - 1)
      nextval = (4 % checkNumber)
      for i in range(1, (p - 1)):
          nextval = (((nextval * nextval) - 2) % checkNumber)
      if (nextval == 0):
          return True
      else:
          return False
source_cpp: bool primality_test_set_5using_lucas_lehmer_series(int p) {
    long long checkNumber = pow ( 2, p ) - 1;
    long long nextval = 4 % checkNumber;
    for ( int i = 1;
    i < p - 1;
    i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber;
    return ( nextval == 0 );
  }