Let $n$ be a natural number. A sequence $x_1,x_2, \cdots ,x_{n^2}$ of $n^2$ numbers is called $n-\textit{good}$ if each $x_i$ is an element of the set $\{1,2,\cdots ,n\}$ and the ordered pairs $\left(x_i,x_{i+1}\right)$ are all different for $i=1,2,3,\cdots ,n^2$ (here we consider the subscripts modulo $n^2$). Two $n-$good sequences $x_1,x_2,\cdots ,x_{n^2}$ and $y_1,y_2,\cdots ,y_{n^2}$ are called $\textit{similar}$ if there exists an integer $k$ such that $y_i=x_{i+k}$ for all $i=1,2,\cdots,n^2$ (again taking subscripts modulo $n^2$). Suppose that there exists a non-trivial permutation (i.e., a permutation which is different from the identity permutation) $\sigma$ of $\{1,2,\cdots ,n\}$ and an $n-$ good sequence $x_1,x_2,\cdots,x_{n^2}$ which is similar to $\sigma\left(x_1\right),\sigma\left(x_2\right),\cdots ,\sigma\left(x_{n^2}\right)$. Show that $n\equiv 2\pmod{4}$.

Let $a, b, c$ and $d$ be non-negative integers. Prove that the numbers $2^a7^b$ and $2^c7^d$ give the same remainder when divided by $15$ iff the numbers $3^a5^b$ and $3^c5^d$ give the same remainder when divided by $16$.

The incircle of triangle $\triangle ABC$ is the unique inscribed circle that is internally tangent to the sides $\overline{AB}$, $\overline{BC}$, and $\overline{CA}$. How many non-congruent right triangles with integer side lengths have incircles of radius $2015$?

What is the last two digits of base-$3$ representation of $2005^{2003^{2004}+3}$? $ \textbf{(A)}\ 21 \qquad\textbf{(B)}\ 01 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 02 \qquad\textbf{(E)}\ 22 $

Luke chose a set of three different dates $a,b,c$ in the month of May, where in any year, if one makes a calendar with a sheet of grid paper the centers of the cells with dates $a,b,c$ would form an isosceles right triangle or a straight line. How many sets can be chosen? [img]https://cdn.artofproblemsolving.com/attachments/7/3/dbf90fdc81fc0f0d14c32020b69df53b67b397.png[/img]

The diagram below shows a $1\times2\times10$ duct with $2\times2\times2$ cubes attached to each end. The resulting object is empty, but the entire surface is solid sheet metal. A spider walks along the inside of the duct between the two marked corners. There are positive integers $m$ and $n$ so that the shortest path the spider could take has length $\sqrt{m}+\sqrt{n}$. Find $m + n$. [asy] size(150); defaultpen(linewidth(1)); draw(origin--(43,0)--(61,20)--(18,20)--cycle--(0,-43)--(43,-43)--(43,0)^^(43,-43)--(61,-23)--(61,20)); draw((43,-43)--(133,57)--(90,57)--extension((90,57),(0,-43),(61,20),(18,20))); draw((0,-43)--(0,-65)--(43,-65)--(43,-43)^^(43,-65)--(133,35)--(133,57)); draw((133,35)--(133,5)--(119.5,-10)--(119.5,20)^^(119.5,-10)--extension((119.5,-10),(100,-10),(43,-65),(133,35))); dot(origin^^(133,5)); [/asy]

Solve the inequality $$\log_{\frac12} x\ge 16^x$$

Consider a finite group $ G $ and the sequence of functions $ \left( A_n \right)_{n\ge 1} :G\longrightarrow \mathcal{P} (G) $ defined as $ A_n(g) = \left\{ x\in G|x^n=g \right\} , $ where $ \mathcal{P} (G) $ is the power of $ G. $ [b]a)[/b] Prove that if $ G $ is commutative, then for any natural numbers $ n, $ either $ A_n(g) =\emptyset , $ or $ \left| A_n(g) \right| =\left| A_n(1) \right| . $ [b]b)[/b] Provide an example of what $ G $ could be in the case that there exists an element $ g_0 $ of $ G $ and a natural number $ n_0 $ such that $ \left| A_{n_0}\left( g_0 \right) \right| >\left| A_{n_0}(1) \right| . $ [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]

Let $a, b$, and $c$ be real numbers such that \[\frac{1}{bc-a^2} + \frac{1}{ca-b^2}+\frac{1}{ab-c^2} = 0.\] Prove that \[\frac{a}{(bc-a^2)^2} + \frac{b}{(ca-b^2)^2}+\frac{c}{(ab-c^2)^2} = 0.\]

Let $a,b,c > 0$ and $ab+bc+ca = 1$. Prove the inequality $3\sqrt[3]{\frac{1}{abc} +6(a+b+c) }\le \frac{\sqrt[3]3}{abc}$

In a right triangle with sides $ a$ and $ b$, and hypotenuse $ c$, the altitude drawn on the hypotenuse is $ x$. Then: $ \textbf{(A)}\ ab \equal{} x^2 \qquad\textbf{(B)}\ \frac {1}{a} \plus{} \frac {1}{b} \equal{} \frac {1}{x} \qquad\textbf{(C)}\ a^2 \plus{} b^2 \equal{} 2x^2$ $ \textbf{(D)}\ \frac {1}{x^2} \equal{} \frac {1}{a^2} \plus{} \frac {1}{b^2} \qquad\textbf{(E)}\ \frac {1}{x} \equal{} \frac {b}{a}$

$ABCD$ is a cyclic quadrilateral and $AC$ intersects $BD$ at $E$. $M, N$ are the midpoints of $AB, CD$, respectively. $\odot(AMN)$ meets $\odot(ABCD)$ again at $P$. $\odot(CMN)$ meets $\odot(ABCD)$ again at $Q$. $\odot(PEQ)$ meets $BD$ again at $T$. Prove that $M,N,T$ are colinear. [i]Proposed by chengbilly[/i]

Solve, in the positive integers, the equation $5^m + n^2 = 3^p$ .

Let $ABC$ be a scalene triangle. The incircle is tangent to lines $BC$, $AC$, and $AB$ at points $D$, $E$, and $F$, respectively, and the $A$-excircle is tangent to lines $BC$, $AC$, and $AB$ at points $D_1$, $E_1$, and $F_1$, respectively. Suppose that lines $AD$, $BE$, and $CF$ are concurrent at point $G$, and suppose that lines $AD_1$, $BE_1$, and $CF_1$ are concurrent at point $G_1$. Let line $GG_1$ intersect the internal bisector of angle $BAC$ at point $X$. Suppose that $AX=1$, $\cos{\angle BAC}=\sqrt{3}-1$, and $BC=8\sqrt[4]{3}$. Then $AB \cdot AC = \frac{j+k\sqrt{m}}{n}$ for positive integers $j$, $k$, $m$, and $n$ such that $\gcd(j,k,n)=1$ and $m$ is not divisible by the square of any integer greater than $1$. Compute $1000j+100k+10m+n$. [i]Proposed by Luke Robitaille and Brandon Wang[/i]

Let $\alpha$ and $\beta$ be nonnegative integers. Suppose the number of strictly increasing sequences of integers $a_0,a_1,\dots,a_{2014}$ satisfying $0 \leq a_m \leq 3m$ is $2^\alpha (2\beta + 1)$. Find $\alpha$. [i]Proposed by Lewis Chen[/i]

$22$ light bulbs are given. Each light bulb is connected to exactly one switch, but a switch can be connected to one or more light bulbs. Find the least number of switches we should have such that we can turn on whatever number of light bulbs.