AoPS Academy
[/quote]
, do not answer with "
is a solution" only. Either you post any kind of proof or at least something unexpected (like "
is the smallest solution). Someone that does not see that is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
+2 w
, 
, 
, 
and 
according to the diagram. The edges from points 
and 
, respectively are pairwise perpendicular. Prove that ![\[[ABCD]^2+[ABFE]^2+[ADHE]^2=[BCGF]^2+[CDHG]^2+[EFGH]^2,\]](http://latex.artofproblemsolving.com/c/f/b/cfb6dc6726af4711bcfe7827b6531471a75270fb.png)
where ![$[XYZW]$](http://latex.artofproblemsolving.com/9/c/2/9c25ef1b5cfb129136334ed811fb699a84f48a13.png)
denotes the area of quadrilateral 
.
such that
![\[\alpha =1-\cfrac{1}{2a_1-\cfrac{1}{2a_2-\cfrac{1}{2a_3-\cdots}}}\]](http://latex.artofproblemsolving.com/3/0/9/309e0411f481b6d77ccdfe8f18af9852074375aa.png)
where coefficients 
are positive integers, infinitely many of which are greater than 
. Prove that for every positive integer 
at least half of the numbers 
are even.
be an integer. In a configuration of an 
board, each of the 
cells contains an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo moves one square unit in the direction indicated by the arrow in her cell (possibly leaving the board). After each move, the arrows in all of the cells rotate 
counterclockwise. We call a cell good if, starting from that cell, Turbo visits each cell of the board exactly once, without leaving the board, and returns to her initial cell at the end. Determine, in terms of 
, the maximum number of good cells over all possible starting configurations.
be a given positive integer. Luca, the lazy flea sits on one of the vertices of a regular 
-gon. For each jump, Luca picks an axis of symmetry of the polygon, and reflects herself on the chosen axis of symmetry. Let 
denote the number of different ways Luca can make jumps such that she returns to her original position in the end, and does not pick the same axis twice. (It is possible that Luca's jump does not change her position, however, it still counts as a jump.) if is odd. is even, then![\[P(n)=(n-1)!\cdot n!\cdot \sum_{d\mid n}\left(\varphi\left(\frac{n}d\right)\binom{2d}{d}\right).\]](http://latex.artofproblemsolving.com/3/0/9/30992e5982bce4a032d5e96e0fb5fce8ab6ff21a.png)
, interior point 
is chosen such that triangle 
is equilateral. Let 
be the isogonal conjugate of point with respect to triangle . Define point 
on the ray 
such that 
. Similarly, define point 
on the ray 
such that 
. Prove that line 
bisects segment 
.
. Let 
be integers no two of which have their difference divisible by 
. Let 
be nonnegative integers such that 
is divisible by 
. Suppose that for all integers 
, the quantity![\[ (x - a)(x - b)(x - c)[(x - a)^i(x - b)^j(x - c)^k - 1]\]](http://latex.artofproblemsolving.com/7/3/9/739d5dbd62a9ea9bf7d85193daa68f58876a3ec6.png)
. Prove that each of must be divisible by .
has 2 roots 
and equation 
has 2 roots called 
. Prove that 
and in the plane and a subset 
of the plane, which are announced to Bob. Next, Bob marks infinitely many points in the plane, designating each a city. He may not place two cities within distance at most one unit of each other, and no three cities he places may be collinear. Finally, roads are constructed between the cities as follows: for each pair 
of cities, they are connected with a road along the line segment if and only if the following condition holds:
distinct from and 
, there exists 
such[/center]
is directly similar to either 
or 
.[/center]
is directly similar to 
if there exists a sequence of rotations, translations, and dilations sending 
to 
, 
to 
, and 
to 
.
![$P(x) \in \mathbb{Z}[x]$](http://latex.artofproblemsolving.com/3/b/4/3b4dadc0cf4b02930a03c0ff0ce95e8b7a740ebb.png)
be a polynomial. Suppose that 
for infinitely many pairs 
. Prove that the graph of function 
has a center of symmetry.
+1 w
(i dont remember exactly if it was 8032038 or some other number, so correct me on this)
(i posted this at 12:29) lol
?
