Answer:
In miller-Rabin test, write n-1 as product of an odd number 'm' and 'a' power of 2.
∴ [tex]n - 1 = mx2^k[/tex]
The format test in 'a" can be written as [tex]a^{n-1} = a^{mx2^k}[/tex]
find [tex]\bar I = a^mmodn[/tex]
⇒ if [tex]\bar I = 1[/tex] , n is a composite, otherwise 'n' is a prime.
Step-by-step explanation:
see details
