Miller Rabin Primality Test Example 2 | Miller rabin primality test algorithm in Cryptography c++

Mam in first case we got t = 11
So according to rule first it is not prime
How is it possible in one case it is prime and in another case it is not prime

Hello mam, can you please guide me about 60=-1???
if possible?

For 61 if we take k=1 then T=11 which says 61 is not prime number.....but 61 is a prime number.....so whats the logic behing taking k value

Beautiful explanation thanks pernita please upload next video lectures on further topic.

If you do it for 27 ,,
then it will be 27-1= m*2^k => 26=m*2^k => 13*2^1 = m * 2^k
So we basically gets k=1 . And we know 27 is not prime number . So what about it ??

In question: n=29 is prime or not? But there's no value of a given in it..How could I solve this problem..what's the value of a?

Thank you very much , mam!

Thank you ma'am it was nice understandable video.. But ma'am value of m should always be odd so v take k=2

Mam can u calculate for 561 n a value is 2.

thank you so much madame

Well explained👍👍👍

Can you please show how to calculate for 561 using Miller Rabin Test

Very good example taken 👌👌👌

Thank you

Thank you for this discussion ...

Thank you for this clear explanation