Show that $1373653$ is a strong pseudoprime to base $3$

188 Views Asked by At

How can I show that $n = 1373653$ is a strong pseudoprime to base $3$? I found this question as an exercise in a book I'm currently reading (which unfortunately doesnt provide a solution to this problem). My attempt: Using Miller's test to the base $3$, I have to show that $3^{343413} = 3^{7*23*27*79} \equiv 1$ (mod $829$) and (mod $1657$). I want to solve this question using my calculator as little as possible. Thanks in advance!