Tagged Questions
2
votes
2answers
85 views
Miller-Rabin Primality Test
I am trying to work out the potential primality of 341 using the Miller-Rabin algorithm. Below is as far as I get, I'm not really sure where to go from there. I believe I am supposed to use modular ...
0
votes
2answers
109 views
Use Lucas' test with $a=7$ and prove $71$ is prime
My working so far:
$71-1=70$ and Prime factors of $70$ are $2 \times 5 \times 7$
Check $a=7$:
$7^{(\frac{70}{2})} \equiv 7^{35} \equiv x (mod 71)$
How do I find $x$? Usually I would use Fermat's ...
