'POWER OF 3'

3 3 = 2 7 3 4 = 8 1 3 5 = 2 4 3 3 6 = 7 2 9 \begin{array}{ccr} 3^3 &= &{\color{#D61F06}{2}}7 \\ 3^4 &= &{\color{#D61F06}{8}}1 \\ 3^5 &= &2{\color{#D61F06}{4}}3 \\ 3^6 &= &7{\color{#D61F06}{2}}9\\ &\vdots & \end{array}

True or False?

For any power of 3 , when the tens digit exists, it is always even (that is, 0, 2, 4, 6, or 8).

False True

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

If you are unfamiliar with modular arithmetic or congruence, then:

a b ( m o d n ) a \equiv b \pmod{n} is read as " a a is congruent to b b modulo n . n. " It means that ( a b ) (a-b) is divisible by n n or a a and b b both leave equal remainder when divided by n n .

A number n n is said to have an even ten's digit if there exists integer k k such that n k m o d 20 n\equiv k \mod20 and k < 10. k<10.

Also observe that 3 4 1 m o d 20 3^4 \equiv1 \mod20 , multiplying both sides by 3 n 3^n we get 3 n + 4 3 n m o d 20 3^{n+4}\equiv 3^n \mod20 , thus there are only 4 possible distinct remainders when 3 n 3^n is divided by 20 20 .

So observing from the start( n = 0 n=0 ),

3 0 1 m o d 20 3^{0} \equiv 1\mod{20}

3 1 3 m o d 20 3^{1} \equiv 3\mod{20}

3 2 9 m o d 20 3^{2} \equiv 9\mod{20}

3 3 7 m o d 20 3^{3} \equiv 7\mod{20}

All remainders are less than 10, which means that he ten's digit of any power of 3 is always even.

It would be much better if you add hyperlink for modular arithmetic .

Naren Bhandari - 2 years, 10 months ago
Ram Mohith
Jul 17, 2018

The last digit of 3 power any positive integer follows a certain order : 3 , 9 , 7 , 1 3, 9, 7, 1

Now, 3 3 = 27 , 3 4 = 81 , 3 5 = 243 , e t c 3^3 = 27, 3^4 = 81, 3^5 = 243, etc . So we come to know that the ten's digit of the first 3 powers of 3 is even.

Use induction on the exponent:

The last digit is either 1, 3, 7 or 9.

If 1 or 3, multiplying a power of 3 will not change the evenness of the second last digit.

If 7 or 9, multiplying will result in a carry over of 2, which again does not change the evenness of the second last digit.

Are you sure what you did was induction?

Shreyansh Mukhopadhyay - 2 years, 10 months ago

Log in to reply

If you assume the tens digit of 3 k 3^k is even, then 3 k + 1 = 3 × 3 k 3^{k+1} = 3\times 3^k and since the last digit of 3 k 3^k is either 1 , 3 , 7 1, 3, 7 or 9 9 and each of these numbers either carries over a 0 0 or a 2 2 when multiplied by 3 3 , then carry over will not change the parity of the tens digit of 3 k + 1 3^{k+1} . By induction, the statement is true

Piero Sarti - 2 years, 10 months ago

'If 1 or 3, multiplying a power of 3 will not change the evenness of the second last digit.' This statement would only work if all powers of 3 have even ten's digit which is what to be proven. So I think that this statemet is irrelevant here.

Shreyansh Mukhopadhyay - 2 years, 10 months ago

Log in to reply

I took first three powers of 3 to assume that the ten's digit of 3 power any integer is even

Ram Mohith - 2 years, 10 months ago

Log in to reply

Yeah, that is good for intuition but it isn't a proof.

Shreyansh Mukhopadhyay - 2 years, 10 months ago
Harsh Shrivastava
Jul 17, 2018

We know that if 3 m m o d 20 n 3^m \mod{20} \equiv n where 0 > n > 10 0>n>10 , then it has an even tens digit because the remainder will not effect the tens digit if it is less than 10, and if it is in mod 20, then any number times 20 has an even tens digit

note that 3 and 20 are relatively prime, so using euler's extention of FLT, (note that ϕ ( 20 ) = 8 \phi(20)=8 ) so 3 8 k + m m o d 20 3 m m o d 20 3^{8k+m} \mod{20} \equiv 3^m \mod{20}

so we only need to go through m=0,1,2,3,4,5,6, and 7, and show that the remainders are all less than 10, then all the other powers are also proven

3 0 m o d 20 1 3^{0} \mod{20} \equiv 1

3 1 m o d 20 3 3^{1} \mod{20} \equiv 3

3 2 m o d 20 9 3^{2} \mod{20} \equiv 9

3 3 m o d 20 7 3^{3} \mod{20} \equiv 7

3 4 m o d 20 1 3^{4} \mod{20} \equiv 1

3 5 m o d 20 3 3^{5} \mod{20} \equiv 3

3 6 m o d 20 9 3^{6} \mod{20} \equiv 9

3 7 m o d 20 7 3^{7} \mod{20} \equiv 7

thus every remainder m o d 20 \mod{20} for a power of 3 n 3^n is 1,3,7, or 9 so the tens digit must be even because any number mod 20 where the remainder is less than 10 will have an even tens digit

@Harsh Shrivastava good solution.

Anand Badgujar - 2 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...