Originally Posted by
seven.j Hi all, just wondering what the method is to find an integer with order t mod m.
For example, find all integers that have order 11 (mod 45).
I know you can geuss and test, but I'm thinking there must be a faster way.
Thanks.