What is the Last Digit of 7 to the Power of 123?

  • Thread starter Thread starter sutupidmath
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around finding the last digit of \(7^{123}\) and the last three digits of \(7^{9999}\), focusing on modular arithmetic and properties of powers in number theory.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants explore modular arithmetic, specifically using \(7^{123} \mod 10\) and \(7^{9999} \mod 1000\). They discuss the use of Euler's theorem and the Euler totient function to find periodicity in powers of 7.

Discussion Status

Some participants have provided insights into the calculations and reasoning behind their approaches, while others express uncertainty about the methods and seek clarification on the application of the Euler function.

Contextual Notes

There is mention of the need to find the order of \(V_{1000}\) and the implications of working with coprime numbers in modular arithmetic. Participants are also navigating the complexity of the calculations involved.

sutupidmath
Messages
1,629
Reaction score
4

Homework Statement


Find the last digit of [tex]7^{123}[/tex]


Homework Equations





The Attempt at a Solution



[tex]7^{123} \equiv x(mod 10)[/tex]

123=12*10+3 Now, since in Z_10

[tex]7^{120 }\equiv 1 (mod 10)=> 7^{123} \equiv 7^3=343 mod 10=>343(mod 10)=3[/tex]

SO would the last digit be 3?

 
Physics news on Phys.org
Also, how would one find the last 3 digits of [tex]7^{9999}[/tex]

I know i have to work mod 1000, but i haven't been able to pull out anything so far.
 
You used 7^4=1 mod 10 to do the first one, right? You want to do the second one the same way. Find a large k such that 7^k=1 mod 1000. Use Euler's theorem and the Euler totient function to find such a k. Once you've done that you may find it useful to know that 7 has a multiplicative inverse mod 1000 (since 7 and 1000 are coprime). Factor 1001.
 
So,since we are working mod 1000, i will have to find the order of [tex]V_{1000}=\phi(1000)[/tex] so i know for sure that [tex]7^{\phi(1000)}\equiv 1(mod1000)[/tex]

NOw [tex]\phi(1000)=\phi(2^3)\phi(5^3)=400=>7^{400}\equiv 1(mod 1000)[/tex]

Now also

[tex](7^{1000})^{25}\equiv 1(mod 1000)=>7^{10000}=1+k1000=1001+(k-1)1000[/tex]

Now from here i guess, not sure though, we have

[tex]7|(k-1)[/tex]

Now above if we divide both parts by 7 we would get:

[tex]7^{9999}=143+\frac{k-1}{7}1000[/tex]

So


[tex]7^{9999}\equiv 143(mod1000)[/tex] so the last 3 digits are 143 ??

I thought there might be some more easy way...lol...
 
That works. I would have just said since 7^400=1 mod 1000, then 7^10000=1 mod 1000. So if you let x=7^9999. Then you want to solve 7*x=1 mod 1000. Since 7 and 1000 are relatively prime, you can do that. And knowing 1001=7*143 give you a cheap way. x=143.
 
This euler function seems to be very powerful, and i am far behind from being able to properly and easily use it...darn..
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
2K
Replies
6
Views
2K