Difference between revisions of "1976 AHSME Problems/Problem 28"
MRENTHUSIASM (talk | contribs) (Created page with "== Problem == Lines <math>L_1,L_2,\dots,L_{100}</math> are distinct. All lines <math>L_{4n}, n</math> a positive integer, are parallel to each other. All lines <math>L_{4n-3}...") |
MRENTHUSIASM (talk | contribs) m |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Lines <math>L_1,L_2,\dots,L_{100}</math> are distinct. All lines <math>L_{4n}, n</math> a positive integer, are parallel to each other. | Lines <math>L_1,L_2,\dots,L_{100}</math> are distinct. All lines <math>L_{4n}, n</math> a positive integer, are parallel to each other. | ||
− | All lines <math>L_{4n-3} | + | All lines <math>L_{4n-3}, n</math> a positive integer, pass through a given point <math>A.</math> The maximum number of points of intersection of pairs of lines from the complete set <math>\{L_1,L_2,\dots,L_{100}\}</math> is |
− | The maximum number of points of intersection of pairs of lines from the complete set <math>\{L_1,L_2,\dots,L_{100}\}</math> is | ||
<math>\textbf{(A) }4350\qquad | <math>\textbf{(A) }4350\qquad |
Revision as of 13:35, 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
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.