What's the formula for calculating large exponents?

1. Nov 1, 2007

slakedlime

[SOLVED] What's the formula for calculating large exponents?

Hi! I came across the following sum and was wondering if there was some kind of formula for solving it:

16^198

Is it some kind of binomial expansion? Do you calculate the last digits first, advancing to the previous ones later?

I can't use a calculator.

Last edited: Nov 1, 2007
2. Nov 2, 2007

Gib Z

It wants you to evaluate 16^(198) without a calculator?

Its approximately $$2.60469314 \cdot 10^{238}$$, even with an efficient method it would take an enormous amount of time to evaluate, you sure you don't mean approximate, or find the last 5 digits of it?

3. Nov 2, 2007

uart

Yeah it's not actually solving it but I can make a very rough approximation because I happen to remember that log_10(2) is pretty close to 0.3. Keeping this approx figure in your head lets you do quick and nasty power of 2 to power of 10 (or visa versa) conversions without a calculator.

So in this case $$16^{198} = 2^{4*198} \simeq 10^{0.3 * 4 * 198}$$, which gets you an order of magnetude calcuation of 10^238.

Last edited: Nov 2, 2007
4. Nov 2, 2007

slakedlime

I can do the approximations, but is there any way to find the last 6 digits? The question asked for both the approximation and the last 6 digits, so I thought perhaps the method would be similar and that there would be a formula.

Does this have something to do with modular mathematics?

Thank you for your help. :)

5. Nov 2, 2007

Zurtex

Why would it take an enormous amount of time to evaluate? Just multiply it out...

260469313784369307581244210575049132700967121965465162515478820772032704602251252793805945346545089482145699632555985954917531314614037698451693595794.... (Edit I've removed the last load of digits not to make it too easy for you).

Takes fractions of seconds on modern computers.

And yeah, doing it via modular arithmetic is even easier. Because if you want to know the last 6 digits you can just take it mod 1'000'000, so you can just keep knocking off any digits larger than the first 6.

Last edited: Nov 2, 2007
6. Nov 2, 2007

Moo Of Doom

You didn't read the "without a calculator" part, didn't you?

7. Nov 2, 2007

Zurtex

Well I didn't use a calculator :P

But yeah, it looks like you have to do some clever modular arithmetic, it'd pretty easy mod 10, mod 100 or perhaps even mod 1'000 by hand, but it's a bit of a pain mod 1'000'000.

I'll think on a bit and see if I come up something (certainly nothing that immediately came to mind worked).

8. Nov 2, 2007

Count Iblis

I would suggest to give the answer in the binary number system

9. Nov 2, 2007

slakedlime

Thank you all for trying. Forget 6 digits. My exam's tomorrow afternoon, so if it'd be easier to find the last two digits without using a calculator, could you guys show me how? I'd just like to have an idea even if I can't answer.

10. Nov 2, 2007

Count Iblis

16^198 = 16^(2*3^2 * 11)

All computations mod 100 below:

16^2 = 256 = 56

16^(2*3) = 56^3 = 16

16^(2*3^2) = 16^3 mod(100) = 96 = -4

16^(2*3^2*11) = (-4)^11 =-2^22

now 2^10 = 1024 = 24

so 2^20 = 24^2 = 576 = 76

2^22 = 2^20 * 4 = 76*4 = 4 ------>

16^198 = -4 = 96

11. Nov 2, 2007

slakedlime

I didn't quite catch that part.

12. Nov 4, 2007

Zurtex

Reducing it down to the results rather than the calculations:

16^198 = 16^(2*3^2 * 11)

16^(2*3^2*11) = (-4)^11 =-2^22

2^22 = 4

16^(198) = -4

-4 is the same as 96, mod 100.