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 - The Fusion of Science and Community**

Join Physics Forums Today!

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

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

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

Loading...

Similar Threads for Solving x^{n}+a=mod | Date |
---|---|

I Difference between R^n and other vector spaces | Apr 5, 2018 |

I Solving System of Equations w/ Gauss-Jordan Elimination | Sep 18, 2017 |

I Solving a system of linear equations using back substitution | Aug 30, 2017 |

I Matrix Equation -- clarification about solving a system | Aug 1, 2017 |

**Physics Forums - The Fusion of Science and Community**