(adsbygoogle = window.adsbygoogle || []).push({}); New here, quick thought :)

Well, this is probably an easy question, but I've been out of school for some time though until recently.

I figured I'ld ask it here cause physics junkies > math junkies :)

What would be the easiest route towards aquiring a int^int +/- remainder result from a fairly large number, in the billions +.

So, if given the number

345,231,234,564,234

It would give the solution (pretend the math is right)

4^34 with a remainder of -342

which would equate to, 4 to the 34th, minus 342.

the remainder can be positive or negative, but the goal is to get the nearest int^int combo, with minimal remainder....

lol

thank for any help that might be had :)

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

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

# New here, quick thought

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