Which species has the largest $\text{F-A-F}$ bond angle where $\text{A}$ is the central atom? $ \textbf{(A) }\ce{BF3} \qquad\textbf{(B) }\ce{CF4} \qquad\textbf{(C) }\ce{NF3}\qquad\textbf{(D) }\ce{OF2}\qquad$

Given is a triangle $ABC$, its circumcircle $\omega$, and a circle $k$ that touches $\omega$ from the outside, and also touches rays $AB$ and $AC$ in $P$ and $Q$, respectively. Prove that the $A$-excenter of $\triangle ABC$ is the midpoint of $\overline{PQ}$.

Prove that, for every pair $ n$, $r$ of positive integers, there can be found a polynomial $ f(x)$ of degree $ n$ with integer coefficients, so that every polynomial $ g(x)$ of degree at most $ n$, for which the coefficients of the polynomial $ f(x)\minus{}g(x)$ are integers with absolute value not greater than $ r$, is irreducible over the field of rational numbers.

Given [i]Fibonacci[/i] sequence $(F_n)$ a) Prove that: for all $u,v\in \mathbb{N}, u\ge 1$, we have:$$F_{u+v}=F_{u-1}F_{v}+F_{u}F_{v+1}.$$ b) Prove that: for all $n\in \mathbb{N}, n\ge 1$, we have:$$F_{2n}=F_n(F_{n-1}+F_{n+1}),$$$$F_{2n+1}=F_n^2+F_{n+1}^2.$$

There are $N$ houses in a city. Every Christmas, Santa visits these $N$ houses in some order. Show that if $N$ is large enough, then it holds that for three consecutive years there are always are $13$ houses such that they have been visited in the same order for two years (out of the three consecutive years). Determine the smallest $N$ for which this holds.

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

Prove that if $x,y,z >1$ and $\frac 1x +\frac 1y +\frac 1z = 2$, then \[\sqrt{x+y+z} \geq \sqrt{x-1}+\sqrt{y-1}+\sqrt{z-1}.\]

Let $f(x)$ and $g(x)$ be given by $f(x) = \frac{1}{x} + \frac{1}{x-2} + \frac{1}{x-4} + \cdots + \frac{1}{x-2018}$ $g(x) = \frac{1}{x-1} + \frac{1}{x-3} + \frac{1}{x-5} + \cdots + \frac{1}{x-2017}$. Prove that $|f(x)-g(x)| >2$ for any non-integer real number $x$ satisfying $0 < x < 2018$.

Evaluate $ \int_0^{\sqrt{2}\minus{}1} \frac{1\plus{}x^2}{1\minus{}x^2}\ln \left(\frac{1\plus{}x}{1\minus{}x}\right)\ dx$.

In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.

Let $ABCD$ be a convex quadrilateral. Extend line $CD$ past $D$ to meet line $AB$ at $P$ and extend line $CB$ past $B$ to meet line $AD$ at $Q$. Suppose that line $AC$ bisects $\angle BAD$. If $AD = \frac{7}{4}$, $AP = \frac{21}{2}$, and $AB = \frac{14}{11}$ , compute $AQ$.

$ABCD$ is a cyclic quadrilateral, with diagonals $AC,BD$ perpendicular to each other. Let point $F$ be on side $BC$, the parallel line $EF$ to $AC$ intersect $AB$ at point $E$, line $FG$ parallel to $BD$ intersect $CD$ at $G$. Let the projection of $E$ onto $CD$ be $P$, projection of $F$ onto $DA$ be $Q$, projection of $G$ onto $AB$ be $R$. Prove that $QF$ bisects $\angle PQR$.

Let be given a real number $\alpha\ne0$. Show that there is a unique point $P$ in the coordinate plane, such that for every line through $P$ which intersects the parabola $y=\alpha x^2$ in two distinct points $A$ and $B$, segments $OA$ and $OB$ are perpendicular (where $O$ is the origin).

On the AMC 8 contest Billy answers 13 questions correctly, answers 7 questions incorrectly and doesn't answer the last 5. What is his score? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 19 \qquad \textbf{(E)}\ 26$

For a positive integer $n$ not divisible by $211$, let $f(n)$ denote the smallest positive integer $k$ such that $n^k - 1$ is divisible by $211$. Find the remainder when $$\sum_{n=1}^{210} nf(n)$$ is divided by $211$. [i]Proposed by ApraTrip[/i]

Given a natural number $n$, for which we can find a prime number less than $\sqrt{n}$ that is not a divisor of $n$. The sequence $a_1, a_2,... ,a_n$ is the numbers $1, 2,... ,n$ arranged in some order. For this sequence, we will find the longest ascending subsequense $a_{i_1} < a_{i_2} < ... < a_{i_k}$, ($i_1 <...< i_k$) and the longest decreasing substring $a_{j_1} > ... > a_{j_l}$, ($j_1 < ... < j_l$) . Prove that at least one of these two subsequnsces $a_{i_1} , . . . , a_{i_k}$ and $a_{j_1} > ... > a_{j_l}$ contains a number that is not a divisor of $n$.

A number is said to be [i]triangular [/i] if it can be expressed in the form $1 + 2 +...+n$ for some positive integer $n$. We call a positive integer $a$ [i]retriangular [/i] if there exists a fixed positive integer $ b$ such that $aT +b$ is a triangular number whenever $T$ is a triangular number. Determine all retriangular numbers.

$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.

Find all positive integers $n$ such that it is possible to split the numbers from $1$ to $2n$ in two groups $(a_1,a_2,..,a_n)$, $(b_1,b_2,...,b_n)$ in such a way that $2n\mid a_1a_2\cdots a_n+b_1b_2\cdots b_n-1$. [i]Proposed by Alef Pineda[/i]

Let $D$ be an interior point of the acute triangle $ABC$ with $AB > AC$ so that $\angle DAB = \angle CAD.$ The point $E$ on the segment $AC$ satisfies $\angle ADE =\angle BCD,$ the point $F$ on the segment $AB$ satisfies $\angle FDA =\angle DBC,$ and the point $X$ on the line $AC$ satisfies $CX = BX.$ Let $O_1$ and $O_2$ be the circumcenters of the triangles $ADC$ and $EXD,$ respectively. Prove that the lines $BC, EF,$ and $O_1O_2$ are concurrent.

Six chairs are evenly spaced around a circular table. One person is seated in each chair. Each person gets up and sits down in a chair that is not the same chair and is not adjacent to the chair he or she originally occupied, so that again one person is seated in each chair. In how many ways can this be done? $ \textbf{(A) }14\qquad\textbf{(B) }16\qquad\textbf{(C) }18\qquad\textbf{(D) }20\qquad\textbf{(E) }24 $

Find all ordered pairs of positive integers $(m, n)$ such that $2m$ divides the number $3n - 2$, and $2n$ divides the number $3m - 2$.

Let $n \in \mathbb{N}, n \ge 2$ and the positive real numbers $a_1,a_2,…,a_n$ and $b_1,b_2,…,b_n$ such that $a_1+a_2+…+a_n=b_1+b_2+…+b_n=S.$ $\textbf{a)}$ Prove that $\sum\limits_{k=1}^n \frac{a_k^2}{a_k+b_k} \ge \frac{S}{2}.$ $\textbf{b)}$ Prove that $\sum\limits_{k=1}^n \frac{a_k^2}{a_k+b_k}= \sum\limits_{k=1}^n \frac{b_k^2}{a_k+b_k}.$

Given a square $5$ x $7$ board and $35$ pieces, each piece is formed by $3$ squares like below: [size=75][center][img]https://i.ibb.co/hFDhp9p/Screenshot-2023-03-26-061057.png[/img][/center][/size] Can we fill the board with $35$ pieces such that there are exactly $3$ pieces superimpose on every square of the given board? [i][color=#E06666]Note: we can rotate, turn upside down the pieces[/color][/i]

Consider $n$ points $A_1,A_2,A_3,\ldots, A_n$ ($n\geq 4$) in the plane, such that any three are not collinear. Some pairs of distinct points among $A_1,A_2,A_3,\ldots, A_n$ are connected by segments, such that every point is connected with at least three different points. Prove that there exists $k>1$ and the distinct points $X_1,X_2,\ldots, X_{2k}$ in the set $\{A_1,A_2,A_3,\ldots, A_n\}$, such that for every $i\in \overline{1,2k-1}$ the point $X_i$ is connected with $X_{i+1}$, and $X_{2k}$ is connected with $X_1$.