2
Part of 2008 Tournament Of Towns
Problems(8)
TT2008 Junior O-Level - P2
Source:
9/4/2010
Twenty-five of the numbers are chosen. Twenty-five of the numbers are also chosen. No two chosen numbers differ by or . Find the sum of all chosen numbers.
combinatorics proposedcombinatorics
TT2008 Junior A-Level - P2
Source:
9/4/2010
Each of stones weights the integer number of grams. A balance with arrow indicates the difference of weights on the left and the right sides of it. Is it possible to determine the weights of all stones in weighings, if the balance can make a mistake in gram in at most one weighing?
combinatorics unsolvedcombinatorics
TT2008 Senior O-Level - P2
Source:
9/4/2010
Solve the system of equations
quadraticsalgebrasystem of equationsalgebra proposed
TT2008 Senior A-Level - P2
Source:
9/4/2010
Space is dissected into congruent cubes. Is it necessarily true that for each cube there exists another cube so that both cubes have a whole face in common?
geometry3D geometryanalytic geometrygeometry proposed
2008 ToT Spring Junior O P2 10 equal segments, interset at ratio 3:4
Source:
3/7/2020
There are ten congruent segments on a plane. Each intersection point divides every segment passing through it in the ratio . Find the maximum number of intersection points.
ratiocombinatorial geometrycombinatoricssegments
2008 ToT Spring Junior A P2 if AK = AO and KM = MC, then AM = KB
Source:
2/26/2020
A line parallel to the side of triangle cuts the side at and the side at . is the intersection point of and . If and , prove that .
geometryequal segments
2008 ToT Spring Senior O P2 2008(lcm of 1,2,...,m)=lcm of 1,2,...,n
Source:
3/7/2020
Can it happen that the least common multiple of is times the least common multiple of for some positive integers and ?
number theoryleast common multiple
2008 ToT Spring Senior A P2 game on the real line, strategy wanted
Source:
3/7/2020
Alice and Brian are playing a game on the real line. To start the game, Alice places a checker on a number where . In each move, Brian chooses a positive number . Alice must move the checker to either or . If it lands on or , Brian wins. Otherwise the game proceeds to the next move. For which values of does Brian have a strategy which allows him to win the game in a finite number of moves?
game strategygamecombinatorics