Find the last 2 digits of the number 5 6 0 3 1 2 4 3 .
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.
What is the λ function you used?
Lambda of 100 is 10 not 20
Log in to reply
No, λ ( 1 0 0 ) = 2 0 . Here we can use ϕ ( 1 0 0 ) = 4 0 as well, for those who are not familiar with the Carmichael lambda.
Log in to reply
Yes, I dis a mistake sorry. Anyway sometimes the o r d m ( a ) is something less than phi or lambda. How could we compute this?
Yes, I know phi 100 and not lambda 100 yet can you explain what is Carmichael lambda...please
5 6 0 3 1 2 4 3 ≡ ( 5 6 0 0 + 3 ) 1 2 4 3 (mod 100) Since 5 6 0 0 ≡ 0 (mod 100) ≡ 3 1 2 4 3 (mod 1 0 0 ) As 3 and 100 are coprimes, we can use Euler totient theorem. ≡ 3 1 2 4 3 mod ϕ ( 1 0 0 ) (mod 100) where ϕ ( ⋅ ) is the totient function. ≡ 3 1 2 4 3 mod 4 0 (mod 100) ≡ 3 3 (mod 100) ≡ 2 7 (mod 100)
The last 2 digits are 03, 3 4 k has unit digit as 1, thus 3 1 2 4 3 would have it as 7. Since its followed by a zero, I figured the last 2 digits would just be 0 3 3 = 2 7 .
P.S- Please let me know if this method is right or wrong.
To simplify, I will first find the value of x in the following:
5 6 0 3 x ≡ 1 ( m o d 1 0 0 )
Using Euler's totient theorem:
Since gcd (100, 5603) = 1, x = ϕ ( 1 0 0 ) = 1 0 0 ( 1 − 2 1 ) ( 1 − 5 1 ) = 4 0
Then using basic modulo arithmetic we can find the answer:
5 6 0 3 4 0 ≡ 1 ( m o d 1 0 0 ) ∴ 5 6 0 3 1 2 4 0 ≡ 1 ( m o d 1 0 0 ) . . . . . . . . . . . . . . . . . Multiply both sides by 3 1 5 6 0 3 1 2 4 0 × 5 6 0 3 3 ≡ 1 × 3 3 ( m o d 1 0 0 ) . . . . . . . . . . . . . . . . . Note that 5 6 0 3 ≡ 3 ( m o d 1 0 0 ) ⟹ 5 6 0 3 1 2 3 ≡ 2 7 ( m o d 1 0 0 ) . . . . . . . . . . . . . . . . . So 27 is the answer
Problem Loading...
Note Loading...
Set Loading...
5 6 0 3 1 2 4 3 ≡ 3 1 2 4 3 ( m o d 1 0 0 ) 3 λ ( 1 0 0 ) = 3 2 0 ≡ 1 ( m o d 1 0 0 ) ⟹ 1 2 4 3 ( m o d 2 0 ) 1 2 4 3 ≡ 3 ( m o d 2 0 ) ⟹ 5 6 0 3 1 2 4 3 ≡ 3 1 2 4 3 ≡ 3 3 ≡ 2 7 ( m o d 1 0 0 )