the friendship theorem - you always have 3 friends or 3 strangers at a party
Published 8 years ago • 86K plays • Length 4:53Download video MP4
Download video MP3
Similar videos
-
10:55
can 6 people uncover a mathematical certainty? the surprising truth!
-
3:19
proof by cases example: three mutual friends/enemies theorem
-
6:16
ramsey' theorem: theorem on friends and strangers
-
9:12
🖥 ramsey theory generalized pigeonhole principle friends enemies problem ! ! ! ! !
-
5:13
think thursday: multiples [discrete]
-
6:24
how to solve the chameleon riddle
-
6:24
how to solve the seemingly impossible escape logic puzzle
-
27:23
a combinatorial geometry puzzle that leads to pick's theorem -- and beyond!
-
3:47
true/false? in a party of 6, there are always 3 who are all mutual friends or all mutual strangers
-
21:53
your friends have more friends than you : a mathematical certainty
-
32:50
find the sf and gf (circle) when endpoints of the diamater are given: random geometry problem 4
-
44:52
tmwyf: graph labelings: new theorems and open problems! -- ranjan rohatgi
-
7:35
which two implies the third?
-
2:11
theorem on friends and strangers: visual proof
-
5:38
theorem on friends and strangers in graph theory
-
1:15
friendship an interesting property
-
4:30
can you solve this clever problem ?
-
19:20
week 9 tutorial (pigeonholes principle)
-
5:09
graph theory - three friends and strangers problem
-
0:21
mai l3 the even number riddle
-
0:47
friends & foes proof - daily problem 69
-
0:19
one line draws the entire shape,and the lines cannot overlap! is there an answer to this question?