Consider a number 3 n , where n is a positive integer.
If
n
=
2
0
1
6
, the last digit of
3
n
is
a
.
If
n
=
9
0
1
8
, the last digit of
3
n
is
b
.
What is a + b ?
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.
Simple standard approach once you know that the last digits always repeat (and just have to find the length of the period).
I accidentally stopped after I did 2016 mod 4 and 9018 mod 4! When I got 0 and 2, I accidentally forgot to go back and check which last digits those represented and blindingly just hit the option of '2'... I feel so silly!
I did in the same way
We know 3 2 ≡ − 1 ( m o d 1 0 ) , thus 3 2 0 1 6 ≡ ( 3 2 ) 1 0 0 8 ≡ 1
Similarly, 3 9 0 1 8 ≡ ( 3 2 ) 4 0 0 9 ≡ − 1 ≡ 9
Thus, a = 1 and b = 9 , hence a + b = 1 + 9 = 1 0 .
ϕ
(
1
0
)
=
4
where
ϕ
(
n
)
is the Euler-Phi function.
According to Euler's theorem,
a
ϕ
(
n
)
≡
(
m
o
d
n
)
,
g
c
d
(
a
,
n
)
=
1
∴
3
4
≡
1
(
m
o
d
1
0
)
3
2
0
1
6
≡
(
3
4
)
5
0
4
≡
1
(
m
o
d
1
0
)
∴
a
=
1
3
9
0
1
8
≡
3
2
⋅
3
9
0
1
6
≡
9
⋅
(
3
4
)
2
2
5
4
≡
9
⋅
1
≡
9
(
m
o
d
1
0
)
∴
b
=
9
∴
a
+
b
=
1
0
.
Note : What I actually did was calculated the remainder when the number was divided by 10, which is actually the last digit.
3 2 0 1 6 → 2 0 1 6 ≡ 0 ( m o d 4 )
3 9 0 1 8 ⇒ 9 0 1 8 ≡ 2 ( m o d 4 )
So, 3 n is repeating by the pattern of last digits, 3, 9, 7, and 1, so the answer will be a = 1 , b = 9 , ∴ a + b = 1 + 9 = 1 0
Problem Loading...
Note Loading...
Set Loading...
Observe that the last digit of the power of 3 repeat in the cycle 3 , 9 , 7 , 1 ⋯ . So, the last digit of 3 2 0 1 6 will be the 2 0 1 6 t h digit in the given sequence. As 2 0 1 6 when divided by 4 leaves ni remainder, 1 .
When 9 0 1 8 t h is divided by 4 it leaves 2 as remainder, so, b = 9 .
So, a + b = 1 + 9 = 1 0 .