AoPS Academy
blocks, each weighing at least 
; their total weight is 
. Prove that for every real number 
with 
you can choose a subset of the blocks whose total weight is at least but at most 
.
such that 
.
chessboard. Initially, Azer colors all cells of this chessboard with some colors. Then, Babek takes 
rows and columns and looks at the 
cells in the intersection. Babek wants to have all these cells in a same color, but Azer doesn't. With at least how many colors, Azer can reach his goal?
be non-negative real numbers such that 
Prove that
be a circle, and let a line 
intersect at two points, 
and 
Circles 
and 
are internally tangent to at points 
and 
respectively, and both are tangent to at a common point 
Similarly, circles 
and 
are externally tangent to at and respectively, and are tangent to at points 
and 
respectively. is 
the segment 
has a length of 
and 
find the length of segment 
,
,
, 
, 
is not greater than 
.
and 
be points on a plane such that 
, where is a positive integer. Let 
be the set of all points such that 
, where 
is a real number. The path that traces is continuous, and the value of is minimized. Prove that is rational for all positive integers 
, point 
is on chord 
such that 
and 
. Through point we draw chords 
and 
, and points and 
are intersection points of chords 
and 
with chord (see picture), respectively. If 
find 
, point is on chord such that and . Through point we draw chords and , and points and are intersection points of chords and with chord (see picture), respectively. If find 
and 
Prove that
.
Prove that
and 
Prove that
.
.
