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

2009 UNCO Math Contest II Problems/Problem 6

Revision as of 16:50, 19 October 2014 by Timneh (talk | contribs) (Created page with "== Problem == Let each of <math>m</math> distinct points on the positive <math>x</math>-axis be joined to each of <math>n</math> distinct points on the positive <math>y</math>-...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let each of $m$ distinct points on the positive $x$-axis be joined to each of $n$ distinct points on the positive $y$-axis. Assume no three segments are concurrent (except at the axes). Obtain with proof a formula for the number of interior intersection points. The diagram shows that the answer is $3$ when $m=3$ and $n=2.$

[asy] draw((0,0)--(0,3),arrow=Arrow()); draw((0,0)--(4,0),arrow=Arrow()); for(int x=0;x<4;++x){ for(int y=0;y<3;++y){ D((x,0)--(0,y),black); }} dot(IP((2,0)--(0,1),(1,0)--(0,2))); dot(IP((3,0)--(0,1),(1,0)--(0,2))); dot(IP((3,0)--(0,1),(2,0)--(0,2))); [/asy]


Solution

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2009_UNCO_Math_Contest_II_Problems/Problem_6&oldid=65057"