If a,b,n are integers..how could you solve:(adsbygoogle = window.adsbygoogle || []).push({});

[tex] x^{n}+a=mod(b) [/tex] n>0 and integer..

If possible please put an "step by step" example..i have managed to solve the linear congruence

[tex] ax=bmod(c) [/tex] but i don't know how to solve "upper" congruences..thanks.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Solving x^{n}+a=mod(b)

**Physics Forums | Science Articles, Homework Help, Discussion**