(Ended)
Q1.
When the roots of the polynomial
![]()
are removed from the number line, what remains is the union of
disjoint open intervals. On how many of these intervals is
positive?
Q2.
You are playing a game. A
rectangle covers two adjacent squares (oriented either horizontally or vertically) of a
grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensure that at least one of your guessed squares is covered by the rectangle?
Q3.
Let
be the set of rectangular boxes with surface area
and volume
. Let
be the radius of the smallest sphere that can contain each of the rectangular boxes that are elements of
. The value of
can be written as
, where
and
are relatively prime positive integers. Find
.
Q4.
Let
denote the number of ordered triples of positive integers
such that
and
is a multiple of
. Find the remainder when
is divided by
.