Determine the integers $n$ where $$|2n^2+9n+4|$$ is a prime number.

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $n \ge 2$ be an integer. There are $n$ houses in a town. All distances between pairs of houses are different. Every house sends a visitor to the house closest to it. Find all possible values of $n$ (with full justification) for which we can design a town with $n$ houses where every house is visited.

Let $a_1,a_2,\ldots, a_m$ be a set of $m$ distinct positive even numbers and $b_1,b_2,\ldots,b_n$ be a set of $n$ distinct positive odd numbers such that \[a_1+a_2+\cdots+a_m+b_1+b_2+\cdots+b_n=2019\] Prove that \[5m+12n\le 581.\]

Let $ Z$ and $ R$ denote the sets of integers and real numbers, respectively. Let $ f: Z \rightarrow R$ be a function satisfying: (i) $ f(n) \ge 0$ for all $ n \in Z$ (ii) $ f(mn)\equal{}f(m)f(n)$ for all $ m,n \in Z$ (iii) $ f(m\plus{}n) \le max(f(m),f(n))$ for all $ m,n \in Z$ (a) Prove that $ f(n) \le 1$ for all $ n \in Z$ (b) Find a function $ f: Z \rightarrow R$ satisfying (i), (ii),(iii) and $ 0<f(2)<1$ and $ f(2007) \equal{} 1$

Svitlana writes the number $147$ on a blackboard. Then, at any point, if the number on the blackboard is $n$, she can perform one of the following three operations: $\bullet$ if $n$ is even, she can replace $n$ with $\frac{n}{2}$ $\bullet$ if $n$ is odd, she can replace $n$ with $\frac{n+255}{2}$ and $\bullet$ if $n \ge 64$, she can replace $n$ with $n - 64$. Compute the number of possible values that Svitlana can obtain by doing zero or more operations.

Imagine the unit square in the plane to be a [i]carrom board[/i]. Assume the [i]striker[/i] is just a point, moving with no friction (so it goes forever), and that when it hits an edge, the angle of reflection is equal to the angle of incidence, as in real life. If the striker ever hits a corner it falls into the pocket and disappears. The trajectory of the striker is completely determined by its starting point $(x,y)$ and its initial velocity $\overrightarrow{(p,q)}$. If the striker eventually returns to its initial state (i.e. initial position and initial velocity), we define its [i]bounce number[/i] to be the number of edges it hits before returning to its initial state for the $1^{\text{st}}$ time. For example, the trajectory with initial state $[(.5,.5);\overrightarrow{(1,0)}]$ has bounce number $2$ and it returns to its initial state for the $1^{\text{st}}$ time in $2$ time units. And the trajectory with initial state $[(.25,.75);\overrightarrow{(1,1)}]$ has bounce number $4$. $\textbf{(a)}$ Suppose the striker has initial state $[(.5,.5);\overrightarrow{(p,q)}]$. If $p>q\geqslant 0$ then what is its velocity after it hits an edge for the $1^{\text{st}}$ time ? What if $q>p\geqslant 0$ ? $\textbf{(b)}$ Draw a trajectory with bounce number $5$ or justify why it is impossible. $\textbf{(c)}$ Consider the trajectory with initial state $[(x,y);\overrightarrow{(p,0)}]$ where $p$ is a positive integer. In how much time will the striker $1^{\text{st}}$ return to its initial state ? $\textbf{(d)}$ What is the bounce number for the initial state $[(x,y);\overrightarrow{(p,q)}]$ where $p,q$ are relatively prime positive integers, assuming the striker never hits a corner ?

A can contains a mixture of two liquids A and B in the ratio $7:5$. When $9$ litres of the mixture are drawn and replaced by the same amount of liquid $B$, the ratio of $A$ and $B$ becomes $7:9$. How many litres of liquid A was contained in the can initially? $\textbf{(A)}~18$ $\textbf{(B)}~19$ $\textbf{(C)}~20$ $\textbf{(D)}~\text{None of the above}$

Find the largest interval $ M \subseteq \mathbb{R^ \plus{} }$, such that for all $ a$, $ b$, $ c$, $ d \in M$ the inequality \[ \sqrt {ab} \plus{} \sqrt {cd} \ge \sqrt {a \plus{} b} \plus{} \sqrt {c \plus{} d}\] holds. Does the inequality \[ \sqrt {ab} \plus{} \sqrt {cd} \ge \sqrt {a \plus{} c} \plus{} \sqrt {b \plus{} d}\] hold too for all $ a$, $ b$, $ c$, $ d \in M$? ($ \mathbb{R^ \plus{} }$ denotes the set of positive reals.)

A given triangle is divided into $n$ triangles in such a way that any line segment which is a side of a tiling triangle is either a side of another tiling triangle or a side of the given triangle. Let $s$ be the total number of sides and $v$ be the total number of vertices of the tiling triangles (counted without multiplicity). (a) Show that if $n$ is odd then such divisions are possible, but each of them has the same number $v$ of vertices and the same number $s$ of sides. Express $v$ and $s$ as functions of $n$. (b) Show that, for $n$ even, no such tiling is possible

Consider the triangular numbers $T_n = \frac{n(n+1)}{2} , n \in \mathbb N$. [list][b](a)[/b] If $a_n$ is the last digit of $T_n$, show that the sequence $(a_n)$ is periodic and find its basic period. [b](b)[/b] If $s_n$ is the sum of the first $n$ terms of the sequence $(T_n)$, prove that for every $n \geq 3$ there is at least one perfect square between $s_{n-1} and $s_n$.[/list]

Point $P$ is chosen inside triangle $ABC$ so that $\angle APC+\angle ABC=180^o$ and $BC=AP.$ On the side $AB$, a point $K$ is chosen such that $AK = KB + PC$. Prove that $CK \perp AB$.

The diagram below shows a $18\times 35$ rectangle with eight points marked that divide each side into three equal parts. Four triangles are removed from each of the corners of the rectangle leaving the shaded region. Find the area of this shaded region. [img]https://cdn.artofproblemsolving.com/attachments/2/1/e0fd592d589a1f5d3324a637743d0e9d6e3480.png[/img]

The sequence of Fibonnaci's numbers if defined from the two first digits $f_1=f_2=1$ and the formula $f_{n+2}=f_{n+1}+f_n$, $\forall n \in N$. [b](a)[/b] Prove that $f_{2010} $ is divisible by $10$. [b](b)[/b] Is $f_{1005}$ divisible by $4$? Albanian National Mathematical Olympiad 2010---12 GRADE Question 4.

We call a subset $S$ of vertices of graph $G$, $2$-dominating, if and only if for every vertex $v\notin S,v\in G$, $v$ has at least two neighbors in $S$. prove that every $r$-regular $(r\ge3)$ graph has a $2$-dominating set with size at most $\frac{n(1+\ln(r))}{r}$.(15 points) time of this exam was 3 hours

Without using tables, find the exact value of the product: \[P = \prod^7_{k=1} \cos \left(\frac{k \pi}{15} \right).\]

Prove that if $f:[0,1]\rightarrow[0,1]$ is a continuous function, then the sequence of iterates $x_{n+1}=f(x_{n})$ converges if and only if $$\lim_{n\to \infty}(x_{n+1}-x_{n})=0$$

Let $n$ be a positive integer. A sequence $(a_0,\ldots,a_n)$ of integers is $\textit{acceptable}$ if it satisfies the following conditions: [list=a] [*] $0=|a_0|<|a_1|<\cdots<|a_{n-1}|<|a_n|.$ [*]The sets $\{|a_1-a_0|,|a_2-a_1|,\ldots,|a_{n-1}-a_{n-2}|,|a_n-a_{n-1}|\}$ and $\{1,3,9,\ldots,3^{n-1}\}$ are equal.[/list] Prove that the number of acceptable sequences of integers is $(n+1)!$.

Let $ a$, $ b$, and $ c$ be positive real numbers such that $ ab + bc + ca = 3$. Prove the inequality \[ 3 + \sum_{\mathrm{\cyc}} (a - b)^2 \ge \frac {a + b^2c^2}{b + c} + \frac {b + c^2a^2}{c + a} + \frac {c + a^2b^2}{a + b} \ge 3. \]

Find the biggest real number $ k$ such that for each right-angled triangle with sides $ a$, $ b$, $ c$, we have \[ a^{3}\plus{}b^{3}\plus{}c^{3}\geq k\left(a\plus{}b\plus{}c\right)^{3}.\]

In a class of $30$ students, each students knows exactly six other students. (Of course, knowing is a mutual relation, so if $A$ knows $B$, then $B$ knows $A$). A group of three students is balanced if either all three students know each other, or no one knows anyone else within that group. How many balanced groups exist?

Source: 2017 Canadian Open Math Challenge, Problem C2 ----- A function $f(x)$ is periodic with period $T > 0$ if $f(x + T) = f(x)$ for all $x$. The smallest such number $T$ is called the least period. For example, the functions $\sin(x)$ and $\cos(x)$ are periodic with least period $2\pi$. $\qquad$(a) Let a function $g(x)$ be periodic with the least period $T = \pi$. Determine the least period of $g(x/3)$. $\qquad$(b) Determine the least period of $H(x) = sin(8x) + cos(4x)$ $\qquad$(c) Determine the least periods of each of $G(x) = sin(cos(x))$ and $F(x) = cos(sin(x))$.

Let $S$ be a finite set with $n{}$ $(n>1)$ elements, $M{}$ the set of all subsets of $S{}$ and a function $f:M\rightarrow\mathbb{R}$, that verifies the relation $f(A\cap B)=\min\{f(A),f(B)\}, \forall A,B\in M$. Show that $$\sum_{A\in M} (-1)^{n-|A|}\cdot f(A)=f(S)-\max\{f(A)|A\in M, A\neq S\},$$ where$|A|$ is the number of elements of subset $A{}$.

How many integers less than $2502$ are equal to the square of a prime number?

Find the range of $ k$ for which the following inequality holds for $ 0\leq x\leq 1$. \[ \int_0^x \frac {dt}{\sqrt {(3 \plus{} t^2)^3}}\geq k\int _0^x \frac {dt}{\sqrt {3 \plus{} t^2}}\] If necessary, you may use $ \ln 3 \equal{} 1.10$.