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 "2006 Canadian MO Problems"

m
 
(→‎Problem 3)
 
Line 8: Line 8:
 
[[2006 Canadian MO Problems/Problem 2 | Solution]]
 
[[2006 Canadian MO Problems/Problem 2 | Solution]]
 
==Problem 3==
 
==Problem 3==
−
In a rectangular array of nonnegative real numbers with <math>m</math> rows andn <math>n</math> columns, each row and each column intersect in a positive element, then the sums of their elements are the same. Prove that <math>m=n</math>.
+
 
 +
In a rectangular array of nonnegative real numbers with <math>m</math> rows and <math>n</math> columns, each row and each column contains at least one positive element. Moreover, if a row and a column intersect in a positive element, then the sums of their elements are the same. Prove that <math>m = n</math>.  
 +
 
  
 
[[2006 Canadian MO Problems/Problem 3 | Solution]]
 
[[2006 Canadian MO Problems/Problem 3 | Solution]]
 +
 
==Problem 4==
 
==Problem 4==
 
Consider a round robin tournament with <math>2n+1</math> teams, where two teams play exactly one match and there are no ties. We say that the teams <math>X</math>, <math>Y</math>, and <math>Z</math> form a <i>cycle triplet</i> if <math>X</math> beats <math>Y</math>, <math>Y</math> beats <math>Z</math>, and <math>Z</math> beats <math>X</math>.
 
Consider a round robin tournament with <math>2n+1</math> teams, where two teams play exactly one match and there are no ties. We say that the teams <math>X</math>, <math>Y</math>, and <math>Z</math> form a <i>cycle triplet</i> if <math>X</math> beats <math>Y</math>, <math>Y</math> beats <math>Z</math>, and <math>Z</math> beats <math>X</math>.

Latest revision as of 13:02, 28 January 2009

Problem 1

Let $f(n,k)$ be the number of ways distributing $k$ candies to $n$ children so that each child receives at most two candies. For example, $f(3,7)=0$, $f(3,6)=1$, and $f(3,4)=6$. Evaluate $f(2006,1)+f(2006,4)+f(2006,7)+\dots+f(2006,1003)$.

Solution

Problem 2

Let $ABC$ be an acute angled triangle. Inscribe a rectangle $DEFG$ in this triangle so that $D$ is on $AB$, $E$ on $AC$, and $F$ and $G$ on $BC$. Describe the locus of the intersections of the diagonals of all possible rectangles $DEFG$.

Solution

Problem 3

In a rectangular array of nonnegative real numbers with $m$ rows and $n$ columns, each row and each column contains at least one positive element. Moreover, if a row and a column intersect in a positive element, then the sums of their elements are the same. Prove that $m = n$.


Solution

Problem 4

Consider a round robin tournament with $2n+1$ teams, where two teams play exactly one match and there are no ties. We say that the teams $X$, $Y$, and $Z$ form a cycle triplet if $X$ beats $Y$, $Y$ beats $Z$, and $Z$ beats $X$.

(a) Find the minimum number of cycle triplets possible.

(b) Find the maximum number of cycle triplets possible.

Solution

Problem 5

The vertices of right triangle $ABC$ inscribed in a circle divide the three arcs, we draw a tangent intercepted by the lines $AB$ and $AC$. If the tangency points are $D$, $E$, and $F$, show that the triangle $DEF$ is equilateral.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_Canadian_MO_Problems&oldid=29785"