Modulo arthmetic solve for x^N .

[shadowhywind]

Modulo arthmetic solve for x^N...

Hay all, I am stuck on a problem, and its driving me crazy. I have a problem, x^N = a mod b. Where I have to solve for x. My first thought was use to Fermat's little theorem(if I have the name correct), however my b is not a prime, (neither is 'N' or 'a' for that fact). I can give the exact problem with numbers if needed, but thought it would be slightly easier with variables instead. Any tips on how I could start to solve this would be great. Any questions please ask.

 

[ramsey2879]

I believe there is no generic solution to this problem.

 

[Matthollyw00d]

Giving the actual numbers would probably be best for this one.

 

[Petek]

Google nth power residue for lots of results (and references to specific number theory texts) regarding your question.

Petek

 

[Hurkyl]

Chinese remainder theorem.

 

[CRGreathouse]

Chinese remainder theorem.

Yes. Factor b, use Fermat, then CRT the results together.