Power of 3

3 3 = 2 7 3 4 = 8 1 3 5 = 2 4 3 3 6 = 7 2 9 3 7 = 21 8 7 3 8 = 65 6 1 \begin{array} { r c r } 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\\ 3^7 &=& 21{\color{#D61F06}{8}}7 \\ 3^8 &=& 65{\color{#D61F06}{6}}1 \end{array}

The above shows the first few powers of 3, starting from 3 3 3^3 . Is it true that the second last digit (from the right) of 3 n 3^n for integers n ( > 2 ) n\,(> 2) is always an even number?

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.

11 solutions

Zach Abueg
Aug 22, 2017

Relevant wiki: Modular Arithmetic - Problem Solving - Basic

We will prove by induction that the tens digit of 3 n 3^n is always even.

3 0 1 m o d 20 3^0 \equiv 1 \bmod \ 20

and

3 n m o d 20 { 1 , 3 , 9 , 7 } 3 n + 1 m o d 20 { 3 , 9 , 7 , 1 } \begin{aligned} & 3^n \bmod 20 \in \{1, 3, 9, 7\} \\ \implies & 3^{n + 1} \bmod 20 \in \{3, 9, 7, 1\} \end{aligned}

Thus, the tens digit modulo 2 2 is always even.

Moderator note:

To clarify, as long as there is a tens digit, taking a number modulo 20 is sufficient to determine if the tens digit is odd or even. Note this pattern:

27 m o d 20 7 37 m o d 20 17 47 m o d 20 7 57 m o d 20 17 67 m o d 20 7 \begin{aligned} 27 \bmod 20 &\equiv 7 \\ 37 \bmod 20 &\equiv 17 \\ 47 \bmod 20 &\equiv 7 \\ 57 \bmod 20 &\equiv 17 \\ 67 \bmod 20 &\equiv 7 \end{aligned}

and this one:

67 m o d 20 7 68 m o d 20 8 69 m o d 20 9 70 m o d 20 10 71 m o d 20 11 79 m o d 20 19 80 m o d 20 0 \begin{aligned} 67 \bmod 20 &\equiv 7 \\ 68 \bmod 20 &\equiv 8 \\ 69 \bmod 20 &\equiv 9 \\ 70 \bmod 20 &\equiv 10 \\ 71 \bmod 20 &\equiv 11 \\ \ldots \\ 79 \bmod 20 &\equiv 19 \\ 80 \bmod 20 &\equiv 0 \\ \end{aligned}

In general (as long as there is a tens digit) when the value modulo 20 is between 10 and 19, the tens digit is odd.

I used a bit of your solution for mine hope you don't bother and if you do i will delete mine to be fair.

Liviu Vigu-Giurea - 3 years, 9 months ago

Log in to reply

No worries. Thanks for letting me know!

Zach Abueg - 3 years, 9 months ago

Not clear. How this observation that the unit digit of 3^n mod 10 for all integer n > 2 is always in {1, 3, 9, 7} can tell you anything about the tens digits of powers of 3?!!

Abdulelah Al Jeffery - 3 years, 9 months ago

Log in to reply

I added a note that should help clarify the situation. It's mod 20, not mod 10.

Jason Dyer Staff - 3 years, 9 months ago

I follow the idea, but if I were formulating this proof, I would be hesitant in declaring that 3 n mod 20 { 1 , 3 , 9 , 7 } 3^n \text{mod} 20 \in \{1,3,9,7\} . Doesn't that presuppose that you know the tens digits of 3^n are even? Any advice in seeing past this?

S S - 3 years, 9 months ago

Log in to reply

This is induction - we've already got a base case from the pre-existing examples given in the problem. Thus we just need to prove that if we have 3^n then 3^{n+1}.

Jason Dyer Staff - 3 years, 9 months ago

Log in to reply

Ah, right. Thanks. It's been a while.

S S - 3 years, 9 months ago

I multiplied the odd digits by 3. Always got a 0 or 2 in ten place and added to the previously even result never gave odd.

Jeannine Myer - 3 years, 9 months ago

3^20= 3486784399 Nice try !

Rick Hilliard - 3 years, 9 months ago

Log in to reply

Please check your calculations. 3 20 3^{20} is equal to 3486784401 3486784401 and zero is even. A quick divisibility test shows that your number is not divisible by 3, so something's wrong.

This is a large number, so your calculator could be making some approximations to calculate it and as a result it gives a wrong answer. Using Wolfram Alpha gives a more accurate result.

Pranshu Gaba - 3 years, 9 months ago

Log in to reply

Thank you, Pranshu.

Zach Abueg - 3 years, 9 months ago
Bryan Hung
Sep 4, 2017

Relevant wiki: Induction - Introduction

Assume that there exists a power of 3 whose tens digits is odd. Let the first such power of 3 be 3 n 3^n . Then 3 n 1 3^{n-1} has an even tens digit. Consequently, multiplying this by 3 can only bring the tens digit to an odd number if the ones digit * 3 carries a 1 to the tens place. Thus the ones digit would have to be 4, 5, or 6. But the ones digit can only be 1, 3, 7, or 9, contradiction.

So basically my prof one line shorter and no induction.

Liviu Vigu-Giurea - 3 years, 9 months ago

Log in to reply

The induction here is actually implicit.

Agnishom Chattopadhyay - 3 years, 8 months ago

Elegant and simple.

A Former Brilliant Member - 3 years, 9 months ago

Relevant wiki: Induction - Introduction

We use induction 3^n has that property and the first steps are already above so if it is true for every number 3^k until 3^n (k, n integer): first we know that every power of 3 ends with one of those: 1,3,7,9 and we know that 3*2s is still divisible by 2 then the only problem for the 2nd digit evenness is the redemander of the first multiplication and that one is based on the numbers above 0,2 witch both are divisible by 2, witch means if 3^n has the proprety then 3^(n+1) has it too. Q.E.D.

"the only problem for the 2nd digit evenness is the redemander of the first multiplication" Could you explain more?

Abdulelah Al Jeffery - 3 years, 9 months ago

Log in to reply

"the only problem" = (in this context) the only thing missing to prove the conclusion, what was the "problem" the conclusion says there is a repetition pattern of the tens digits in powers of 3 and we already know that there is one for the units digits (the 1,3,9,7 cycle) so that pattern should be related with the implied pattern in the concussion (fair enough it may be implied that this is more based on intuition then pure logic), in the end we have proven that those 2 are 2 related factors so if the first is true then the other must be (and as i said above it is banal to prove the first one, or so i thought).

Liviu Vigu-Giurea - 3 years, 9 months ago

Ok I feel stupid for asking this, but what's the proof that every power of three cycles through 1,3,9,7 ? Inuitively it makes sense and it's easy to demonstrate on a calculator.. but how would you prove it formally and wouldn't that proof need to feed into any subsequent proof for the evenness of the tens unit ?

John Martin - 3 years, 9 months ago

Log in to reply

I would just observe that only the ones digit is needed to determine the next ones digit in "the cycle". e.g. If we have a number that ends in 7, then we can write it as 10 n + 7 10n+7 , and after we multiply by 3 we get 30 n + 21 30n+21 . Clearly, n still has no influence on the ones digit. So only the ones digit really matters, so we have a convenient "cycle".

If you seek a more formal proof to impress people, I would use modular arithmetic and ( m o d 10 ) \pmod{10} .

Bryan Hung - 3 years, 9 months ago

It can be proven by induction we know that it works for low examples so we can say that it works until the n-th number witch either has a 1 or 3 or 9 or 7 at the end, so we can multiply all of them by 3 witch is: ...1 * 3=...3, 3 * ...3=...9; ...9 * 3=...7; ...7 * 3=...1. If in lower steps for induction (the first powers of 3 in this case) you make the next term from the last term with some operations that are banal, you shouldn't need induction to prove this, but i guess it wasn't that banal after all.

Liviu Vigu-Giurea - 3 years, 9 months ago

Thanks, clever. By 'redemander' do you mean 'remainder' or is it a term of art?

Donald Zacherl - 3 years, 9 months ago

Log in to reply

Haha, I think that was a typo

Agnishom Chattopadhyay - 3 years, 8 months ago
Tristan Chaang
Sep 4, 2017

We use the fact that 3 4 1 ( m o d 20 ) 3^4 \equiv 1 \pmod{20} .

(1) For every n = 4 k n=4k ,

3 4 k 1 ( m o d 20 ) 3^{4k}\equiv 1 \pmod{20}

(2) For every n = 4 k + 1 n=4k+1 ,

3 4 k + 1 3 ( m o d 20 ) 3^{4k+1}\equiv 3 \pmod{20}

(3) For every n = 4 k + 2 n=4k+2 ,

3 4 k + 2 9 ( m o d 20 ) 3^{4k+2}\equiv 9 \pmod{20}

(4) For every n = 4 k + 3 n=4k+3 ,

3 4 k + 3 27 7 ( m o d 20 ) 3^{4k+3}\equiv 27\equiv 7\pmod{20}

Therefore for all n n , the tens digit of 3 n 3^n is even.

Yep, the trick is to consider the residues modulo 20

Agnishom Chattopadhyay - 3 years, 9 months ago
Paul English
Sep 9, 2017

The one's digit of 3 n 3^n is only odd, 1,3,7,9. For values of 3 n 3^n ending in 1 or 3 there is no carry over to the 10's and for values of 3 n 3^n ending in 7 or 9 there only carry over to the 10's is 2. Starting with 3 2 3^2 the result is 27, the 10's digit being even, causing all successive multiples be and odd number, 3, times an even number resulting in only even numbers for the 10's place,

the powers of 3 that have been given always have an even 10s unit. Multiplying the 10s therefore, by whatever number will always make it even. you can see that the units cycle through 1, 3, 9, and 27. None of these affect the 10s except the 27 which will add 2, therefore not affecting if it is odd or even. I hope this wasn't confusing

Yes, this indeed works.

Agnishom Chattopadhyay - 3 years, 9 months ago

just tweaking your argument a little: 3•9 results in 27 and 3•7 results in 21, both of which carry 2 into the tens place.

... the ones digit of 3 n 3^n cycles thru {3, 9, 7, 1}. As you know, the first few terms of this series are 3, 9, 27 and 81. These numbers may be modeled as 10•k + i, where i is one of {3, 9, 7, 1} and k is appropriately one of {0, 2 , 8}. 3 times the ones digit will result in one of {9, 27, 21, 3} and 3 times the tens digit will always result in an even number since 3*(even) is always even.

For exponents 1, 5, 9, 13, ... (i.e. the ones digit is 3), multiplying by 3 results in a ones digit of 9 and no carry into the tens, so the tens digit remains even.

For exponents 2, 6, 10, 14, ... (i.e. the ones digit is 9), multiplying by 3 results in a ones digit of 7 and carry of 2 into the tens digit, so the tens digit remains even.

For exponents 3, 7, 11, 15, ... (i.e. the ones digit is 7), multiplying by 3 results in a ones digit of 1 and carry of 2 into the tens digit, so the tens digit remains even.

For exponents 4, 8, 12, 16, ... (i.e. the ones digit is 1), multiplying by 3 results in a ones digit of 3 and no carry into the tens, so the tens digit remains even.

In every case, the tens digit remains even after multiplying 3 n 3^n by 3.

David Hairston - 3 years, 9 months ago
Ananya Aaniya
Sep 8, 2017

the last digit of 3's powers are: 1, 3, 7, 9

step1:- the carry, when these digits are multiplied by 3, is: 0, 2

step2:- when these carries are multiplied by 3 and the carry from step1 is added: always even.

There are two patterns we could notes: the first right number belongs to { 7 , 1 , 3 , 9 } \{7, 1, 3, 9\} and the second right number is always in the form 2 × n 2\times n ord 2 × n + 2 2\times n+2 with n n a positive integer, because moltiplicating each unit numbers { 7 , 1 , 3 , 9 } \{7, 1, 3, 9\} by 3 we have respectively the set { 21 , 3 , 9 , 27 } \{21, 3, 9, 27\} . Why? Because we have two cases: we should add nothing to the even decim number (wich is in the form 3 × 2 × n 3\times 2\times n ) or add 2 2 to it: in both the situations the second last digit remains even.

Mulayka Enriello
Sep 8, 2017

each power of 3 is obtained by the preceeding one multiplying by 3. The second digit of the third power (27) is even (2), while the first digit of any power of 3 ends in 1 - 3 - 9 or 7 When multiplying by 3, the first digit either doesn't give any charge (1 and 3) or gives 2 as a charge (9 or 7), while the second digit starting as a 2 on the third power and thus starting as an even digit, when multiplying by 3 gives in any case an even either because "even by 3" (first digit 1 - 3: no charge) or because "even by 3 plus 2" (first digit 7 - 9 : charge 2 to the second digit) [Sorry for the bad English]

Isn't 0 an even number, and 3^15=14,348,907 so the answer should be no

al amine zian - 3 years, 9 months ago
Leander Elfrink
Sep 7, 2017

3 x 6561 = 19683 8. 4 x 6561 = 26244 4. Keep doing the maths and itll add up to be an even number 100% of the time.

And that's why we have induction.

Liviu Vigu-Giurea - 3 years, 9 months ago
Jeremy Ho
Sep 6, 2017

Note the units digit cycles through 7 , 1 , 3 , 9 7, 1, 3, 9 and repeats (powers of 3 ( m o d 10 ) 3\pmod {10} ). Then notice that the carry into the 10 10 's column is always either 0 0 or 2 2 and therefore always even. Finally, the 10 10 's column starts with 2 2 . To get to the 10 10 's column of the next number, multiply by 3 3 and add the carry. ODD × EVEN + EVEN = EVEN \text{ODD}\times\text{EVEN}+\text{EVEN}=\text{EVEN} . By induction it'll always be even for n > 2 n>2 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...