A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 3 years ago
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
anonymous
 3 years ago
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

This Question is Closed

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Sounds like a statistics problem. To me there will always be a chance the same robot doesn't see the bulb, but it will be so small it's considered 0. We have to decide how small is too small. I really can't help any further then relaying my thoughts. sry

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0you could set up a limit as x approaches 0 for the last robot. But i don't know how to do that for this problem

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Consider it given that there does occur a visit of each to the bulb. THIS IS NOT THE QUESTION !! The question is to communicate that event AFTER IT HAPPENNED JUST USING THE BULB !

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0oh ok. I did read it wrong. Is this a question you need an answer to, or a question for fun to the community? I would have to think about this for a while. still not much help

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0For intellectual profit of the community (not fun, god forbid that !)

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Hi there @experimentX

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0so you know the answer. Now I'm more interested in this puzzle

experimentX
 3 years ago
Best ResponseYou've already chosen the best response.0Yo @Mikael what's up!! ... serves as bookmark.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0There is a follow up problem  which HAS practical serious applications and is very deep

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0what if the first robot turns the bulb off and every robot you sees the bulb and it is their first time will turn it on. If it is their second time will turn it off. If the bulb is left off for a long time then we can assume every bot has seen it. I don't know how to determine the length of time

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Glad to see you \[ YodaNot , \bf @ganeshie8 \]

ganeshie8
 3 years ago
Best ResponseYou've already chosen the best response.0:) so the state has to be communicated to all the 100 robots, but the bulb has only two states hmm

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0The offered method has weakness  a robot doesn't know whether it was a multiple visit by some group that made the light off (if that is his observation) or the complete set of visits.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Ok let's make it simpler:

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0How each robot can be sure with probability of \[p= 1 10^{6}\] that all others HAVE visited the bulb  devise a method for that.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0@Algebraic! you are missed here , one needs some critical approach...

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Each robot has also a secondscounting watch

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Well let's say @ChmE is "warm" in his attempt...

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I'm still thinking I see the problem you mentioned

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Just devise an approach with lower possibility of that

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0can a robot leave a bolt. so the first time they visit they leave a bolt and there is a robot that collects all the bolts when he has 100 including his own they are done

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0and my first method will be complete in 100^101/100! years. lol

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Great beginning of BRAIN STORMING , NOW that you have "I wish" method  try making "the bolt" only with the ligh on/Off and the conditions given

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I mean  the bulb , in some sense is a thirdrate "bolt"

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0the first turns it off. and he counts how many times he see it on. The other robots turn it on one of their 2 cycles.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0OK  push forward on the path of SIMPLIFYING !!!

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0"the first turns it off"....

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0and ignore (for a sec) the actual numbers of seconds

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I will continue to think about it. Gotta catch a bus

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0So gentlemen and ladies  who's up to the challenge ?!

KingGeorge
 3 years ago
Best ResponseYou've already chosen the best response.0I'm going to stay quiet for a while since I've seen the problem before (in slightly different terms).

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0\[\bf \text{here is Second Problem  will be posted after this one is done and cleared.}\] \[\bf \color{red}{\text {Now the robots have to somehow}\,\,\\ {\Huge\color{green}{Choose \quad a \quad president}}\\{\text{EXACTLY IN THE SAME SITUATION }} }\]

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0No tricks  real new democratic choice of president.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0the 1st robot turns it off and he only ever turns it off. Every other robot turns the light only once. If they have already turned it on they leave it off or if it is on they leave it on. The 1st robot counts how many times he turns it off til 99

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0if the robots see the light on but havent touched it then they leave it on til they are given the chance to turn it on

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0All right  so here is The second problem. \[ \bf \text{Choosing a specific number by majority of votes.} \\ \text{ Each robot has has own number known to all.}\\ \text{ Using all of the above they have to choose one pf them.}\\ \text{He will be called the president.} \]

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Check my soln to problem 1. I think I've got it

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0@ChmE This seems the solution "the 1st robot turns it off and he only ever turns it off. Every other robot turns the light only once. If they have already turned it on they leave it off or if it is on they leave it on. The 1st robot counts how many times he turns it off til 99"

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0OMG!!! I swear I didn't cheat. Been thinking about this question on and off all day yesterday

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0But you were a bit unclear  you have to STATE that he turns it off during 99 opportunities he is given

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0By the way  he does know  but how do the others know that he DOES know ?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0what do you mean by that

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0the robot knows but how to the other robots know he knows?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0First robot counted 99 lighton and reached the conclusion that all have been at the bulb. NOW  how will he communicate that fact to all the others ?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0haha. This isn't fun anymore. I gotta think about this

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0This is NOT fun, but i will spare you this time : Only probabilistically they will know. How? by seeing the light in their SEVERAL personal visits off they conclude that the probability that the FIRST  the turningoff guy was right before them is too low.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0ok. thx. Is this a question that was proposed to you in one of your classes?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Thanks  now let us call here the other people who has been here  so they appreciate our work. @bahrom7893 @sauravshakya @kingGeorge, @ganeshie8 @hartnn @experimentex

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Welcome to our humble abode Mrs @sauravshakya @hartnn and all !

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0ACTUALLY THIS SIMILAR PROBLEM WAS ALREADY SOLVED BY ME TOO.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0THAT IS THE SIMILAR QUESTION....... only number are different..AND ITS LOGICAL NO SERIES

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0AS far as I remember.

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0ya, i have also seen such problems...

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Dear visitor @sauravshakya  I bet you ten sayings of praise (of your choosing) that the following you have NOT solved before http://openstudy.com/study#/updates/50631053e4b0583d5cd34249

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Because I have met this situation in real life engineering problem.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Thanks Highlander ....!

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Best of luck. and keep them cool and well nutritioned !

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Haha. Yeahh. Thanks. Nice problem though.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I was just thinking @Mikael . How is my solution/our solution correct because it relies on the robots communicating prior to seeing the lightbulb? Which by the given conditions cannot happen.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0It is assumed the do communicate and agree beforehand.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.