[b]p33.[/b] Lines $\ell_1$ and $\ell_2$ have slopes $m_1$ and $m_2$ such that $0 < m_2 < m_1$. $\ell'_1$ and $\ell'_2$ are the reflections of $\ell_1$ and $\ell_2$ about the line $\ell_3$ defined by $y = x$. Let $A = \ell_1 \cap \ell_2 = (5, 4)$, $B = \ell_1 \cap \ell_3$, $C = \ell'_1 \cap \ell'_2$ and $D = \ell_2 \cap \ell_3$. If $\frac{4-5m_1}{-5-4m_1} = m_2$ and $\frac{(1+m^2_1)(1+m^2_2)}{(1-m_1)^2(1-m_2)^2} = 41$, compute the area of quadrilateral $ABCD$. [b]p34.[/b] Suppose $S(m, n) = \sum^m_{i=1}(-1)^ii^n$. Compute the remainder when $S(2020, 4)$ is divided by $S(1010, 2)$. [b]p35.[/b] Let $N$ be the number of ways to place the numbers $1, 2, ..., 12$ on a circle such that every pair of adjacent numbers has greatest common divisor $1$. What is $N/144$? (Arrangements that can be rotated to yield each other are the same). [b]p36.[/b] Compute the series $\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{{2n \choose 2}} =\frac{1}{{2 \choose 2}} - \frac{1}{{4 \choose 2}} +\frac{1}{{6 \choose 2}} -\frac{1}{{8 \choose 2}} -\frac{1}{{10 \choose 2}}+\frac{1}{{12 \choose 2}} +...$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Some lattice points in the Cartesian coordinate system are colored red, the rest of the lattice points are colored blue. Such a coloring is called [i]finitely universal[/i], if for any finite, non-empty $A\subset \mathbb Z$ there exists $k\in\mathbb Z$ such that the point $(x,k)$ is colored red if and only if $x\in A$. $a)$ Does there exist a finitely universal coloring such that each row has finitely many lattice points colored red, each row is colored differently, and the set of lattice points colored red is connected? $b)$ Does there exist a finitely universal coloring such that each row has a finite number of lattice points colored red, and both the set of lattice points colored red and the set of lattice points colored blue are connected? A set $H$ of lattice points is called [i]connected[/i] if, for any $x,y\in H$, there exists a path along the grid lines that passes only through lattice points in $H$ and connects $x$ to $y$. [i]Submitted by Anett Kocsis, Budapest[/i]

What is a centrally symmetric polygon of greatest area one can inscribe in a given triangle?

Let $n$ and $k$ be given integers such that $n\ge k\ge 2$. Alice and Bob play a game on an $n$ by $n$ table with white cells. They take turns to pick a white cell and color it black. Alice moves first. The game ends as soon as there is at least one black cell in every $k$ by $k$ square after a player moves, who is declared the winner of the game. Who has the winning strategy?

Let $ABC$ be an acute, non isosceles with $I$ is its incenter. Denote $D, E$ as tangent points of $(I)$ on $AB,AC$, respectively. The median segments respect to vertex $A$ of triangles $ABE$ and $ACD$ meet$ (I)$ at$ P,Q,$ respectively. Take points $M, N$ on the line $DE$ such that $AM \parallel BE$ and $AN \parallel C D$ respectively. a) Prove that $A$ lies on the radical axis of $(MIP)$ and $(NIQ)$. b) Suppose that the orthocenter $H$ of triangle $ABC$ lies on $(I)$. Prove that there exists a line which is tangent to three circles of center $A, B, C$ and all pass through $H$.

Suppose that you are given the foot of the altitude from vertex $A$ of a scalene triangle $ABC$, the midpoint of the arc with endpoints $B$ and $C$, not containing $A$ of the circumscribed circle of $ABC$, and also a third point $P$. Construct the triangle from these three points if $P$ is the a) orthocenter b) centroid c) incenter of the triangle.

Let $S$ be the set of all real polynomials $f(x) = ax^3 + bx^2 + cx + d$ such that $|f(x)| \le 1$ for all $ -1 \le x \le 1$. Show that the set of possible $|a|$ for $f$ in $S$ is bounded above and find the smallest upper bound.

Prove that for each prime $ P =9k+1$ ,exist natural n such that $P|n^3-3n+1$.

Let ABCD is a cyclic quadrilateral inscribed in $(O)$. $E, F$ are the midpoints of arcs $AB$ and $CD$ not containing the other vertices of the quadrilateral. The line passing through $E, F$ and parallel to the diagonals of $ABCD$ meet at $E, F, K, L$. Prove that $KL$ passes through $O$.

Fred chooses a positive two-digit number with distinct nonzero digits. Laura takes Fred’s number and swaps its digits. She notices that the sum of her number and Fred’s number is a perfect square and the positive difference between them is a perfect cube. Find the greater of the two numbers.

A rectangle of paper of $3$ cm by $9$ cm is folded along a straight line, making two opposite vertices coincide. In this way a pentagon is formed. Calculate it's area.

Let $ABC$ be a triangle with orthocenter $H$ and circumcenter $O$. Let $R$ be the radius of circumcircle of $\triangle ABC$. Let $A',B',C'$ be the points on $\overrightarrow{AH},\overrightarrow{BH},\overrightarrow{CH}$ respectively such that $AH.AA'=R^2,BH.BB'=R^2,CH.CC'=R^2$. Prove that $O$ is incenter of $\triangle A'B'C'$.

Let be four positive integers $m, n, p, q$, with $p < m$ given and $q < n$. Take four points $A(0; 0), B(p; 0), C (m; q)$ and $D(m; n)$ in the coordinate plane. Consider the paths $f$ from $A$ to $D$ and the paths $g$ from $B$ to $C$ such that when going along $f$ or $g$, one goes only in the positive directions of coordinates and one can only change directions (from the positive direction of one axe coordinate into the the positive direction of the other axe coordinate) at the points with integral coordinates. Let $S$ be the number of couples $(f, g)$ such that $f$ and $g$ have no common points. Prove that \[S = \binom{n}{m+n} \cdot \binom{q}{m+q-p} - \binom{q}{m+q} \cdot \binom{n}{m+n-p}.\]

Prove that $2010$ cannot be represented as the difference between two square numbers. (B. Schmidt, Graz University of Technology)

FIx positive integer $n$. Prove: For any positive integers $a,b,c$ not exceeding $3n^2+4n$, there exist integers $x,y,z$ with absolute value not exceeding $2n$ and not all $0$, such that $ax+by+cz=0$

Let Q+ and Z denote the set of positive rationals and the set of inte- gers, respectively. Find all functions f : Q+ → Z satisfying the following conditions: (i) f(1999) = 1; (ii) f(ab) = f(a) + f(b) for all a, b ∈ Q+; (iii) f(a + b) ≥ min{f(a), f(b)} for all a, b ∈ Q+.