Find last two digits of 1 1 1 1 1 1 . . . .
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 n = 1 1 1 1 1 1 ⋅ ⋅ ⋅ . Then
1 1 1 1 1 1 ⋅ ⋅ ⋅ ≡ 1 1 n (mod 100) = ( 1 0 + 1 ) n (mod 100) = ( 1 0 n + 1 0 n − 1 + ⋯ + 2 1 0 0 n ( n − 1 ) + 1 0 n + 1 ) (mod 100) = ( 0 + 0 + ⋯ + 0 + 1 0 n + 1 ) (mod 100) = 1 0 + 1 ≡ 1 1 (mod 100) Note that n ends with 1.
@Nikola Alfredi , The ∞ at the end is unnecessary. Just end with three dots will do, as in all international math literature (you can check Wikipedia and Wolfram). Ending with ∞ could mean that it tends to infinity. \displaystyle and \mathit are not needed in this case. Numbers and function or operator names are meant to be in regular (non-italic), while variables and constants are in italic.
Ok. I'll keep it mind.
Let x = 1 1 1 1 . . . m o d 1 0 0 . Then since 100 and 11 are relative primes 1 1 1 0 0 = 1 m o d 1 0 0 . That means x = 1 1 x m o d 1 0 0 . The obvious and only value for x is 1 1
As mod is an function or operator a backslash is necessary. You can use either \mod 1 1 1 1 m o d 1 0 0 or \bmod 1 1 1 1 m o d 1 0 0 . Note that mod is not in italic.
Log in to reply
thanks, still got ways to go with latex)
Problem Loading...
Note Loading...
Set Loading...
SOLUTION:
If you observe then, you will find that as 1 1 2 ends with 2 1 , 1 1 9 will end with 9 1 .
Thus 1 1 1 0 ≡ 1 ( m o d 1 0 0 ) ⟶ 1 1 1 1 ≡ 1 1 ( m o d 1 0 0 ) .
Hence 1 1 1 1 1 1 . . . m o d 1 0 0 would reduce to 1 1 1 1 m o d 1 0 0 .
Thus 1 1 1 1 1 1 . . . ≡ 1 1 ( m o d 1 0 0 ) .