Can anybody explain to me the double counting method?
I was not able to understand it clearly in the brilliant blog, I want an explanation related to a real life situation. Can anybody explain it to me? Plzzzzzzzzzz
This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
Double Counting is a very subtle and yet useful method. I personally didn't understand how far its power reached until they made me face a difficult problem (I was told it was an IMO 3, but I have not confirmed it).
Let k,n be natural numbers, and S a set of n points such that:
a) No three points are collinear.
b) For every point P, there are at least k points Q1,Q2,...,Qk such that the distance PQ1=PQ2=...=PQk.
Prove that k<21+2n−1*
(*) I don't remember very well whether it was 2n−2 or 2n−1 or something like that.
This problem seems extremely difficult at first sight, and might seem rather Geometric than Combinatoric. However, the problem can be solved through double counting, but what can you double count?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Source: [IMO 1989/3]
Let n and k be positive integers, and let S be a set of n points such that :
a) No three points of S are collinear,
b) For every point P of S, there are at least k points of S that are equidistant from P.
Prove that k<21+2n.
Double Counting is a very subtle and yet useful method. I personally didn't understand how far its power reached until they made me face a difficult problem (I was told it was an IMO 3, but I have not confirmed it).
Let k,n be natural numbers, and S a set of n points such that:
a) No three points are collinear.
b) For every point P, there are at least k points Q1,Q2,...,Qk such that the distance PQ1=PQ2=...=PQk.
Prove that k<21+2n−1*
(*) I don't remember very well whether it was 2n−2 or 2n−1 or something like that.
This problem seems extremely difficult at first sight, and might seem rather Geometric than Combinatoric. However, the problem can be solved through double counting, but what can you double count?
Well..frankly Calvin..how on earth do you know soo many stuffs?