300 Followers Problem.

Algebra Level 4

Over all sets of natural numbers ( k 1 , k 2 , k 3 , . . . . , k 100 ) (k_1 , k_2 , k_3,...., k_{100}) , how many possible values are there of

( i = 1 100 k i ) ( i = 1 100 k i ) ( m o d k 100 ) \large\left(\prod_{i=1}^{100}k_{i}\right)^{\left ( \sum_{i=1}^{100}k_{i} \right )} \pmod{ k_{100} }

This problem is original.


The answer is 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.

1 solution

It is as simple as ,

( a b ) a + b 0 (ab)^{a+b} \equiv 0 ( m o d mod a a )

yeah! Same

Dev Sharma - 5 years, 6 months ago

Log in to reply

Then why this problem is not getting the rating !!??

A Former Brilliant Member - 5 years, 6 months ago

same isnt it overrated

Kaustubh Miglani - 5 years, 5 months ago

Log in to reply

solving the problem should be ur aim not discussin the ratings

A Former Brilliant Member - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...