1
$\begingroup$

You are given three non-negative integers $A$, $B$ and $C$, find a number $X$ (say) satisfy $X^A \equiv B\pmod{2C + 1}$ and $0 \le X \le 2C$.

I am inquisitive about how to approach this one?

  • 1
    [Hmm...](http://portal.acm.org/citation.cfm?id=315094)2010-12-16
  • 0
    @J.M:I don't have ACM access yet! :(2010-12-16
  • 1
    The paper (A Generalized q-th Root Algorithm)) suggested above can be found at the author's publication page http://www.computing.dcu.ie/~ajohnston/pub.htm2010-12-16

2 Answers 2