Added a method to check if a given n is probably prime or composite using Miller- Rabin Test. This method is faster that the sieve method to check for an arbitrary n. Please review my pull request.
Subject changed from add a method to check if a number is probably prime or composite to Add a method to check if a number is probably prime or composite (Patch included)
Assignee set to chaitanyav (NagaChaitanya Vellanki)