First problem
100 thinking robots are given a challenge : they will communicate only by means of a single light bulb which can be either in the state 1 (light on) or in state 0 (light off). Each second a randomly chosen
\[\bf ONE \quad single \]
robot can see the bulb (others don't- in that second) and keep it in the previous state or change it to opposite state. Bulb is On at first.
Each second one chosen randomly out of 100.
The challenge is to know -WHEN every one of them has been at the bulb at least once (or more) times.
This info has to reach all of 100 eventually.
SEE THE SOLUTION BELOW

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.