⌊ 1 0 3 1 + 3 1 0 9 3 ⌋
Find the last two digits of the number above.
Notation: ⌊ ⋅ ⌋ denotes the floor function .
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.
So, with that in mind:
[ 1 0 3 1 + 3 1 0 9 3 ] = [ 1 0 3 1 1 0 9 3 − 3 1 0 3 1 + 3 1 0 3 1 1 0 9 3 ] = [ 1 0 6 2 − 3 1 0 3 1 + 3 1 0 6 2 ] = [ − 3 1 0 3 1 + 3 1 0 6 2 ] ( m o d 1 0 0 )
This is basically in the same form as the original fraction, so we can do it again:
[ − 3 1 0 3 1 + 3 1 0 6 2 ] = [ − 3 1 0 3 1 1 0 6 2 + 9 1 0 3 1 + 3 1 0 3 1 1 0 6 2 ] = [ − 3 × 1 0 3 1 + 9 1 0 3 1 + 3 1 0 3 1 ] = [ 9 1 0 3 1 + 3 1 0 3 1 ] ( m o d 1 0 0 )
Here we note that 1 0 3 1 + 3 1 0 3 1 is ever so slightly less than 1 , from which 9 1 0 3 1 + 3 1 0 3 1 is ever so slightly less than 9 and thus rounds down to 8 .
Very wonderfull
Problem Loading...
Note Loading...
Set Loading...
Let a = 1 0 3 1 and
N = ⌊ 1 0 3 1 + 3 1 0 9 3 ⌋ = ⌊ a + 3 a 3 ⌋ = ⌊ a + 3 ( a + 3 ) 3 − 9 a 2 − 2 7 a − 2 7 ⌋ = ⌊ a + 3 ( a + 3 ) 3 − 9 ( a + 3 ) 2 + 2 7 ( a + 3 ) − 2 7 ⌋ = ⌊ ( a + 3 ) 2 − 9 ( a + 3 ) + 2 7 − a + 3 2 7 ⌋ = ( a + 3 ) 2 − 9 ( a + 3 ) + 2 6 = a 2 − 3 a + 8
Then N ≡ a 2 − 3 a + 8 ≡ 8 (mod 100) .