Re: [sympy] digital logarithm

Discrete logarithm has no "efficient solution" in general. For example finding `y = x**n mod m` (i.e. in the set of integers modulo `m`) is hard, but finding the discrete logarithm in the set of integers is easy. Isuru On Thu, Jan 11, 2018 at 4:35 PM, Chris Smith wrote: > I

[sympy] digital logarithm

I was inspired to dig a little deeper into the issue raised in PR #13844, finding the exponent of integer `x` in `y`, More specifically, finding whether `y` is exactly `x**n`. I read here that this problem has "no efficient solution". But I