4
$\begingroup$

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
$\endgroup$

1 Answer 1

6
$\begingroup$

I am not sure what you meant by the sets of wires, but assuming you have two stacks of six pieces of wires, like:

  • 1st: A,B,C,D,E,F
  • 2nd: G,H,I,J,K,L

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.

$\endgroup$
3
  • $\begingroup$ I believe that's what we're looking for... what's the correct term for 6!? Like if I was to say it $\endgroup$ Jan 14, 2011 at 14:15
  • 1
    $\begingroup$ @bradenkeith - factorial, see e.g. on Wikipedia (en.wikipedia.org/wiki/Factorial) $\endgroup$
    – daroczig
    Jan 14, 2011 at 14:16
  • 2
    $\begingroup$ @Braden: Also look up permutations. $\endgroup$
    – Aryabhata
    Jan 14, 2011 at 17:13

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .