In how many ways can one fill an $n*n$ matrix with $+1$ and $-1$ so that the product of the entries in each row and each column equals $-1$?

Prove the following equalities of sets: \[ \text{i)} \{x\in \mathbb{R}\ |\ \log_2 \lfloor x \rfloor \equal{} \lfloor \log_2 x\rfloor \} \equal{} \bigcup_{m\in \mathbb{N}} \left[2^m,2^m \plus{} 1\right)\] \[ \text{ii)} \{x\in \mathbb{R}\ |\ 2^{\lfloor x\rfloor} \equal{} \left\lfloor 2^x\right\rfloor \} \equal{} \bigcup_{m\in \mathbb{N}} \left[m, \log_2 (2^m \plus{} 1) \right)\]

Let $k$ be a positive integer. Find all positive integers $n$, such that it is possible to mark $n$ points on the sides of a triangle (different from its vertices) and connect some of them with a line in such a way that the following conditions are satisfied: 1) there is at least $1$ marked point on each side, 2) for each pair of points $X$ and $Y$ marked on different sides, on the third side there exist exactly $k$ marked points which are connected to both $X$ and $Y$ and exactly k points which are connected to neither $X$ nor $Y$

A point $P$ is given inside an acute-angled triangle $ABC$. Let $A',B',C'$ be the orthogonal projections of $P$ on sides $BC, CA, AB$ respectively. Determine the locus of points $P$ for which $\angle BAC = \angle B'A'C'$ and $\angle CBA = \angle C'B'A'$

Let $S$ be a subset of $\{0,1,2,\dots ,9\}$. Suppose there is a positive integer $N$ such that for any integer $n>N$, one can find positive integers $a,b$ so that $n=a+b$ and all the digits in the decimal representations of $a,b$ (expressed without leading zeros) are in $S$. Find the smallest possible value of $|S|$. [i]Proposed by Sutanay Bhattacharya[/i] [hide=Original Wording] As pointed out by Wizard_32, the original wording is: Let $X=\{0,1,2,\dots,9\}.$ Let $S \subset X$ be such that any positive integer $n$ can be written as $p+q$ where the non-negative integers $p, q$ have all their digits in $S.$ Find the smallest possible number of elements in $S.$ [/hide]

Given that $|3-a| = 2$, compute the sum of all possible values of $a$.

Nathan starts with the number $0$, and randomly adds either $1$ or $2$ with equal probability until his number reaches or exceeds $2018$. What is the probability his number ends up being exactly $2018$?

In rectangle $ ABCD$, we have $ AB\equal{}8$, $ BC\equal{}9$, $ H$ is on $ \overline{BC}$ with $ BH\equal{}6$, $ E$ is on $ \overline{AD}$ with $ DE\equal{}4$, line $ EC$ intersects line $ AH$ at $ G$, and $ F$ is on line $ AD$ with $ \overline{GF}\perp\overline{AF}$. Find the length $ GF$. [asy]unitsize(3mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); pair D=(0,0), Ep=(4,0), A=(9,0), B=(9,8), H=(3,8), C=(0,8), G=(-6,20), F=(-6,0); draw(D--A--B--C--D--F--G--Ep); draw(A--G); label("$F$",F,W); label("$G$",G,W); label("$C$",C,WSW); label("$H$",H,NNE); label("$6$",(6,8),N); label("$B$",B,NE); label("$A$",A,SW); label("$E$",Ep,S); label("$4$",(2,0),S); label("$D$",D,S);[/asy]$ \textbf{(A)}\ 16 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 28 \qquad \textbf{(E)}\ 30$

Given an integer $ n>6$. Consider those integers $ k\in (n(n\minus{}1),n^{2})$ which are coprime with $ n$. Prove that the greatest common divisor of the considered numbers is $ 1$.

The dollar is now worth $\frac{1}{980}$ ounce of gold. After the $n^{th}$ 7001 billion dollars bailout package passed by congress, the dollar gains $\frac{1}{2{}^2{}^{n-1}}$ of its $(n-1)^{th}$ value in gold. After four bank bailouts, the dollar is worth $\frac{1}{b}(1-\frac{1}{2^c})$ in gold, where $b, c$ are positive integers. Find $b + c$.

The net of 20 triangles shown below can be folded to form a regular icosahedron. Inside each of the triangular faces, write a number from 1 to 20 with each number used exactly once. Any pair of numbers that are consecutive must be written on faces sharing an edge in the folded icosahedron, and additionally, 1 and 20 must also be on faces sharing an edge. Some numbers have been given to you. (No proof is necessary.) [asy] unitsize(1cm); pair c(int a, int b){return (a-b/2,sqrt(3)*b/2);} draw(c(0,0)--c(0,1)--c(-1,1)--c(1,3)--c(1,1)--c(2,2)--c(3,2)--c(4,3)--c(4,2)--c(3,1)--c(2,1)--c(2,-1)--c(1,-1)--c(1,-2)--c(0,-3)--c(0,-2)--c(-1,-2)--c(1,0)--cycle); draw(c(0,0)--c(1,1)--c(0,1)--c(1,2)--c(0,2)--c(0,1),linetype("4 4")); draw(c(4,2)--c(3,2)--c(3,1),linetype("4 4")); draw(c(3,2)--c(1,0)--c(1,1)--c(2,1)--c(2,2),linetype("4 4")); draw(c(1,-2)--c(0,-2)--c(0,-1)--c(1,-1)--c(1,0)--c(2,0)--c(0,-2),linetype("4 4")); label("2",(c(0,2)+c(1,2))/2,S); label("15",(c(1,1)+c(2,1))/2,S); label("6",(c(0,1)+c(1,1))/2,N); label("14",(c(0,0)+c(1,0))/2,N);[/asy]

If $ a$, $ b$, $ c$ are the sidelengths of a triangle, then prove that $ \frac {3\left(a^4 \plus{} b^4 \plus{} c^4\right)}{\left(a^2 \plus{} b^2 \plus{} c^2\right)^2} \plus{} \frac {bc \plus{} ca \plus{} ab}{a^2 \plus{} b^2 \plus{} c^2}\geq 2$.

Consider a polynomial with coefficients of real numbers $ \phi(x)\equal{}ax^3\plus{}bx^2\plus{}cx\plus{}d$ with three positive real roots. Assume that $ \phi(0)<0$, prove that \[ 2b^3\plus{}9a^2d\minus{}7abc \le 0.\] [i]Hery Susanto, Malang[/i]

Let $s,t$ be given nonzero integers, $(x,y)$ be any (ordered) pair of integers. A sequence of moves is performed as follows: per move $(x,y)$ changes to $(x+t, y-s)$. The pair (x,y) is said to be [i]good [/i] if after some (may be, zero) number of moves described a pair of integers arises that are not relatively prime. a) Determine whether $(s,t)$ is itself a good pair; bj Prove that for any nonzero $s$ and $t$ there is a pair $(x,y)$ which is not good.

In an $m \times n$ grid, each square is either filled or not filled. For each square, its [i]value[/i] is defined as $0$ if it is filled and is defined as the number of neighbouring filled cells if it is not filled. Here, two squares are neighbouring if they share a common vertex or side. Let $f(m,n)$ be the largest total value of squares in the grid. Determine the minimal real constant $C$ such that $$\frac{f(m,n)}{mn} \le C$$holds for any positive integers $m,n$ [i]CSJL[/i]

Find the value of $\frac{2014^3-2013^3-1}{2013\times 2014}$. $ \textbf{(A) }3\qquad\textbf{(B) }5\qquad\textbf{(C) }7\qquad\textbf{(D) }9\qquad\textbf{(E) }11 $