Determine all functions $f:[0,\infty)\rightarrow\mathbb{R}$ such that $f(0)=0$ and \[f(x)=1+5f\left(\left\lfloor{\frac{x}{2}\right\rfloor}\right)-6f\left(\left\lfloor{\frac{x}{4}\right\rfloor}\right)\] for all $x>0$.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Let $n \geq 2$ be a positive integer. Let $\mathcal{R}$ be a connected set of unit squares on a grid. A [i]bar[/i] is a rectangle of length or width $1$ which is fully contained in $\mathcal{R}$. A bar is [i]special[/i] if it is not fully contained within any larger bar. Given that $\mathcal{R}$ contains special bars of sizes $1 \times 2,1 \times 3,\ldots,1 \times n$, find the smallest possible number of unit squares in $\mathcal{R}$. [i]Srinivas Arun[/i]

Put $1,2,....,2018$ (2018 numbers) in a row randomly and call this number $A$. Find the remainder of $A$ divided by $3$.

Find all primes $p$ such that the number of distinct positive factors of $p^2+2543$ is less than 16.

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that \[f(x^3)+f(y^3)=(x+y)f(x^2)+f(y^2)- f(xy)\] for all $x\in\mathbb{R}$.

Let $(a_n)_{n\ge0}$ be a sequence of positive integers such that $a^2_n$ divides $a_{n-1}a_{n+1}$, for all $n \ge 1$. Prove that if there exists an integer $k \ge 2$ such that $a_k$ and $a_1$ are relatively prime, then $a_1$ divides $a_0$. (Malik Talbi)

Find all pairs of positive integers $(n, k)$ that satisfy the equation $$n!+n=n^k$$

In making Euclidean constructions in geometry it is permitted to use a ruler and a pair of compasses. In the constructions considered in this question no compasses are permitted, but the ruler is assumed to have two parallel edges, which can be used for constructing two parallel lines through two given points whose distance is at least equal to the breadth of the rule. Then the distance between the parallel lines is equal to the breadth of the ruler. Carry through the following constructions with such a ruler. Construct: [b]a)[/b] The bisector of a given angle. [b]b)[/b] The midpoint of a given rectilinear line segment. [b]c)[/b] The center of a circle through three given non-collinear points. [b]d)[/b] A line through a given point parallel to a given line.

What is the sum of the first $2011$ integers closest in value to $0,$ including $0$ itself?

A cyclic quadrilateral $ABCD$ has circumcenter $O$, its diagonals $AC$ and $BD$ intersect at $G$. Let $P, Q, R, S$ be the circumcenters of $\vartriangle AGB, \vartriangle BGC, \vartriangle CGD, \vartriangle DGA$ respectively. Lines $P R$ and $QS$ intersect at $M$. Show that $M$ is the midpoint of $OG$.

Find all pairs of positive integer $\alpha$ and function $f : N \to N_0$ that satisfies (i) $f(mn^2) = f(mn) + \alpha f(n)$ for all positive integers $m, n$. (ii) If $n$ is a positive integer and $p$ is a prime number with $p|n$, then $f(p) \ne 0$ and $f(p)|f(n)$.

Let $\Gamma_1,\Gamma_2$ be two circles centred at the points $(a,0),(b,0);0<a<b$ and having radii $a,b$ respectively.Let $\Gamma$ be the circle touching $\Gamma_1$ externally and $\Gamma_2$ internally. Find the locus of the centre of of $\Gamma$

Elisa has $2023$ treasure chests, all of which are unlocked and empty at first. Each day, Elisa adds a new gem to one of the unlocked chests of her choice, and afterwards, a fairy acts according to the following rules: [list=disc] [*]if more than one chests are unlocked, it locks one of them, or [*]if there is only one unlocked chest, it unlocks all the chests. [/list] Given that this process goes on forever, prove that there is a constant $C$ with the following property: Elisa can ensure that the difference between the numbers of gems in any two chests never exceeds $C$, regardless of how the fairy chooses the chests to unlock.

Let $P$ be a polynomial with integer coefficients. Suppose that for $n=1,2,3,\ldots ,1998$ the number $P(n)$ is a three-digit positive integer. Prove that the polynomial $P$ has no integer roots.

On a chess board ($8*8$) there are written the numbers $1$ to $64$: on the first line, from left to right, there are the numbers $1, 2, 3, ... , 8$; on the second line, from left to right, there are the numbers $9, 10, 11, ... , 16$;etc. The $\"+\"$ and $\"-\"$ signs are put to each number such that, in each line and in each column, there are $4$ $\"+\"$ signs and $4$ $\"-\"$ signs. Then, the $64$ numbers are added. Find all the possible values of this sum.

Let $x,y,a,b$ be positive real numbers such that $x\not= y$, $x\not= 2y$, $y\not= 2x$, $a\not=3b$ and $\frac{2x-y}{2y-x}=\frac{a+3b}{a-3b}$. Prove that $\frac{x^2+y^2}{x^2-y^2}\ge 1$.

In $\triangle{ADE}$ points $B$ and $C$ are on side $AD$ and points $F$ and $G$ are on side $AE$ so that $BG \parallel CF \parallel DE$, as shown. The area of $\triangle{ABG}$ is $36$, the area of trapezoid $CFED$ is $144$, and $AB = CD$. Find the area of trapezoid $BGFC$. [center][img]https://snag.gy/SIuOLB.jpg[/img][/center]

The absolute value of the sum of the elements of a real orthogonal matrix is at most the order of the matrix.

What is the area of the region in the complex plane consisting of all points $z$ satisfying both $|\tfrac{1}{z}-1|<1$ and $|z-1|<1$? ($|z|$ denotes the magnitude of a complex number, i.e. $|a+bi|=\sqrt{a^2+b^2}$.)

[b]p1.[/b] There are $5$ weights of masses $1,2,3,5$, and $10$ grams. One of the weights is counterfeit (its weight is different from what is written, it is unknown if the weight is heavier or lighter). How to find the counterfeit weight using simple balance scales only twice? [b]p2.[/b] There are $998$ candies and chocolate bars and $499$ bags. Each bag may contain two items (either two candies, or two chocolate bars, or one candy and one chocolate bar). Ann distributed candies and chocolate bars in such a way that half of the candies share a bag with a chocolate bar. Helen wants to redistribute items in the same bags in such a way that half of the chocolate bars would share a bag with a candy. Is it possible to achieve that? [b]p3.[/b] Insert in sequence $2222222222$ arithmetic operations and brackets to get the number $999$ (For instance, from the sequence $22222$ one can get the number $45$: $22*2+2/2 = 45$). [b]p4.[/b] Put numbers from $15$ to $23$ in a $ 3\times 3$ table in such a way to make all sums of numbers in two neighboring cells distinct (neighboring cells share one common side). [b]p5.[/b] All integers from $1$ to $200$ are colored in white and black colors. Integers $1$ and $200$ are black, $11$ and $20$ are white. Prove that there are two black and two white numbers whose sums are equal. [b]p6.[/b] Show that $38$ is the sum of few positive integers (not necessarily, distinct), the sum of whose reciprocals is equal to $1$. (For instance, $11=6+3+2$, $1/16+1/13+1/12=1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On the sides $AB$ and $CD$ of the parallelogram $ABCD$ mark points $E$ and $F$, respectively. On the diagonals $AC$ and $BD$ chose the points $M$ and $N$ so that $EM\parallel BD$ and $FN\parallel AC$. Prove that the lines $AF, DE$ and $MN$ intersect at one point. (B. Rublev)

$m, n$ are relatively prime. We have three jugs which contain $m$, $n$ and $m+n$ liters. Initially the largest jug is full of water. Show that for any $k$ in $\{1, 2, ... , m+n\}$ we can get exactly $k$ liters into one of the jugs.

Every point on a line is painted either red or blue. Prove that there always exist three points $A,B,C$ that are painted the same color and are such that the point $B$ is the midpoint of the segment $AC$.

For which commutative finite groups is the product of all elements equal to the unit element?