Over all sets of natural numbers ( k 1 , k 2 , k 3 , . . . . , k 1 0 0 ) , how many possible values are there of
⎝ ⎛ i = 1 ∏ 1 0 0 k i ⎠ ⎞ ( ∑ i = 1 1 0 0 k i ) ( m o d k 1 0 0 )
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.
yeah! Same
Log in to reply
Then why this problem is not getting the rating !!??
same isnt it overrated
Log in to reply
solving the problem should be ur aim not discussin the ratings
Problem Loading...
Note Loading...
Set Loading...
It is as simple as ,
( a b ) a + b ≡ 0 ( m o d a )