$3\mathrm{.}6.$ The generalized discrete log problem is described as follows. Given a finite

cyclic group $G$ of order ninN, a generator $$ of $G,$ and an element $inG,$

find that unique nonnegative integer $xn-1$ such that ${}^x=.$ Given

the fact that such a group $G$ is isomorphic to $\frac{Z}{n}Z($see page $295),$ one

would expect that an efficient algorithm for computing discrete logs in

one group would imply an efficient algorithm for the other group. Explain

why this is not the case.