title: Lehmann Test for prime numbers
body: <p>I learn cryptography at my university, and I need to make an application for testing numbers as prime numbers. </p>
  
  <p>I must to do it using <strong>Lehmann Test</strong>, but I don't know anything about it. Please, describe me the algorithm or give me an example (Java, C#, C++, etc). Thank you for helping.  </p>