All ordinary proper irreducible fractions whose numerators are two-digit numbers were ordered in ascending order. Between what two consecutive fractions is the number $\frac58$ located?

Let $\alpha$ be a root of the equation $x^3-5x+3=0$ and let $f(x)$ be a polynomial with rational coefficients. Prove that if $f(\alpha)$ be the root of equation above, then $f(f(\alpha))$ is a root, too.

A polynomial $P(x) = 1 + x^2 + x^5 + x^{n_1} + ...+ x^{n_s} + x^{2008}$ with $n_1, ..., n_s$ are positive integers and $5 < n_1 < ... <n_s < 2008$ are given. Prove that if $P(x)$ has at least a real root, then the root is not greater than $\frac{1-\sqrt5}{2}$

[b]p1.[/b] Determine the number of ways to place $4$ rooks on a $4 \times 4$ chessboard such that: (a) no two rooks attack one another, and (b) the main diagonal (the set of squares marked $X$ below) does not contain any rooks. [img]https://cdn.artofproblemsolving.com/attachments/e/e/e3aa96de6c8ed468c6ef3837e66a0bce360d36.png[/img] The rooks are indistinguishable and the board cannot be rotated. (Two rooks attack each other if they are in the same row or column.) [b]p2.[/b] Seven students, numbered $1$ to $7$ in counter-clockwise order, are seated in a circle. Fresh Mann has 100 erasers, and he wants to distribute them to the students, albeit unfairly. Starting with person $ 1$ and proceeding counter-clockwise, Fresh Mann gives $i$ erasers to student $i$; for example, he gives $ 1$ eraser to student $ 1$, then $2$ erasers to student $2$, et cetera. He continues around the circle until he does not have enough erasers to give to the next person. At this point, determine the number of erasers that Fresh Mann has. [b]p3.[/b] Let $ABC$ be a triangle with $AB = AC = 17$ and $BC = 24$. Approximate $\angle ABC$ to the nearest multiple of $10$ degrees. [b]p4.[/b] Define a sequence of rational numbers $\{x_n\}$ by $x_1 =\frac35$ and for $n \ge 1$, $x_{n+1} = 2 - \frac{1}{x_n}$ . Compute the product $x_1x_2x_3... x_{2013}$. [b]p5.[/b] In equilateral triangle $ABC$, points $P$ and $R$ lie on segment $AB$, points $I$ and $M$ lie on segment $BC$, and points $E$ and $S$ lie on segment $CA$ such that $PRIMES$ is a equiangular hexagon. Given that $AB = 11$, $PR = 2$, $IM = 3$, and $ES = 5$, compute the area of hexagon $PRIMES$. [b]p6.[/b] Let $f(a, b) = \frac{a^2}{a+b}$ . Let $A$ denote the sum of $f(i, j)$ over all pairs of integers $(i, j)$ with $1 \le i < j \le 10$; that is, $$A = (f(1, 2) + f(1, 3) + ...+ f(1, 10)) + (f(2, 3) + f(2, 4) +... + f(2, 10)) +... + f(9, 10).$$ Similarly, let $B$ denote the sum of $f(i, j)$ over all pairs of integers $(i, j)$ with $1 \le j < i \le 10$, that is, $$B = (f(2, 1) + f(3, 1) + ... + f(10, 1)) + (f(3, 2) + f(4, 2) +... + f(10, 2)) +... + f(10, 9).$$ Compute $B - A$. [b]p7.[/b] Fresh Mann has a pile of seven rocks with weights $1, 1, 2, 4, 8, 16$, and $32$ pounds and some integer X between $1$ and $64$, inclusive. He would like to choose a set of the rocks whose total weight is exactly $X$ pounds. Given that he can do so in more than one way, determine the sum of all possible values of $X$. (The two $1$-pound rocks are indistinguishable.) [b]p8.[/b] Let $ABCD$ be a convex quadrilateral with $AB = BC = CA$. Suppose that point $P$ lies inside the quadrilateral with $AP = PD = DA$ and $\angle PCD = 30^o$. Given that $CP = 2$ and $CD = 3$, compute $CA$. [b]p9.[/b] Define a sequence of rational numbers $\{x_n\}$ by $x_1 = 2$, $x_2 = \frac{13}{2}$ , and for $n \ge 1$, $x_{n+2} = 3 -\frac{3}{x_{n+1}}+\frac{1}{x_nx_{n+1}}$. Compute $x_{100}$. [b]p10.[/b] Ten prisoners are standing in a line. A prison guard wants to place a hat on each prisoner. He has two colors of hats, red and blue, and he has $10$ hats of each color. Determine the number of ways in which the prison guard can place hats such that among any set of consecutive prisoners, the number of prisoners with red hats and the number of prisoners with blue hats differ by at most $2$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$, then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$.

Find the number of positive integers $n$ less than $2017$ such that \[ 1+n+\frac{n^2}{2!}+\frac{n^3}{3!}+\frac{n^4}{4!}+\frac{n^5}{5!}+\frac{n^6}{6!} \] is an integer.

A function $f$ from the positive integers to the positive integers is called [i]Canadian[/i] if it satisfies $$\gcd\left(f(f(x)), f(x+y)\right)=\gcd(x, y)$$ for all pairs of positive integers $x$ and $y$. Find all positive integers $m$ such that $f(m)=m$ for all Canadian functions $f$.

Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

A sequence of real numbers $\{a_n\}_n$ is called a [i]bs[/i] sequence if $a_n = |a_{n+1} - a_{n+2}|$, for all $n\geq 0$. Prove that a bs sequence is bounded if and only if the function $f$ given by $f(n,k)=a_na_k(a_n-a_k)$, for all $n,k\geq 0$ is the null function. [i]Mihai Baluna - ISL 2004[/i]

The following light grid is given: \begin{tabular}{cccc} o & o & o & o \\ o & o & o & o \\ o & o & o & o \\ o & o & o & o \end{tabular} where `o` represents a switched-off light and `•` represents a switched-on light. Each time a light is pressed, it toggles its state (on/off) as well as the state of its four adjacent neighbors (left, right, above, below). The bottom edge lights are considered to be immediately above the top edge lights, and the same applies to the lateral edges.The right figure illustrates the effect of pressing a light in a corner. Pressing a certain combination of lights results in all lights turning on. Prove that all lights must have been pressed at least once.

Find all real solutions to the system of equations $$\begin{cases} x^2 +y^2 = 6z \\ y^2 +z^2 = 6x \\ z^2 +x^2 = 6y \end{cases}$$

Let $N>1$ and let $a_1,a_2,\dots,a_N$ be nonnegative reals with sum at most $500$. Prove that there exist integers $k\ge 1$ and $1=n_0<n_1<\dots<n_k=N$ such that \[\sum_{i=1}^k n_ia_{n_{i-1}}<2005.\]

Find all triplets $(x, y, z)$ of real numbers for which $$\begin{cases}x^2- yz = |y-z| +1 \\ y^2 - zx = |z-x| +1 \\ z^2 -xy = |x-y| + 1 \end{cases}$$

Let $(a_i,b_i)$ be pairwise distinct pairs of positive integers for $1\le i\le n$. Prove that \[(a_1+a_2+\ldots+a_n)(b_1+b_2+\ldots+b_n)>\frac29 n^3,\] and show that the statement is sharp, i.e. for an arbitrary $c>\frac29$ it is possible that \[(a_1+a_2+\ldots+a_n)(b_1+b_2+\ldots+b_n)<cn^3.\] [i]Submitted by Péter Pál Pach, Budapest, based on an OKTV problem[/i]

Let a constant $\alpha$ as $0<\alpha<1$, prove that: $(1)$ There exist a constant $C(\alpha)$ which is only depend on $\alpha$ such that for every $x\ge 0$, $\ln(1+x)\le C(\alpha)x^\alpha$. $(2)$ For every two complex numbers $z_1,z_2$, $|\ln|\frac{z_1}{z_2}||\le C(\alpha)\left(|\frac{z_1-z_2}{z_2}|^\alpha+|\frac{z_2-z_1}{z_1}|^\alpha\right)$.

Let $P(x)$ be a polynomial such that $P(x^2 - 1) = x^4 - 3x^2 + 3$. Find $P(x^2 + 1)$.

Let $P$ be a polynomial with real coefficients. Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that there exists a real number $t$ such that \[f(x+t) - f(x) = P(x)\] for all $x \in \mathbb{R}$.

Let $x_1 , \dots , x_{2024}$ be non negative real numbers with $\displaystyle{\sum_{i=1}^{2024}}x_i = 1$. Find, with proof, the minimum and maximum possible values of the following expression \[\sum_{i=1}^{1012} x_i + \sum_{i=1013}^{2024} x_i^2 .\]

a) For integer $n \ge 3$, suppose that $0 < a_1 < a_2 < ...< a_n$ is a arithmetic sequence and $0 < b_1 < b_2 < ... < b_n$ is a geometric sequence with $a_1 = b_1, a_n = b_n$. Prove that a_k > b_k for all $k = 2,3,..., n -1$. b) Prove that for every positive integer $n \ge 3$, there exist an integer arithmetic sequence $(a_n)$ and an integer geometric sequence $(b_n)$ such that $0 < b_1 < a_1 < b_2 < a_2 < ... < b_n < a_n$.

Let $ (b_0,b_1,b_2,b_3)$ be a permutation of the set $ \{54,72,36,108\}$. Prove that $ x^5\plus{}b_3x^3\plus{}b_2x^2\plus{}b_1x\plus{}b_0$ is irreducible in $ \mathbb Z[x]$.

Let $M = \{1, 2, \ldots, n\}$ and $\phi : M \to M$ be a bijection. (i) Prove that there exist bijections $\phi_1, \phi_2 : M \to M$ such that $\phi_1 \cdot \phi_2 = \phi , \phi_1^2 =\phi_2^2=E$, where $E$ is the identity mapping. (ii) Prove that the conclusion in (i) is also true if $M$ is the set of all positive integers.

Let $f(x)$ be a polynomial with integer co-efficients. Assume that $3$ divides the value $f(n)$ for each integer $n$. Prove that when $f(x)$ is divided by $x^3-x$ , the remainder is of the form $3r(x)$ where $r(x)$ is a polynomial with integer coefficients.

Find all values ​​of the real parameter $a$, for which the equation $(x -6\sqrt{x} + 8)\cdot \sqrt{x- a} = 0$ has exactly two distinct real solutions.

The equation $x^3+px+q=0$ has three distinct real roots. Show that $p<0$

Let $\mathbb{R^+}$ denote the set of all positive real numbers. Find all functions $f: \mathbb{R^+}\rightarrow \mathbb{R^+}$ such that $$xf(x + y) + f(xf(y) + 1) = f(xf(x))$$ for all $x, y \in\mathbb{R^+}.$ [i]Proposed by Amadej Kristjan Kocbek, Jakob Jurij Snoj[/i]