definition:
Miller Rabin algorithm is a randomized prime test algorithm, the role is determined whether a number is a prime number, andAs long as you do not face huge black and constants do notIn general, than \ (O (\ sqrt n) \) the simple practice faster.