3
Part of 2002 Tournament Of Towns
Problems(6)
one zero means two zeroes
Source: Tournament of Towns,Spring 2002, Junior O Level, P3
5/13/2014
Show that if the last digit of the number is (where ) then last two digits are zero.
modular arithmeticalgebrapolynomialquadraticsnumber theory proposednumber theory
Maximising the area
Source: Tournament of Towns,Spring 2002, Junior A Level, P3
5/13/2014
Let and be the respective midpoints of of a convex quadrilateral . Segments cut the quadrilateral into four triangles whose areas are four consecutive integers. Find the maximum possible area of .
geometrygeometry proposed
Weighting once more
Source: Tournament of Towns,Spring 2002, Senior O Level, P3
5/14/2014
There are pieces of cheese of different weights. For any two pieces we can identify the heavier piece. Given that it is possible to divide them into two groups of equal weights with three pieces in each. Give the explicit way to find these groups by performing two weightings on a regular balance.
combinatorics proposedcombinatorics
Hard problems that most of the students fail to solve
Source: Tournament of Towns, Fall 2002, Junior O Level, P3
5/15/2014
[*] A test was conducted in class. It is known that at least of the problems were hard. Each such problems were not solved by at least of the students. It is also known that at least of the students passed the test. Each such student solved at least of the suggested problems. Is this possible?
[*] Previous problem with replaced by .
[*] Previous problem with replaced by .
combinatorics proposedcombinatorics
Several straight lines
Source: Tournament of Towns, Fall 2002, Senior O Level, P3
5/17/2014
Several straight lines such that no two are parallel, cut the plane into several regions. A point is marked inside of one region. Prove that a point, separated from by each of these lines, exists if and only if belongs to an unbounded region.
geometry proposedgeometry
arcs and parallel sides
Source: Tournament of Towns, Fall 2002, Junior A Level, P3
5/17/2014
The vertices of a divide a circumference into arcs, whose lengths are in some order. It is known that any two opposite arcs (corresponding to opposite sides) differ by . Prove that the polygon has two parallel sides.
combinatorics proposedcombinatorics