> Instead, the algorithm should error out, since number theory shows there's no > non-zero (mod 2^61 - 2) solution to 3^a = 1 mod (2^61 - 1)
Why do you reduce (mod p-1)? (p-1) is valid integer solution by Euler's theorem. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/CAGUWgD-sccJd9kFYciFdqK2%3D8QuHMNer%3Deny%3DDWqdsHHEciGLQ%40mail.gmail.com.
