Last Digit of a Power

Find the last two digits of ( 3 243 ) 10 \left(3^{243}\right)_{10} in base 8. Enter your answer as a two-digit number.


The answer is 33.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Yannis Wu-Yip
Apr 20, 2019

In order to get the last two digits of 3 243 3^{243} in base 8, we first take the number m o d 64 \mod{64} , since 8 2 = 64 8^{2} = 64 , in base 10. Also note that 3 2 = 9 = 8 + 1 3^{2} = 9 = 8+1 , so we can easily reduce this exponent by using the binomial theorem.

3 243 m o d 64 3 ( 9 121 ) m o d 64 3 ( 8 + 1 ) 121 m o d 64 3 ( ( 121 1 ) ( 8 ) 1 ( 1 ) 120 + ( 121 0 ) ( 8 ) 0 ( 1 ) 121 ) m o d 64 3 ( 121 ( 8 ) + 1 ) m o d 64 3 ( 9 ) m o d 64 27 m o d 64 \begin{aligned} 3^{243} \mod{64} &\equiv 3\left(9^{121}\right) \mod{64} \\ &\equiv 3\left(8+1\right)^{121} \mod{64} \\ &\equiv 3\left(\binom{121}{1}(8)^{1}(1)^{120} + \binom{121}{0}(8)^{0}(1)^{121} \right) \mod{64} \\ &\equiv 3\left(121(8) + 1\right) \mod{64} \\ &\equiv 3(9) \mod{64} \\ &\equiv 27 \mod{64} \end{aligned}

We have now found that we have found the base 10 representation of the last two digits of the power in base 8, so we convert the number to base 8, which is 33 \boxed{33} .

215475607473713760163677411770041767434032073214605243331671250157070666002444331545125411500242636614741673350026147474265634133 8 \text{215475607473713760163677411770041767434032073214605243331671250157070666002444331545125411500242636614741673350026147474265634133}_8

First off, I know this question is a test to tell who is not enjoying the holidays ;D

The solution is straightforward. Calculate the number, modulo 8 2 = 64 8^2=64 . You will probably need Euler's theorem for that. Then the result 27 27 , which is a base 10 10 number, can be converted to base 8 8 to get 33 33 .

I actually came up with this question a while ago in preparation for a test, but wasn't sure if this was worth posting here. :)

Yannis Wu-Yip - 2 years, 1 month ago

Log in to reply

it was definitely a good practice for me ;) cheers

A Former Brilliant Member - 2 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...