Rob Renaud ([info]ru_linux_geek) wrote,
@ 2009-04-09 15:34:00
Previous Entry  Add to memories!  Tell a Friend  Next Entry
Worst TED talk ever?
Does the graph of 5 people, with 5 choose 2 = 10 connections bug you when he says 120? What about when he shows 10 people, with 10 choose 2 = 45 connections, and then says 10 factorial is approximately 3.6 million? Does it irk you that he never actually describes what an "interaction" is? Skip to 6 minutes and 30 seconds if you are lazy or bored.




(3 comments) - (Post a new comment)


[info]larrytc
2009-04-10 10:09 pm UTC (link)
Lame, since the number of subgraphs are 2^n, which is obviously still slower than n!. Not quite sure how it would fit in.

(Reply to this) (Thread)


[info]ru_linux_geek
2009-04-10 10:20 pm UTC (link)
subsets of vertexes are 2^n. But subgraphs (including edges) are 2^(n choose 2), which then outgrows n!. But in any case, I don't even see how the number of ways to order the vertexes comes into play at all.

(Reply to this) (Parent)(Thread)


[info]larrytc
2009-04-14 11:45 am UTC (link)
Ya, I meant sub-graphs that aren't stupid (could represent relationships)..

(Reply to this) (Parent)


(3 comments) - (Post a new comment)

Create an Account
Forgot your login or password?
Login w/ OpenID
English • Español • Deutsch • Русский…