A beautiful example of double counting
Double counting is an interesting problem solving technique in discrete mathematics. This video introduces this technique through examples.
Analytics
Comments
It was really nice concept that is not too hard and also quite obscure (i didn't know about). I really enjoyed it. At times I felt needing to pause the video because you went fast discusing each case for the more special formulas, but the original formula was clearly explained in my opinion.
9It’s well narrated and the animations look great. The pacing was a bit fast and I had to rewind a couple of times. The visualization of the dots and lines did a good job to illustrate the problem.
7The pacing is a little slow and breaks between segments where visualizations are shown are too long
4.4The first proof is very clever and well presented. And the extension to three lines is natural. But beyond that, you're using the same argument again, so it feels a bit repetitive. It's a lot more casework without much additional insight.
5.9Goal Orientation: 7/10 Novelty: 3/10 Thought-Provoking: 7/10 Comprehensibility: 8/10 Technological: 8/10 Overall Average: 6.6/10
5.8well done, thinking is better than counting nevertheless a little boring
6.6This is a very nice video. The animation is beautiful. I wasn’t too interested in the topic but the video drew me in. The narration is very clear.
7.6what does choose mean? also were there some videos you know of to learn the prerequisites?
4.6motivation 8/10 clarity 8/10 novelty 8/10 memorability 5/10
5.8A very nice problem. Thanks for sharing. The generalization part wasn't super interesting tho. I would keep it shorter. Also, you could directly get C(n+1,4). Add a ghost element to a set of n and pick a subset of size 4 from it. If the ghost is there just ignore it. The rest of the argument is almost the same.
5.5great video already subscribed your channel ;)
9