Ball and drawer principle (aka modified pigeonhole)

Level pending

Consider a drawer full of balls of two colour - Black and White. Alice randomly selects one ball and takes it out. Then the same way she randomly selects another ball.

Given that the number n n of black balls satisfies the condition that the probability that the two balls Alice chose are White is 1 2 \frac{1}{2} , and such that n n is a 7 7 -digit number, find n ( m o d 1000 ) n \pmod {1000} .


The answer is 105.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...