- #1
- 2,844
- 0
Is there a good algorithm for determining for what values of k [itex]2^k=n[/itex] in [itex]\mathbb{Z}/p[/itex]? I expect the number of solutions for k to be either 0 or a number dividing p-1, but beyond that I have nothing but brute force. Suggestions?
I think this is a fairly basic question, but I can't think of an answer. Can someone point me in the right direction?
I think this is a fairly basic question, but I can't think of an answer. Can someone point me in the right direction?