Solving for X instead of 3 in love triangles?

post by Eruvnal · 2019-07-22T16:35:45.533Z · LW · GW · 1 comment

This is a question post.

Contents

  Answers
    5 Unnamed
None
1 comment

I was rereading HPMOR and got to the math problem about love triangles (4^3 possible combinations but you need to remove the combinations where 1 person is not loved or in love with someone) and solved it by counting all the combinations that did not work (10) and subtracted it from the 64 possibility's to get 54 then did the same sort of counting strategy for if there were four people and fond that knowing the answer for 3 people made counting here easy (4 nodes (4^6) = 4096 won't include everyone (54x4)+(3x6)+1 = 235 so answer is 3861) but then, And here is my question forward is there a mathematical formula so solve for X people instead of laboriously solving by adding 1 person at a time and counting the permutations that don't include everyone?

Answers

answer by Unnamed · 2019-07-23T01:47:48.232Z · LW(p) · GW(p)

Number of weakly connected digraphs with n nodes.

http://oeis.org/A003027

↑ comment by Eruvnal · 2019-07-25T15:41:58.976Z · LW(p) · GW(p)

Thank you that was bothering me that explains it perfectly.

1 comment

Comments sorted by top scores.

comment by Pattern · 2019-07-22T17:00:03.149Z · LW(p) · GW(p)

If you have a link to where it was, that would make solving the problem easier.