Imagine 2 sets of 6 wires. How would I find how many possible connections there are?
Every wire must be used to be considered a connection.
//1st set
ABCDEF
GHIJKL
//2nd set
ABCDEF
HGIJKL
//visual layout of situation
0 1
0 1
0 1
0 1
0 1
0 1
|
Imagine 2 sets of 6 wires. How would I find how many possible connections there are? Every wire must be used to be considered a connection.
|
||||
|
|
|
I am not sure what you meant by the sets of wires, but assuming you have two stacks of six pieces of wires, like:
Then A can be connected to 6 pieces (G,H,I,J,K,L), B to 5 (G,H,I,J,K,L except for one) and so on, so the answer could be 6!=720. |
|||||||||||
|