## solution to the general congruence

Can anyone help me to provide a solution to the general congruence:

$$x^n =a Mod (b)$$ a,n and b integers or the integer solution to

equations of the form:

$$a x^n + by= c$$ solutions for integer x and y
 PhysOrg.com science news on PhysOrg.com >> King Richard III found in 'untidy lozenge-shaped grave'>> Google Drive sports new view and scan enhancements>> Researcher admits mistakes in stem cell study
 what prior knowledge was given in the course? Roots? or Powers n^x=amodb? P
 Recognitions: Gold Member Science Advisor Staff Emeritus Plug it into Magma. I would do it as follows. (1) First, find the prime factorization of b. Let's assume b = p^2 * q (2) Find the n-th root of a modulo p and modulo q. (I know the Shanks-Tonelli algorithm works for square roots, and can be adapted for arbitrary roots. There may be a better way) (3) Use Hensel lifting to find an n-th root of a modulo p^2 (4) Use the Chinese Remainder Theorem to find an n-th root of a modulo b