Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1976 AHSME Problems/Problem 28"

(Set theory is too confusing. Will rewrite this solution entirely.)
Line 10: Line 10:
  
 
== Solution ==
 
== Solution ==
 +
We partition <math>\{L_1,L_2,\dots,L_{100}\}</math> into three sets. Let
 +
<cmath>\begin{align*}
 +
X &= \{L_n\mid n\equiv0\pmod{4}\}, \\
 +
Y &= \{L_n\mid n\equiv1\pmod{4}\}, \\
 +
Z &= \{L_n\mid n\equiv2,3\pmod{4}\}, \\
 +
\end{align*}</cmath>
 +
from which <math>|X|=|Y|=25</math> and <math>|Z|=50.</math>
  
 +
Any two distinct lines can have at most one point of intersection. We construct the sets one by one:
 +
<ol style="margin-left: 1.5em;">
 +
  <li>We construct all lines in set <math>X.</math> <p>
 +
Since all lines in set <math>X</math> are parallel to each other, they have <math>0</math> points of intersection.
 +
</li>
 +
  <li>We construct all lines in set <math>Y.</math> <p>
 +
The lines in set <math>Y</math> have <math>1</math> point of intersection, namely <math>A.</math> <p>
 +
Moreover, each line in set <math>Y</math> can have <math>1</math> point of intersection with each line in set <math>X.</math> <p>
 +
At this point, we have <math>1+625=626</math> additional points of intersection.
 +
</li>
 +
  <li>We construct all lines in set <math>Z.</math> <p>
 +
</li>
 +
</ol>
  
 
== See also ==
 
== See also ==

Revision as of 18:17, 8 September 2021

Problem

Lines $L_1,L_2,\dots,L_{100}$ are distinct. All lines $L_{4n}, n$ a positive integer, are parallel to each other. All lines $L_{4n-3}, n$ a positive integer, pass through a given point $A.$ The maximum number of points of intersection of pairs of lines from the complete set $\{L_1,L_2,\dots,L_{100}\}$ is

$\textbf{(A) }4350\qquad \textbf{(B) }4351\qquad \textbf{(C) }4900\qquad \textbf{(D) }4901\qquad \textbf{(E) }9851$

Solution

We partition $\{L_1,L_2,\dots,L_{100}\}$ into three sets. Let \begin{align*} X &= \{L_n\mid n\equiv0\pmod{4}\}, \\ Y &= \{L_n\mid n\equiv1\pmod{4}\}, \\ Z &= \{L_n\mid n\equiv2,3\pmod{4}\}, \\ \end{align*} from which $|X|=|Y|=25$ and $|Z|=50.$

Any two distinct lines can have at most one point of intersection. We construct the sets one by one:

  1. We construct all lines in set $X.$

    Since all lines in set $X$ are parallel to each other, they have $0$ points of intersection.

  2. We construct all lines in set $Y.$

    The lines in set $Y$ have $1$ point of intersection, namely $A.$

    Moreover, each line in set $Y$ can have $1$ point of intersection with each line in set $X.$

    At this point, we have $1+625=626$ additional points of intersection.

  3. We construct all lines in set $Z.$

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1976_AHSME_Problems/Problem_28&oldid=161910"