Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Given two positive integers $x,y$, we define $z=x\,\oplus\,y$ to be the bitwise XOR sum of $x$ and $y$; that is, $z$ has a $1$ in its binary representation at exactly the place values where $x,y$ have differing binary representations. It is known that $\oplus$ is both associative and commutative. For example, $20 \oplus 18 = 10100_2 \oplus 10010_2 = 110_2 = 6$. Given a set $S=\{a_1, a_2, \dots, a_n\}$ of positive integers, we let $f(S) = a_1 \oplus a_2 \oplus a_3\oplus \dots \oplus a_n$. We also let $g(S)$ be the number of divisors of $f(S)$ which are at most $2018$ but greater than or equal to the largest element in $S$ (if $S$ is empty then let $g(S)=2018$). Compute the number of $1$s in the binary representation of $\displaystyle\sum_{S\subseteq \{1,2,\dots, 2018\}} g(S)$. [i]Proposed by Brandon Wang and Vincent Huang

Find all pair of integers $(m,n)$ and $m \ge n$ such that there exist a positive integer $s$ and a) Product of all divisor of $sm, sn$ are equal. b) Number of divisors of $sm,sn$ are equal.

Let $n$ be a fixed natural number. [b]a)[/b] Find all solutions to the following equation : \[ \sum_{k=1}^n [\frac x{2^k}]=x-1 \] [b]b)[/b] Find the number of solutions to the following equation ($m$ is a fixed natural) : \[ \sum_{k=1}^n [\frac x{2^k}]=x-m \]

Each morning of her five-day workweek, Jane bought either a $ 50$-cent muffin or a $ 75$-cent bagel. Her total cost for the week was a whole number of dollars. How many bagels did she buy? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Let $a$ be a real number. Find the minimum value of $\int_0^1 |ax-x^3|dx$. How many solutions (including University Mathematics )are there for the problem? Any advice would be appreciated.

Let $P$ be a convex planar polygon with equal angles. Let $l_1,\cdots, l_n$ be its sides. Show that a necessary and sufficient condition for $P$ to be regular is that the sum of the ratios $\frac{l_i}{l_{i+1}} (i = 1,\cdots, n; l_{n+1}= l_1)$ equals the number of sides.

Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2 \cdot n$ real numbers. Prove that the following two statements are equivalent: [b]i)[/b] For any $ n$ real numbers $ x_1$, $ x_2$, ..., $ x_n$ satisfying $ x_1 \leq x_2 \leq \ldots \leq x_ n$, we have $ \sum^{n}_{k \equal{} 1} a_k \cdot x_k \leq \sum^{n}_{k \equal{} 1} b_k \cdot x_k,$ [b]ii)[/b] We have $ \sum^{s}_{k \equal{} 1} a_k \leq \sum^{s}_{k \equal{} 1} b_k$ for every $ s\in\left\{1,2,...,n\minus{}1\right\}$ and $ \sum^{n}_{k \equal{} 1} a_k \equal{} \sum^{n}_{k \equal{} 1} b_k$.

Find all the triples of positive integers $(a,b,c)$ for which the number \[\frac{(a+b)^4}{c}+\frac{(b+c)^4}{a}+\frac{(c+a)^4}{b}\] is an integer and $a+b+c$ is a prime.

In each cell of an $n\times n$ board is a lightbulb. Initially, all of the lights are off. Each move consists of changing the state of all of the lights in a row or of all of the lights in a column (off lights are turned on and on lights are turned off). Show that if after a certain number of moves, at least one light is on, then at this moment at least $n$ lights are on.

Find all positive integer $ n$ satisfying the following condition: There exist positive integers $ m$, $ a_1$, $ a_2$, $ \cdots$, $ a_{m\minus{}1}$, such that $ \displaystyle n \equal{} \sum_{i\equal{}1}^{m\minus{}1} a_i(m\minus{}a_i)$, where $ a_1$, $ a_2$, $ \cdots$, $ a_{m\minus{}1}$ may not distinct and $ 1 \leq a_i \leq m\minus{}1$.

Let there be a scalene triangle $ABC$, and its incircle hits $BC, CA, AB$ at $D, E, F$. The perpendicular bisector of $BC$ meets the circumcircle of $ABC$ at $P, Q$, where $P$ is on the same side with $A$ with respect to $BC$. Let the line parallel to $AQ$ and passing through $D$ meet $EF$ at $R$. Prove that the intersection between $EF$ and $PQ$ lies on the circumcircle of $BCR$.

Rachel has $3$ children, all of which are at least $2$ years old. The ages of the children are all pairwise relatively prime, but Rachel’s age is a multiple of each of her children’s ages. What is Rachel’s minimum possible age?

Solve for $x$, given $36x^4 + 36x^3 - 7x^2 - 6x + 1 = 0$.

A set $ S$ of points in space satisfies the property that all pairwise distances between points in $ S$ are distinct. Given that all points in $ S$ have integer coordinates $ (x,y,z)$ where $ 1 \leq x,y, z \leq n,$ show that the number of points in $ S$ is less than $ \min \Big((n \plus{} 2)\sqrt {\frac {n}{3}}, n \sqrt {6}\Big).$ [i]Dan Schwarz, Romania[/i]

A cyclic hexagon $ABCDEF$ is such that $AB \cdot CF= 2BC \cdot FA, CD \cdot EB = 2 DE \cdot BC$ and $EF \cdot AD = 2FA \cdot DE.$ Prove that the lines $AD, BE$ and $CF$ are concurrent.

For positive reals $a \geq b \geq c \geq 0$ prove the following inequality: $$\frac{a}{b}+\frac{b}{c}+\frac{c}{a} \geq \frac{a+b}{a+c}+\frac{b+c}{b+a}+\frac{c+a}{c+b}$$

Find all functions $f\colon \mathbb{R}\to\mathbb{R}$ such that \[f(x + y) + f(x + z) - f(x)f(y + z) \ge 1\] for all $x,y,z \in \mathbb{R}$

The real numbers $a, b, c$ are positive, and the real numbers $p, q, r \in [0,1/2]$ satisfy equality $p + q + r = 1$. Prove the inequality $$pab + qbc + rca \le \frac18 (a + b + c)^2.$$

A unit cube is cut twice to form three triangular prisms, two of which are congruent, as shown in Figure 1. The cube is then cut in the same manner along the dashed lines shown in Figure 2. This creates nine pieces. What is the volume of the piece that contains vertex $ W$? [asy]import three; size(200); defaultpen(linewidth(.8pt)+fontsize(10pt)); currentprojection=oblique; path3 p1=(0,2,2)--(0,2,0)--(2,2,0)--(2,2,2)--(0,2,2)--(0,0,2)--(2,0,2)--(2,2,2); path3 p2=(2,2,0)--(2,0,0)--(2,0,2); path3 p3=(0,0,2)--(0,2,1)--(2,2,1)--(2,0,2); path3 p4=(2,2,1)--(2,0,0); pen finedashed=linetype("4 4"); draw(p1^^p2^^p3^^p4); draw(shift((4,0,0))*p1); draw(shift((4,0,0))*p2); draw(shift((4,0,0))*p3); draw(shift((4,0,0))*p4); draw((4,0,2)--(5,2,2)--(6,0,2),finedashed); draw((5,2,2)--(5,2,0)--(6,0,0),finedashed); label("$W$",(3,0,2)); draw((2.7,.3,2)--(2.1,1.9,2),linewidth(.6pt)); draw((3.4,.3,2)--(5.9,1.9,2),linewidth(.6pt)); label("Figure 1",(1,-0.5,2)); label("Figure 2",(5,-0.5,2));[/asy]$ \textbf{(A)}\ \frac {1}{12}\qquad \textbf{(B)}\ \frac {1}{9}\qquad \textbf{(C)}\ \frac {1}{8}\qquad \textbf{(D)}\ \frac {1}{6}\qquad \textbf{(E)}\ \frac {1}{4}$

Is the following set of prime numbers $p$ finite or infinite, where each $p$ [b]doesn't[/b] divide the numbers that can be expressed as $n^{2016}+2016^{2016}$ for $n\in \mathbb{N}$, if: a) $p=4k+3$; b) $p=4k+1$?

Prove that if a plane section of a tetrahedron is a parallelogram, then half of its perimeter is contained between the length of the smallest and the length of the largest edge of the tetrahedron.

Find the value of $y$ such that the following equation has exactly three solutions. $$||x -1|-4|= y.$$

Let $ABC$ an acute triangle. (a) Find the locus of points that are centers of rectangles whose vertices lie on the sides of $ABC$; (b) Determine if exist some points that are centers of $3$ distinct rectangles whose vertices lie on the sides of $ABC$.

Let the positive integers $x_1$, $x_2$, $...$, $x_{100}$ satisfy the equation \[\frac{1}{\sqrt{x_1}}+\frac{1}{\sqrt{x_2}}+...+\frac{1}{\sqrt{x_{100}}}=20.\] Show that at least two of these integers are equal to each other.