Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose that we are given a bunch of points in $P \subseteq \mathbb{R}^2$which are not collinear. We say that a line is $k$-rich if it goes through $k$ points. If $k=2$, then we call the line ordinary. How would we determine the number of $k$-rich lines in $P$ if $k \geq 2$? Also what happens if we replace the parent field with $\mathbb{C}$ or another field? Do Hasse Diagrams come into play at all?

share|cite|improve this question

One way is to choose every pair of points, compute the line between them, and see how many other points are on that line. If the answer is exactly $k$, increment our counter by one. When we are done, divide our counter by ${k\choose 2}$. This method works equally for any field.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.