Determine the last digit of $5^5+6^6+7^7+8^8+9^9$.
Problem
Source:
Tags: last digits, number theory, modulo
19.09.2020 02:40
19.09.2020 02:41
19.09.2020 02:43
edited because im dumb
19.09.2020 02:45
Socoobo wrote: Take everything mod 10.
Please hid your sols.
19.09.2020 03:06
This is not a tricky problem but requires a little time. I think you could figure it out with some effort, but here's the solution anyway lol. XD
I worked hard on this so pls give me credit.
19.09.2020 03:07
littlepetwolf wrote: This is not a tricky problem but requires a little time. I think you could figure it out with some effort, but here's the solution anyway lol. XD
I worked hard on this so pls give me credit. But it was wrong
19.09.2020 03:08
oh. I'm so sorry. I tried my best.
19.09.2020 03:09
littlepetwolf wrote: oh. I'm so sorry. I tried my best. I would review the 9 part. But good job!
19.09.2020 03:10
yeah I saw, that was silly of me. sorry! It's fixed!
19.09.2020 03:12
littlepetwolf wrote: yeah I saw, that was silly of me. sorry! It's fixed! Good job! Keep doing this and you will have a bright future!
19.09.2020 04:20
Keith50 wrote: Determine the last digit of $5^5+6^6+7^7+8^8+9^9$. It only involve the basic concept of cyclcity of of the unit digit
19.09.2020 04:32
def cooljupiter(n): return n ** n result = 0for k in range(5, 10): result += cooljupiter(k)print(result % 10)def cooljupiter(n): return n ** n result = 0 for k in range(5, 10): result += cooljupiter(k) print(result % 10)RunResetPop Out /
19.09.2020 05:15
This should be moved to MSM.
19.09.2020 16:33
jasperE3 wrote: This should be moved to MSM.
Nice Bash, but there are better ways...
19.09.2020 16:40
CoolJupiter wrote: def cooljupiter(n): return n ** n result = 0for k in range(5, 10): result += cooljupiter(k)print(result % 10)def cooljupiter(n): return n ** n result = 0 for k in range(5, 10): result += cooljupiter(k) print(result % 10)RunResetPop Out / This method is definitely applicable to similar problems in math contests.
19.09.2020 17:45
juliankuang wrote: CoolJupiter wrote: def cooljupiter(n): return n ** n result = 0for k in range(5, 10): result += cooljupiter(k)print(result % 10)def cooljupiter(n): return n ** n result = 0 for k in range(5, 10): result += cooljupiter(k) print(result % 10)RunResetPop Out / This method is definitely applicable to similar problems in math contests. Yeah, like Purple Comet
19.09.2020 20:48
20.09.2020 13:12
$5^5+6^6+7^7+8^8+9^9\equiv 1+0+1+0+1\equiv 1\pmod{2}$ By Fermat's little, $a^4\equiv 1\pmod{5}$ when $(a,5)=1$ $5^5+6^6+7^7+8^8+9^9\equiv 0+1^2+2^3+1+(-1)^1\equiv 4\pmod{5}$ By CRT, $5^5+6^6+7^7+8^8+9^9\equiv 5\times 1 -4\times 4\equiv 9\pmod{10}$
21.09.2020 01:04
littlepetwolf wrote: This is not a tricky problem but requires a little time. I think you could figure it out with some effort, but here's the solution anyway lol. XD
I worked hard on this so pls give me credit. This i how I solved it.
21.09.2020 02:37
You could use modular arithmetic to determine the value of each power $\pmod {10}$