I have put the following into wolframalpha.com $$ 11 \equiv x* \left(y^{119}\right)^{149} \pmod{151} $$ It is giving me a set of solutions back. Is it just iterating over all the values of x and y, since my group is so small, or is there something else that can be done to find those solutions efficiently? How can I replicate this feature in Octave, or programmatically?
Ideally i'd like to do this sort of thing for a much larger group (512 bit integers)