Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

We define a line in the projective plane as a set of the form $$ L_{a,b,c} = \left\{ {\left[ {x,y,z} \right] \in P_R^2 :ax + by + cz = 0} \right\}\text{ or just }L $$ Let a finite collection of lines $$ \left\{ {L_i } \right\}_{i = 1}^n $$ such that $$ \bigcap\limits_{i = 1}^n {L_i } $$ it´s empty The last definition.. a point $$ p \in \left\{ {L_i } \right\}_{i = 1}^n $$ it´s said to be a k-point if it´s exactly contained in k lines of $$ \left\{ {L_i } \right\}_{i = 1}^n $$ Prove that: $$ t_2 \geqslant 3 + \sum\limits_{k \geqslant 4} {\left( {k - 3} \right)t_k } $$ where $ t_k $ is the amount of k-points. And the equality holds iff the corresponding paving is by triangles ( every such kind of sets define a natural paving by polygons)

This problem looks so difficult, I have no idea how to attack this problem Dx This problem scares me , if someone can help me )=

share|cite|improve this question
If you remove the «homework difficult problem?» from the title nothing is lost... – Mariano Suárez-Alvarez Dec 4 '11 at 7:00

Look into what is known as the Sylvester-Gallai Theorem, and combinatorial approaches to proving it.

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.