CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Best connection linking random event"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange College math Topic #554
Reading Topic #554
Terry
guest
Jan-05-06, 12:36 PM (EST)
 
"Best connection linking random event"
 
   A device with two light bulbs. Suppose you are allowed to combine N such devices. Everytime when a switch is pressed, each device has one of these two light bulb turn on randomly. You are required to make a connection between any pair of light bulbs among the N devices such that for every 3 connections that you made, there must be at least one connection that will link up two light bulbs turning on. Suppose the switch is pressed to give random lighting of bulbs and the process will go on indefinitely, what is the minimum number of such devices and connections (with the way of connections shown as diagram) that will have the highest probability of achieving 1/3 of your total connections that will link up two light bulbs turning on?
I may not frame the question properly but hope you can understand its content. Can anyone interested in this question give me the answers and a detailed explanation (or generalized this specific problem)? Thank you in advance.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
mr_homm
Member since May-22-05
Jan-06-06, 04:17 PM (EST)
Click to EMail mr_homm Click to send private message to mr_homm Click to view user profileClick to add this user to your buddy list  
1. "RE: Best connection linking random event"
In response to message #0
 
   Hi Terry,

I do not see how the probability can be larger than 1/4. Here is my reasoning: Let the machines be numbered 1,2,...,n, and let the lights be a and b, so that 1a2b means connecting the "a" bulb of machine 1 to the "b" bulb of machine 2. I am assuming that the bulbs light up randomly, with equal probability of bulb "a" and bulb "b" lighting up on each machine, and that choice of which bulb to light up is independent on each machine.

Now any connection between the two bulbs on the same machine, like 1a1b, 2a2b, ... nanb will NEVER have both bulbs light up at the same time, because each machine chooses one bulb randomly to light up. Any connection between two different machines will succeed exactly 1/4 of the time, because the two bulbs light up independently with probability 1/2 each.

Therefore, the best strategy is to avoid connecting the two bulbs on the same machine, and only connect bulbs on different machines. Since all the connections between different machines have an equal probability of success, it doesn't matter how you connect them or how many connections you have.

The smallest number of machines where you can do this is n=2, and the simplest connections is to just make one connection 1a2a (or 1a2b, or 1b2a, or 1b2b, it doesn't matter). Then on average, the number of successes will be 1/4 of the number of random trials.

Perhaps I am misunderstanding the problem. Should I not assume the machines are independent? When you say "connect the bulbs" do you mean just to form a mathematical set of two bulbs, just to see if they both light up? Or do you mean some kind of physical connection that would change the probability of lighting up?

--Stuart Anderson


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

|Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK