What number is one third of the way from $ \frac14$ to $ \frac34$? $ \textbf{(A)}\ \frac{1}{3} \qquad \textbf{(B)}\ \frac{5}{12} \qquad \textbf{(C)}\ \frac{1}{2} \qquad \textbf{(D)}\ \frac{7}{12} \qquad \textbf{(E)}\ \frac{2}{3}$

[b]p1.[/b] Solve the equation $\log_x (x + 2) = 2$. [b]p2.[/b] Solve the inequality: $0.5^{|x|} > 0.5^{x^2}$. [b]p3.[/b] The integers from 1 to 2015 are written on the blackboard. Two randomly chosen numbers are erased and replaced by their difference giving a sequence with one less number. This process is repeated until there is only one number remaining. Is the remaining number even or odd? Justify your answer. [b]p4.[/b] Four circles are constructed with the sides of a convex quadrilateral as the diameters. Does there exist a point inside the quadrilateral that is not inside the circles? Justify your answer. [b]p5.[/b] Prove that for any finite sequence of digits there exists an integer the square of which begins with that sequence. [b]p6.[/b] The distance from the point $P$ to two vertices $A$ and $B$ of an equilateral triangle are $|P A| = 2$ and $|P B| = 3$. Find the greatest possible value of $|P C|$. PS. You should use hide for answers.

Suppose $a$, $b$, and $c$ are positive integers such that \[\frac{a}{14}+\frac{b}{15}=\frac{c}{210}.\] Which of the following statements are necessarily true? I. If $\gcd(a,14)=1$ or $\gcd(b,15)=1$ or both, then $\gcd(c,210)=1$. II. If $\gcd(c,210)=1$, then $\gcd(a,14)=1$ or $\gcd(b,15)=1$ or both. III. $\gcd(c,210)=1$ if and only if $\gcd(a,14)=\gcd(b,15)=1$. $\textbf{(A)}~\text{I, II, and III}\qquad\textbf{(B)}~\text{I only}\qquad\textbf{(C)}~\text{I and II only}\qquad\textbf{(D)}~\text{III only}\qquad\textbf{(E)}~\text{II and III only}$

For every positive integer $n$, denote by $D_n$ the number of permutations $(x_1, \dots, x_n)$ of $(1,2,\dots, n)$ such that $x_j\neq j$ for every $1\le j\le n$. For $1\le k\le \frac{n}{2}$, denote by $\Delta (n,k)$ the number of permutations $(x_1,\dots, x_n)$ of $(1,2,\dots, n)$ such that $x_i=k+i$ for every $1\le i\le k$ and $x_j\neq j$ for every $1\le j\le n$. Prove that $$\Delta (n,k)=\sum_{i=0}^{k=1} \binom{k-1}{i} \frac{D_{(n+1)-(k+i)}}{n-(k+i)}$$ (Proposed by Combinatorics; Ferdowsi University of Mashhad, Iran; Mirzavaziri)

Find the smallest natural number for which there exist that many natural numbers such that the sum of the squares of their squares is equal to $ 1998. $ [i]Gheorghe Iurea[/i]

Inside a triangle ABC, consider points $D, E$ such that $\angle ABD =\angle DBE=\angle EBC$ and $\angle ACD=\angle DC E=\angle ECB$. Calculate angles $\angle BDE$, $\angle B EC$, $\angle D E C$ in terms of the angle of the triangle $ABC$.

Let $m_1, m_2, \cdots ,m_k$ be positive numbers with the sum $S$. Prove that \[\displaystyle\sum_{i=1}^k\left(m_i +\frac{1}{m_i}\right)^2 \ge k\left(\frac{k}{S}+\frac{S}{k}\right)^2\]

We will consider odd natural numbers $n$ such that$$n|2023^n-1$$ $\textbf{a.}$ Find the smallest two such numbers. $\textbf{b.}$ Prove that there exists infinitely many such $n$

The radius $r$ of a circle with center at the origin is an odd integer. There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers. Determine $r$.

Let $S=\{1,2,\cdots, n\}$ and let $T$ be the set of all ordered triples of subsets of $S$, say $(A_1, A_2, A_3)$, such that $A_1\cup A_2\cup A_3=S$. Determine, in terms of $n$, \[ \sum_{(A_1,A_2,A_3)\in T}|A_1\cap A_2\cap A_3|\]

Show that $ x^3 + x+ a^2 = y^2 $ has at least one pair of positive integer solution $ (x,y) $ for each positive integer $ a $.

In the acute-angled triangle $ABC$ is drawn the altitude $CH$. A ray beginning at point $C$ that lies inside the $\angle BCA$ and intersects for second time the circles circumscribed circles of $\vartriangle BCH$ and $\vartriangle ABC$ at points $X$ and $Y$ respectively. It turned out that $2CX = CY$. Prove that the line $HX$ bisects the segment $AC$. (Hilko Danilo)

Consider the set $A = \{1, 2, ..., n\}$, where $n \in N, n \ge 6$. Show that $A$ is the union of three pairwise disjoint sets, with the same cardinality and the same sum of their elements, if and only if $n$ is a multiple of $3$.

Let $P_1, P_2, \ldots, P_n$ be distinct $2$-element subsets of $\{1, 2, \ldots, n\}$. Suppose that for every $1 \le i < j \le n$, if $P_i \cap P_j \neq \emptyset$, then there is some $k$ such that $P_k = \{i, j\}$. Prove that if $a \in P_i$ for some $i$, then $a \in P_j$ for exactly one value of $j$ not equal to $i$.

In the diagram below, how many distinct paths are there from January 1 to December 31, moving from one adjacent dot to the next either to the right, down, or diagonally down to the right? [asy] size(340); int i, j; for(i = 0; i<10; i = i+1) { for(j = 0; j<5; j = j+1) { if(10*j + i == 11 || 10*j + i == 12 || 10*j + i == 14 || 10*j + i == 15 || 10*j + i == 18 || 10*j + i == 32 || 10*j + i == 35 || 10*j + i == 38 ) { } else{ label("$*$", (i,j));} }} label("$\leftarrow$"+"Dec. 31", (10.3,0)); label("Jan. 1"+"$\rightarrow$", (-1.3,4));[/asy]

We have a square of side $1$ and a number $\ell$ such that $0 <\ell <\sqrt2$. Two players $A$ and $B$, in turn, draw in the square an open segment (without its two ends) of length $\ell $, starts A. Each segment after the first cannot have points in common with the previously drawn segments. He loses the player who cannot make his play. Determine if either player has a winning strategy.

If you pick a random $3$-digit number, what is the probability that its hundreds digit is triple the ones digit?

Given that $(1 + \tan 1^{\circ})(1 + \tan 2^{\circ}) \ldots (1 + \tan 45^{\circ}) = 2^n$, find $n$.

Let $\sum_{i=1}^n a_i x_i =0$, $a_i,x_i\in \mathbb{Z}$. It is known that however we color $\mathbb{Z}$ with finite number of colors, then the given equation has a monochromatic (of one color) solution. Prove that there is some non-empty sum of its coefficients equal to 0.

For a finite sequence $A = (a_1, a_2,\ldots,a_n)$ of numbers, the [i]Cesaro sum[/i] of $A$ is defined to be \[\frac{S_1 + S_2 + \cdots + S_n}{n}\] where $S_k = a_1 + a_2 + \cdots + a_k\ \ \ \ (1 \le k \le n)$. If the Cesaro sum of the 99-term sequence $(a_1, a_2, \ldots, a_{99})$ is $1000$, what is the Cesaro sum of the 100-term sequence $(1,a_1,a_2,\ldots,a_{99})$? $ \textbf{(A)}\ 991\qquad\textbf{(B)}\ 999\qquad\textbf{(C)}\ 1000\qquad\textbf{(D)}\ 1001\qquad\textbf{(E)}\ 1009 $

Given an $8\times 8$ checkerboard with alternating white and black squares, how many ways are there to choose four black squares and four white squares so that no two of the eight chosen squares are in the same row or column? [i]Proposed by James Lin.[/i]

Krut and Vert go by car from point $A$ to point $B$. The car leaves $A$ in the direction of $B$, but every $3$ km of the road Krut turns $90^o$ to the left, and every $7$ km of the road Vert turns $90^o$ to the right ( if they try to turn at the same time, the car continues to go in the same direction). Will Krut and Vert be able to get to $B$ if the distance between $A$ and $B$ is $100$ km?

Let $\mathcal{L}$ be the set of all lines in the plane and let $\mathcal{P}$ be the set of all points in the plane. Determine whether there exists a function $g : \mathcal{L} \to \mathcal{P}$ such that for any two distinct non-parallel lines $\ell_1, \ell_2 \in \mathcal{L}$, we have $(a)$ $g(\ell_1) \neq g(\ell_2)$, and $(b)$ if $\ell_3$ is the line passing through $g(\ell_1)$ and $g(\ell_2)$, then $g(\ell_3)$ is the intersection of $\ell_1$ and $\ell_2$.

Let $x_1,x_2,\ldots,x_n$ be distinct positive integers. Prove that \[ x_1^2+x_2^2 + \cdots + x_n^2 \geq \frac {2n+1}3 ( x_1+x_2+\cdots + x_n). \] [i]Laurentiu Panaitopol[/i]

Suppose that $ P\equal{}2^m$ and $ Q\equal{}3^n$. Which of the following is equal to $ 12^{mn}$ for every pair of integers $ (m,n)$? $ \textbf{(A)}\ P^2Q \qquad \textbf{(B)}\ P^nQ^m \qquad \textbf{(C)}\ P^nQ^{2m} \qquad \textbf{(D)}\ P^{2m}Q^n \qquad \textbf{(E)}\ P^{2n}Q^m$