Mathematica It's not electrical, it's purely mathematical

AI Thread Summary
The discussion revolves around creating a circuit with a battery and multiple bulbs, specifically focusing on the configurations that can be formed without loops. The key question is determining the number of ways to connect the battery to the bulbs using series or tree structures. The user emphasizes that the position of the battery is irrelevant and suggests using recursion to calculate the number of connected trees possible with n bulbs. The initial example provided illustrates the case for n=2, highlighting that with only three nodes, a tree structure is not feasible. The conversation seeks to clarify the combinatorial aspects of this circuit design problem.
pixel01
Messages
688
Reaction score
1
Hi all,

I posted this thread here and it was removed to electrical box (https://www.physicsforums.com/showthread.php?t=169778). In fact it is not an electrical. I hope this time it can be solved.

There is a battery (B) and n bulbs (A1, A2... An). Now that I have to make a circuit from the battery to all the bulbs. There should be no loops. You can make it in series or trees, but no loops. The question is: ' how many ways to make a circuit are there? '.
Here I draw a picture illustrating the case n=2. Because there are only 3 knots so there's no tree.

Thanks.
 

Attachments

  • circuit.GIF
    circuit.GIF
    1.4 KB · Views: 496
Physics news on Phys.org
I think the position of the battery does not matter.
You just need to calculate to number of connected trees that can be done with n bulbs.
Try recusivity.
 
Back
Top