Volume : 2 Issue : 1
The Complete Solution of the Gasca-Maeztu Hypothesis
Dr. Slavik Avagyan
ABSTRACT
The article provides a proof of the hypothesis for any n number of points and uses fundamentally new approaches to prove it. The first of these approaches is that the number of binary combinations from the specified n points is limited. That is, after removing any point, when the remaining points are covered by lines, overlapping lines appear, because the binary connections of the points are already repeated. And the second approach is that no more than (N+1) points can be located on straight lines satisfying the conditions of the hypothesis. N is the number of lines.
