For each positive integer $n$, consider the polynomial $P_n(x)=x^{3n}-3\cdot4^{n-1}x^n-2^{3n-3}$.
(a) Prove that $P_n(x)$ has exactly one positive real root, denoted by $a_n$.
(b) Put $b_n=(2-a_n)/n$ and $c_n=b_1+b_2+\cdots+b_n$. Prove that the sequence $(c_n)_{n=1}^{\infty}$ has a finite limit.
To explore space, scientists often observe distant objects such as comets, asteroids and other astronomical phenomena. For this purpose they design and launch observation satellites into orbit around Earth. Most satellites do not move in perfect circles but have elliptical orbits, with Earth at one of the two foci. As a satellite moves in an elliptical orbit, its distance from the object being observed continually changes. Usually, the satellite's sensors receive the best signal when this distance is smallest.
Consider a satellite, regarded as a point, orbiting Earth along an ellipse. In three-dimensional Cartesian coordinates $Oxyz$, with each axis unit equal to $6400$ km, suppose the satellite moves in the coordinate plane $(Oxy)$ along $x^2+3y^2=17$. It must observe an object, also regarded as a point, moving in space. Research indicates that the best observation occurs when the object reaches $A(2;16/\sqrt3;8)$. Determine the coordinates of the point $C$ on the satellite's elliptical orbit for which the distance from $C$ to $A$ is smallest.
Let $n,a,b$ be positive integers satisfying $1\lt n^2\lt a\lt b\lt n^2+n+3$. Find all positive divisors of $ab$ that belong to the interval $(n^2,n^2+n+3)$.
An plays a game in which an ordered triple is written on a board from left to right. Initially the triple is $(1,1,1)$. On each turn, An performs one of these operations on the current triple $(x,y,z)$:
(i) erase it and write $(y,z,x+z)$;
(ii) erase it and write $(x+z+1,x+y+z+1,x+y+2z+1)$.
(a) Prove that An needs exactly four turns to write a triple $(a,b,6)$.
(b) Find the smallest nonnegative integer $k$ for which some play sequence lets An write $(c,d,129)$ after $k$ turns.
Let $ABC$ be an acute triangle with $AB\lt AC$, inscribed in a circle $(O)$. Let $E,F$ be the reflections of $A$ in $B,C$, respectively, and let $M$ be the midpoint of $BC$. On the line $AM$, take points $I,P$ such that triangles $AIE$ and $APF$ are isosceles at $I$ and $P$, respectively. Let $T$ be the intersection of the lines $IE$ and $PF$.
(a) Prove that $T$ belongs to $(O)$.
(b) Let $D=BI\cap CP$, $J=TD\cap IP$, and $X=OT\cap BC$. The lines $AT,AX$ meet $EF$ at $L,U$, respectively. Prove that the four circumcircles of triangles $TAJ,TIP,TEF,TLU$ have a second common point distinct from $T$.
(a) Find the number of distinct positive real roots of $Q(x)=x^3-5x^2+4x-1$.
(b) Suppose $a,b,c,d$ are integers such that $P(x)=ax^3+bx^2+cx+d$ has three distinct positive real roots and no rational root. Find the minimum value of $S=|a|+|b|+|c|+|d|$.
In a game, Mario moves forward by jumps of length $1$ metre, $a$ metres or $b$ metres, where $a,b$ are positive integers with $1\lt a\lt b$. Given a route of length $m$ metres, where $m$ is a positive integer, Mario always uses this strategy: first take as many jumps of length $b$ as possible without passing the destination; if the destination has not been reached, take as many jumps of length $a$ as possible without passing it; finally take jumps of length $1$. Mario wins if there is no way of reaching the destination in fewer jumps than this strategy. Otherwise Mario loses.
(a) Show that for $(a,b)=(6,14)$, there exists an $m$ for which Mario loses.
(b) Find the number of pairs $(a,b)$, with $1\lt a\lt b\le100$, for which Mario always wins with this strategy for every positive integer $m$.