Revenge on the 2018 TSTST Part 1
by yayups, Nov 28, 2018, 7:35 AM
This is many months too late, but here are solutions to day 1 of the 2018 TSTST. I only solved problem 1 in test, and made partial progress on problem 2, for an overall dist of 710. Day 2 coming up whenever I have time.
Problem 1
Remarks
Problem 2
Remarks
Problem 3
Remarks
Problem 1 wrote:
As usual, let
denote the set of single-variable polynomials in
with integer coefficients. Find all functions
such that for any polynomials
,
Evan Chen and Yang Liu
![${\mathbb Z}[x]$](http://latex.artofproblemsolving.com/6/5/c/65c706f0720053de4c8e9021be60424c81fe580d.png)

![$\theta : {\mathbb Z}[x] \to {\mathbb Z}$](http://latex.artofproblemsolving.com/b/e/7/be740c2a5369dd1a05cc4797bcd7123bd894aca8.png)
![$p,q \in {\mathbb Z}[x]$](http://latex.artofproblemsolving.com/f/5/f/f5f83426c8251d470a3f9ba8f82adf3a7e873301.png)
, and
- if
then
divides
.
Evan Chen and Yang Liu
We claim that
for some fixed
. It is easy to see that this works. First, we show that
for all constant polynomials
. It is obvious that
by induction. Note that
, so
if
, so
, so
, so
or
. We also have
, so
, or
, or
or
. Thus,
, so
. Let
. We will now show that
for all
.
We see that
for any integer
, so
. But
, so we must have
for all integers
. Thus, we can make
sufficiently large to derive a contradiction, unless
, so we must have
, as desired.





















![$y\in\mathbb{Z}[x]$](http://latex.artofproblemsolving.com/2/4/c/24c5d80fef0eef2ae92d85eab8b8a8535ebec1d2.png)
We see that









Remarks
During the test, I basically had this solution, but I over complicated it a lot. I think I was trying to look at the explicit coefficients of
. I guess the test pressure got to me 


Problem 2 wrote:
In the nation of Onewaynia, certain pairs of cities are connected by one-way roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges), and each pair of cities has at most one road between them. Moreover, every city has exactly two roads leaving it and exactly two roads entering it.
We wish to close half the roads of Onewaynia in such a way that every city has exactly one road leaving it and exactly one road entering it. Show that the number of ways to do so is a power of
greater than
(i.e.\ of the form
for some integer
).
Victor Wang
We wish to close half the roads of Onewaynia in such a way that every city has exactly one road leaving it and exactly one road entering it. Show that the number of ways to do so is a power of




Victor Wang
For each edge
, create a variable
. This variable is
if the edge
is present in the new graph obtained by deletion, and is
otherwise. Now suppose for some vertex
,
are the two edges directed out, and
are the two edges directed in. We want exactly one of
to be present, and exactly one of
to be present. You can easily check that this is equivalent to demanding that
and
. So finding such deletion graphs is equivalent to solving all these linear equations where all the variables are in
.
Now you may be asking, "where is the mod 2 coming in"? The reason is that the solution space is
for some
, which is not natural to work with. However, we can replace
with
, or the integers mod 2, which is a field. This means that we can use Linear Algebra. Note that those equations that we wrote are equivalent to the same equations mod 2. Therefore, we have some huge system of linear equations over a field. The idea from linear algebra is that the set of solutions is a vector subspace of
, so its size is
, where
is the dimension of that vector space.
It suffices now to show that
, or that there are at least two solutions. In fact, swapping deleted with not deleted, it suffices to show the existence of just one solution. This can be done greedily, here is a sketch: the idea is to delete an edge, look at the two edges - one that shares a tail with the original edge, one that shares the tip. Then those must be not deleted, so each of those edges have another edge that must be deleted, and so on until we form a cycle. Then we delete that cycle and repeat.













Now you may be asking, "where is the mod 2 coming in"? The reason is that the solution space is







It suffices now to show that

Remarks
The later ideas basically form a solution, but its hard to write out the details (in particular, I feel like showing this "alternating cycle decomposition" exists and unique is tricky to do formally. Of course, its really obvious, and probably twenty minutes of careful thought would do the trick.
Problem 3 wrote:
Let
be an acute triangle with incenter
, circumcenter
, and circumcircle
. Let
be the midpoint of
. Ray
meets
at
. Denote by
and
the circumcircles of
and
, respectively. Line
meets
at
and
, while line
meets
at
and
. Assume that
lies inside
and
.
Consider the tangents to
at
and
and the tangents to
at
and
. Given that
, prove that these four lines are concurrent on
.
Evan Chen and Yannick Yao
























Consider the tangents to








Evan Chen and Yannick Yao
Firstly, note that if
is the midpoint of
, then
, so
is cylic. But
has diameter
, so
is the foot from
to
. Also, if
is the arc midpoint of
on
, then
has center
. These two observations allow us to draw an accurate diagram, as well as get rid of
.
![[asy]
unitsize(0.25inches);
/* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(0cm);
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */
pen dotstyle = black; /* point style */
real xmin = -19.346146341463424, xmax = 8.98556097560978, ymin = -21.452146341463425, ymax = 13.136146341463416; /* image dimensions */
pen wrwrwr = rgb(0.3803921568627451,0.3803921568627451,0.3803921568627451);
/* draw figures */
draw(circle((-7.446829268292673,3.267268292682925), 7.2758664615433), linewidth(2) + wrwrwr);
draw(circle((-8.252995512378936,-3.9637986239695873), 8.963419359442142), linewidth(2) + wrwrwr);
draw((-14.658885134475598,2.305767929049566)--(-0.6236097560975494,0.7410243902438998), linewidth(2) + wrwrwr);
draw((-0.6236097560975494,0.7410243902438998)--(-8.81761937476474,10.412838056544231), linewidth(2) + wrwrwr);
draw((-8.81761937476474,10.412838056544231)--(-14.658885134475598,2.305767929049566), linewidth(2) + wrwrwr);
draw((-10.979020637046352,4.575034647204184)--(-7.446829268292673,3.267268292682925), linewidth(2) + wrwrwr);
draw((-7.446829268292673,3.267268292682925)--(-0.6236097560975494,0.7410243902438998), linewidth(2) + wrwrwr);
draw(circle((-8.132224321528708,6.840053174613579), 3.6379332307716514), linewidth(2) + wrwrwr);
draw((-8.252995512378936,-3.9637986239695873)--(-0.8427502894756254,6.320852024588341), linewidth(2) + wrwrwr);
draw((-11.738252254620171,6.3593029927968905)--(-7.446829268292673,3.267268292682925), linewidth(2) + wrwrwr);
draw((-7.446829268292673,3.267268292682925)--(-4.547872900927279,1.178526700309378), linewidth(2) + wrwrwr);
draw(circle((-11.124452998553817,5.917051412212093), 5.053076183791322), linewidth(2) + wrwrwr);
/* dots and labels */
dot((-7.446829268292673,3.267268292682925),dotstyle);
label("$O$", (-7.848195121951217,2.653414634146339), NE * labelscalefactor);
dot((-0.6236097560975494,0.7410243902438998),dotstyle);
label("$C$", (-0.17502439024389035,0.4813170731707289), NE * labelscalefactor);
dot((-8.252995512378936,-3.9637986239695873),dotstyle);
label("$L$", (-8.296780487804876,-4.429512195121956), NE * labelscalefactor);
dot((-14.658885134475598,2.305767929049566),linewidth(4pt) + dotstyle);
label("$B$", (-15.21443902439025,2.2520487804878027), NE * labelscalefactor);
dot((-10.979020637046352,4.575034647204184),linewidth(4pt) + dotstyle);
label("$Q$", (-10.893853658536585,4.7546829268292665), NE * labelscalefactor);
dot((-8.81761937476474,10.412838056544231),linewidth(4pt) + dotstyle);
label("$A$", (-8.721756097560974,10.60990243902439), NE * labelscalefactor);
dot((-11.738252254620171,6.3593029927968905),linewidth(4pt) + dotstyle);
label("$M$", (-11.649365853658539,6.549024390243901), NE * labelscalefactor);
dot((-0.8427502894756254,6.320852024588341),linewidth(4pt) + dotstyle);
label("$P$", (-0.7416585365853544,6.501804878048779), NE * labelscalefactor);
dot((-4.547872900927279,1.178526700309378),linewidth(4pt) + dotstyle);
label("$F$", (-4.448390243902432,1.3784878048780462), NE * labelscalefactor);
dot((-8.472136045757011,1.6160290103748562),linewidth(4pt) + dotstyle);
label("$D$", (-8.367609756097558,1.803463414634144), NE * labelscalefactor);
dot((-4.720614565431147,5.576931223394066),linewidth(4pt) + dotstyle);
label("$N$", (-4.63726829268292,5.769902439024389), NE * labelscalefactor);
dot((-6.205037222166256,4.762526688254988),linewidth(4pt) + dotstyle);
label("$E$", (-6.101073170731702,4.9435609756097545), NE * labelscalefactor);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
/* end of picture */
[/asy]](//latex.artofproblemsolving.com/7/7/2/772d3637333c2b40f11c97f3a4c6a7bd6ca4c48c.png)
How to construct diagram:
Let
be any point, let
be any point, and let
be on the circle with center
and radius
. Then, let
be the second intersection of
(center
passes through
) with
. Finally, let
be the intersection of the perpendicular to
at
with
.
From this construction alone, we will be able to prove an important lemma.
Lemma:
Proof of Lemma: We use complex numbers with
,
, and
. Note then that
. We see that
is real and satisfies
, so we have
We have that
, so
is pure imaginary. Thus,
, or
. Therefore,
as desired.
We now proceed with the rest of the solution. Let
be on
such that
(this is motivated by the fact that we want the pole of
wrt
to lie on
, and the fact that
). We claim that
is the desired concurrence.
Let
be the midpoint of
. By the above mentioned motivation, we have that
collinear. Note that
is the angle between
(the perpendicular bisector of
) and
(since
). This is simply
, so since
, we have that
. Thus,
, so by the lemma, we have that
. Thus, the inverse of
about
is
, and since the inverse of
is
, we then have that
.
We want to show that the tangents at
to
concur at
, or that the polar of
wrt
is
. But the inverse of
is
in
, so the polar passes through
. By the motivation of the definition of
, we have that the polar is parallel to
. Therefore, since
collinear, the polar of
wrt
is
, as desired.
We now want to show that the polar of
with respect to
is
, or
(now we basically got rid of
, we'll still use it to make the angle chases cleaner). We see that
so
is tangent to
. Therefore, it suffices to show that the polar of
wrt
passes through
. By Lahire, it suffices to show that
is on the polar of
. We see that
so
is tangent to
. Let
. Since
, we must have that
is the other tangent, so the polar of
is
, or the radical axis of
and
.
However, we have that the power of
with respect to
is
, and the power of
with respect to
is
. Since
, there is a rotation at
that sends
and
, so
, so
has equal power with respect to
and
, so
is on the radical axis of
and
, which is the polar of
. Therefore, as we noted before, by Lahire, the polar of
wrt
is
. This completes the proof. 















![[asy]
unitsize(0.25inches);
/* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(0cm);
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */
pen dotstyle = black; /* point style */
real xmin = -19.346146341463424, xmax = 8.98556097560978, ymin = -21.452146341463425, ymax = 13.136146341463416; /* image dimensions */
pen wrwrwr = rgb(0.3803921568627451,0.3803921568627451,0.3803921568627451);
/* draw figures */
draw(circle((-7.446829268292673,3.267268292682925), 7.2758664615433), linewidth(2) + wrwrwr);
draw(circle((-8.252995512378936,-3.9637986239695873), 8.963419359442142), linewidth(2) + wrwrwr);
draw((-14.658885134475598,2.305767929049566)--(-0.6236097560975494,0.7410243902438998), linewidth(2) + wrwrwr);
draw((-0.6236097560975494,0.7410243902438998)--(-8.81761937476474,10.412838056544231), linewidth(2) + wrwrwr);
draw((-8.81761937476474,10.412838056544231)--(-14.658885134475598,2.305767929049566), linewidth(2) + wrwrwr);
draw((-10.979020637046352,4.575034647204184)--(-7.446829268292673,3.267268292682925), linewidth(2) + wrwrwr);
draw((-7.446829268292673,3.267268292682925)--(-0.6236097560975494,0.7410243902438998), linewidth(2) + wrwrwr);
draw(circle((-8.132224321528708,6.840053174613579), 3.6379332307716514), linewidth(2) + wrwrwr);
draw((-8.252995512378936,-3.9637986239695873)--(-0.8427502894756254,6.320852024588341), linewidth(2) + wrwrwr);
draw((-11.738252254620171,6.3593029927968905)--(-7.446829268292673,3.267268292682925), linewidth(2) + wrwrwr);
draw((-7.446829268292673,3.267268292682925)--(-4.547872900927279,1.178526700309378), linewidth(2) + wrwrwr);
draw(circle((-11.124452998553817,5.917051412212093), 5.053076183791322), linewidth(2) + wrwrwr);
/* dots and labels */
dot((-7.446829268292673,3.267268292682925),dotstyle);
label("$O$", (-7.848195121951217,2.653414634146339), NE * labelscalefactor);
dot((-0.6236097560975494,0.7410243902438998),dotstyle);
label("$C$", (-0.17502439024389035,0.4813170731707289), NE * labelscalefactor);
dot((-8.252995512378936,-3.9637986239695873),dotstyle);
label("$L$", (-8.296780487804876,-4.429512195121956), NE * labelscalefactor);
dot((-14.658885134475598,2.305767929049566),linewidth(4pt) + dotstyle);
label("$B$", (-15.21443902439025,2.2520487804878027), NE * labelscalefactor);
dot((-10.979020637046352,4.575034647204184),linewidth(4pt) + dotstyle);
label("$Q$", (-10.893853658536585,4.7546829268292665), NE * labelscalefactor);
dot((-8.81761937476474,10.412838056544231),linewidth(4pt) + dotstyle);
label("$A$", (-8.721756097560974,10.60990243902439), NE * labelscalefactor);
dot((-11.738252254620171,6.3593029927968905),linewidth(4pt) + dotstyle);
label("$M$", (-11.649365853658539,6.549024390243901), NE * labelscalefactor);
dot((-0.8427502894756254,6.320852024588341),linewidth(4pt) + dotstyle);
label("$P$", (-0.7416585365853544,6.501804878048779), NE * labelscalefactor);
dot((-4.547872900927279,1.178526700309378),linewidth(4pt) + dotstyle);
label("$F$", (-4.448390243902432,1.3784878048780462), NE * labelscalefactor);
dot((-8.472136045757011,1.6160290103748562),linewidth(4pt) + dotstyle);
label("$D$", (-8.367609756097558,1.803463414634144), NE * labelscalefactor);
dot((-4.720614565431147,5.576931223394066),linewidth(4pt) + dotstyle);
label("$N$", (-4.63726829268292,5.769902439024389), NE * labelscalefactor);
dot((-6.205037222166256,4.762526688254988),linewidth(4pt) + dotstyle);
label("$E$", (-6.101073170731702,4.9435609756097545), NE * labelscalefactor);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
/* end of picture */
[/asy]](http://latex.artofproblemsolving.com/7/7/2/772d3637333c2b40f11c97f3a4c6a7bd6ca4c48c.png)
How to construct diagram:
Let














From this construction alone, we will be able to prove an important lemma.
Lemma:

Proof of Lemma: We use complex numbers with













We now proceed with the rest of the solution. Let








Let



















We want to show that the tangents at
















We now want to show that the polar of





![\[\angle PAD=\angle PAL=\frac{1}{2}\widehat{PL}=\frac{1}{2}\widehat{AC}=\angle ABD,\]](http://latex.artofproblemsolving.com/0/e/c/0ec10087ffa24a86079f58e1756fa421ccd0f12a.png)







![\[\angle LBD=\angle LBC=\angle LAC=\angle BAD,\]](http://latex.artofproblemsolving.com/5/c/6/5c6dec46429e340c60345e9b9c2ca632d8f76b8b.png)









However, we have that the power of






















Remarks
This one took me a while. I had basically figured out the whole solution modulo the lemma in about 1-2 hours, but the lemma stumped me for way too long than it should have. Only after an hour banging my head with
inversion and trying to do clever power of point stuff did I realize the complex bash was immediate. I wonder if there is a nice synthetic solution to it (that only uses the basic setup, basically
only).

