Find the remainder when the expression below
9 × 9 9 × 9 9 9 × … × 9 9 9 9 ′ s 9 9 9 9 9 9 … 9
is divided by 1000.
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.
Haha! The same way +1
i don't understand why you wrote 1000-1 as -1.......which concept of simple modulo arithmetic
Log in to reply
can you elaborate where you require help?
Log in to reply
in the third step where you write (-1)........upto 997 times .why you write 1000-1 like only-1
Log in to reply
@Mycobacterium Tuberculae – ok... by modulo arithmetic we know a + b ( m o d c ) ≡ ( a ( m o d c ) + b ( m o d c ) ) ( m o d c ) using this 1 0 0 0 + ( − 1 ) ( m o d 1 0 0 0 ) ≡ 1 0 0 0 ( m o d 1 0 0 0 ) + ( − 1 ) ( m o d 1 0 0 0 ) ≡ 0 − 1 ( m o d 1 0 0 0 )
Problem Loading...
Note Loading...
Set Loading...
write it as ( 1 0 1 − 1 ) ( 1 0 2 − 1 ) ( 1 0 3 − 1 ) ( 1 0 4 − 1 ) . . . ( 1 0 9 9 9 − 1 ) using simple modulo arithmetic this is congruent to ( 1 0 − 1 ) ( 1 0 0 − 1 ) 9 9 7 t i m e s ( − 1 ) ( − 1 ) ( − 1 ) ( − 1 ) . . . . ( − 1 ) ( − 1 ) ≡ − 8 9 1 ≡ 1 0 9 ( m o d 1 0 0 0 )