Difference between revisions of "1976 AHSME Problems/Problem 28"
MRENTHUSIASM (talk | contribs) m |
MRENTHUSIASM (talk | contribs) |
||
| Line 10: | Line 10: | ||
== Solution == | == Solution == | ||
| + | To maximize the number of points of intersection, note that each point of intersection is passed by exactly two lines. If three or more lines pass through the same point, then we can create more points of intersection by translating the lines. | ||
| + | |||
| + | We partition <math>L_1,L_2,\dots,L_{100}</math> into three sets. Let | ||
| + | <cmath>\begin{align*} | ||
| + | A &= \{L_n\mid n\equiv0\pmod{4}\}, \\ | ||
| + | B &= \{L_n\mid n\equiv1\pmod{4}\}, \\ | ||
| + | C &= \{L_n\mid n\equiv2\text{ or }3\pmod{4}\}, | ||
| + | \end{align*}</cmath> | ||
| + | from which <math>|A|=|B|=25</math> and <math>|C|=50.</math> | ||
== See also == | == See also == | ||
Revision as of 14:31, 8 September 2021
Problem
Lines 
are distinct. All lines 
a positive integer, are parallel to each other.
All lines 
a positive integer, pass through a given point 
The maximum number of points of intersection of pairs of lines from the complete set 
is
Solution
To maximize the number of points of intersection, note that each point of intersection is passed by exactly two lines. If three or more lines pass through the same point, then we can create more points of intersection by translating the lines.
We partition into three sets. Let
from which 
and 
See also
| 1976 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 27 |
Followed by Problem 29 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
| All AHSME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
