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.
Let 1 9 3 9 = x ( m o d 1 0 0 ) where 0 ≤ x ≤ 1 0 0 and g cd ( 1 9 , 1 0 0 ) = 1 implies we can say 1 9 ϕ ( 1 0 0 ) = 1 ( m o d 1 0 0 ) ) and ϕ ( 1 0 0 ) = 4 0 .
So we need to solve 1 9 x = 1 ( m o d 1 0 0 ) which means we have to find the modular inverse of 1 9 with respect to 1 0 0 .
The restriction on the range in which x lies, as well as the fact that it should end with 9 , (an odd power of a number ending with 9 always ends in 9 , so x must end with 9 ), so we need to check the numbers { 1 9 , 2 9 , 3 9 , 4 9 , 5 9 , 6 9 , 7 9 , 8 9 , 9 9 } and we will see that only x = 7 9 satisfies the condition 1 9 x = 1 ( m o d 1 0 0 ) , so 7 9 is our required answer.
Another method is to write it as ( 2 0 − 1 ) 3 9 ≡ − 1 + ( 3 8 3 9 ) ⋅ 2 0 − 1 0 0 ( ⋯ ) ≡ 7 9 .
That is, expand the expression ( a + b ) 3 9 .
Problem Loading...
Note Loading...
Set Loading...
We can use the binomial theorem to find the last two digits of 1 9 3 9 . Writing 1 9 as ( 2 0 − 1 ) :
( 2 0 − 1 ) 3 9 = ( 0 3 9 ) ( − 1 ) 3 9 + ( 1 3 9 ) ( − 1 ) 3 8 × 2 0 + ( 2 3 9 ) ( − 1 ) 3 7 × 4 0 0 + ⋯
Note that from third term onwards, all of them are divisible by 100 and do not affect the last two digits of 1 9 3 9 .
( 2 0 − 1 ) 3 9 ≡ − 1 + 3 9 × 2 0 ( m o d 1 0 0 ) ≡ 1 + 7 8 0 ≡ 7 9
Hence, the last two digits of 1 9 3 9 are 7 9 . □