76% people will get this right

What are the last two digits of 7 6 76 76^{76} ?


Similar problem: here


The answer is 76.

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.

5 solutions

David Vreken
Apr 16, 2020

From 7 6 1 = 76 76^1 = 76 , 7 6 2 = 5776 76^2 = 5776 , and 7 6 3 = 438976 76^3 = 438976 , it would appear that the last two digits 7 6 n 76^n are 76 76 for any positive integer n n .

This can be proved inductively:

The last two digits of the first case, 7 6 1 = 76 76^1 = 76 , are 76 76 .

Assuming the last two digits of 7 6 n 76^n are 76 76 , then:

7 6 n = 100 x + 76 76^n = 100x + 76 (for some integer x x )

76 ( 7 6 n ) = 76 ( 100 x + 76 ) 76 \cdot (76^n) = 76(100x + 76)

7 6 n + 1 = 76 ( 100 x + 76 ) 76^{n + 1} = 76(100x + 76)

7 6 n + 1 = 7600 x + 5776 76^{n + 1} = 7600x + 5776

7 6 n + 1 = 7600 x + 5700 + 76 76^{n + 1} = 7600x + 5700 + 76

7 6 n + 1 = 100 ( 76 x + 57 ) + 76 76^{n + 1} = 100(76x + 57) + 76

7 6 n + 1 = 100 x + 76 76^{n + 1} = 100x' + 76 (for some integer x = 76 x + 57 x' = 76x + 57 )

the last two digits of 7 6 n + 1 76^{n + 1} are also 76 76 .

Therefore, the last two digits of 7 6 76 76^{76} are 76 \boxed{76} .


Bonus: 76 76 is called an automorphic number .

Thanks for the Bonus part, didn't know about those

Mahdi Raza - 1 year, 1 month ago
Chew-Seong Cheong
Apr 16, 2020

Let's prove that 76 76 is an automorphic number as mentioned by @David Vreken, that is 7 6 n 76 (mod 100) 76^n \equiv 76 \text{ (mod 100)} for natural number n n , using Chinese remainder theorem .

Note that 7 6 n 0 (mod 4) 76^n \equiv 0 \text{ (mod 4)} and 7 6 n ( 75 + 1 ) n 1 n 1 (mod 25) 76^n \equiv (75+1)^n \equiv 1^n \equiv 1 \text{ (mod 25)} . Therefore 7 6 n 25 k + 1 76^n \equiv 25k + 1 , where k k is an integer. Then 25 k + 1 0 (mod 4) k 3 25k+1 \equiv 0 \text{ (mod 4)} \implies k \equiv 3 and 7 6 n 76 (mod 100) 76^n \equiv \boxed{76} \text{ (mod 100)} .

Great solution!

Mahdi Raza - 1 year, 1 month ago

Log in to reply

Glad that you like it.

Chew-Seong Cheong - 1 year, 1 month ago
Elijah L
Apr 16, 2020

Notice that 76 24 ( m o d 100 ) 76 \equiv -24 \pmod{100} . Then:

7 6 76 ( 24 ) 76 ( m o d 100 ) 76^{76} \equiv (-24)^{76}\pmod{100}

But notice that 2 4 2 = 576 24^2 = 576 , which is congruent to 76 ( m o d 100 ) 76 \pmod{100} .

Extending this logic, we find that 7 6 76 76 ( m o d 100 ) 76^{76} \equiv \boxed{76} \pmod{100} .

Nice use of congruence!

Mahdi Raza - 1 year, 1 month ago

Log in to reply

@Mahdi Raza answer is 76 and 76% people got this right!

Zakir Husain - 1 year ago

Log in to reply

Just waiting for 76 solvers for a hattrick, lol

Mahdi Raza - 1 year ago

I changed the title to "76% people will get this right"

Mahdi Raza - 1 year ago
Mahdi Raza
Apr 16, 2020
  • Either by observation on putting small values of k k in 7 6 k 76^k
  • or by knowing the fact,

7 6 k 76^k always ends with the ending two digits as 76 7 6 76 76 \quad \implies\therefore 76^{76} ends with 76 76

The number 76 76 is automorphic , hence the last two digits of 7 6 76 76^{76} would be 76 \boxed{{\color{#D61F06} 76}} .

At the time I solved this problem, the percentage of correct answers was 76!

Log in to reply

"Just waiting for 76 solvers for a hattrick, lol"

Mahdi Raza - 1 year ago

I changed the title to "76% people will get this right"

Mahdi Raza - 1 year ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...