Está en la página 1de 3

SDPC Fall Contest

Kevin Ren

October 12 - October 29, 2017

1 Important Information
1. The middle school division should only work on problems 1-5, while the high school
division should only work on problems 3-7. Proofs for problems that are not assigned
will not be graded.
2. You must show your work and prove your claims for all problems. Answers
without justification will receive minimal credit. Each problem is worth 7 points.
3. In your proof, follow the format outlined in the flyer. The top-right hand corner
should have Team ID, Problem number, and Page A of B. Use only one side of the
paper for solutions. Each solution should start on a new page.
4. Solutions may be written by hand or typed. LaTeX is a good tool for this purpose.
If you intend to use LaTeX, I recommend that you use the template provided in
the email. It can be directly copied and pasted into Overleaf or used as a file in a
LaTeX-compatible program.
5. Submit your solutions in one PDF file to sdpccontest@gmail.com by October
29th, 3:59 PM. Use the format “Submission for Team #(number)” as your subject
and name of the PDF file. In the body, please put your division (MS or HS) and
any comments/feedback about the test (e.g. difficulty, problem quality, etc.). Late
submissions will not be accepted. Once you send in your solutions, they are final.
6. You may use books, the Internet, or any other resources that are not human. No
discussing the test with other teams during the contest window.
7. Results will be announced and prizes distributed during SDML I. For more informa-
tion, re-read the flyer. Questions should be directed to the SDPC contest email.
Credits:
Problem Writer / Contest Director: Kevin Ren
Contest Facilitator: Dr. Brown
Test-solvers / Graders: Kevin Ren, Daniel Sun, Jacob Zhang

1
SDPC Contest Fall 2017

1. Lucky starts doodling on a 5 × 5 Bingo board. He puts his pencil at the center of
the upper-left square and draws a continuous doodle, never going off the board or
through a corner of a square. (See Figure 1.)

(a) Is it possible for Lucky’s doodle to visit all squares exactly once and end on the
Free Space?
(b) Is it possible for Lucky’s doodle to visit all squares exactly twice and end on the
Free Space?

Figure 1: The Free Space is the space labeled with ∗.

2. Call a quadratic invasive if it has 2 distinct real roots. Let P be a quadratic polyno-
mial with real coefficients. Prove that P (x) is invasive if and only if there exists a
real number c 6= 0 such that P (x) + P (x − c) is invasive.

3. Let n > 2 be a fixed positive integer. For a set S of n points in the plane, let P (S) be
the set of perpendicular bisectors of pairs of distinct points in S. Call set S complete
if no two (distinct) pairs of points share the same perpendicular bisector, and every
pair of lines in P (S) intersects. Let f (S) be the number of distinct intersection points
of pairs of lines in P (S).

(a) Find all complete sets S with n points such that f (S) = 1.
(b) Let S be a complete set with n points. Show that if f (S) > 1, then f (S) ≥ n.

4. Call a positive rational number in simplest terms coddly if its numerator and denom-
inator are both odd. Consider the equation

2017 = x1  x2  x3  . . .  x2016  x2017 ,

where there are 2016 boxes. We fill in the boxes randomly with the operations +, −,
and ×. Compute the probability that there exists a solution in distinct coddly
numbers (x1 , x2 , . . . , x2017 ) to the resulting equation.

5. Given positive real numbers a, b, c such that abc = 1, find the maximum possible
value of
1 1 1
3
+ 3
+ .
(4a + 4b + c) (4b + 4c + a) (4c + 4a + b)3

2
SDPC Contest Fall 2017

6. Let ABC be an acute triangle with circumcenter O. Let the parallel to BC through
A intersect line BO at BA and CO at CA . Lines BA C and BCA intersect at A0 .
Define B 0 and C 0 similarly.

(a) Prove that the perpendicular from A0 to BC, the perpendicular from B 0 to AC,
and the perpendicular from C 0 to AB are concurrent.
(b) Prove that lines AA0 , BB 0 , CC 0 are concurrent.

7. Let n > 1 be a fixed integer. On an infinite row of squares, there are n stones on
square 1 and no stones on squares 2, 3, 4, . . . . Curious George plays a game in which
a move consists of taking two adjacent piles of sizes a and b, where a − b is a nonzero
even integer, and transferring stones to equalize the piles (so that both piles have a+b
2
stones). The game ends when no more moves can be made. George wants to analyze
the number of moves it takes to end the game.

(a) Suppose George wants to end the game as quickly as possible. How many moves
will it take him?
(b) Suppose George wants to end the game as slowly as possible. Show that for all
2
n > 2, the game will end after at most 3n
16 moves.

Scoring note: For part (b), partial credit will be awarded for correct proofs of weaker
bounds, e.g. 14 n2 , nk , or k n (for some k ≥ 2).

También podría gustarte