A group of clerks is assigned the task of sorting $1775$ files. Each clerk sorts at a constant rate of $30$ files per hour. At the end of the first hour, some of the clerks are reassigned to another task; at the end of the second hour, the same number of the remaining clerks are also reassigned to another task, and a similar reassignment occurs at the end of the third hour. The group finishes the sorting in $3$ hours and $10$ minutes. Find the number of files sorted during the first one and a half hours of sorting.

Find all positive integers $n$ for which $n^{n-1} - 1$ is divisible by $2^{2015}$, but not by $2^{2016}$.

Find the largest natural number $n$ for which the product of the numbers $n, n+1, n+2, \ldots, n+20$ is divisible by the square of one of them.

Find all positive integers $n$ with the following property: There are only a finite number of positive multiples of $n$ that have exactly $n$ positive divisors.

[b]p1.[/b] Replace $*$’s by an arithmetic operations (addition, subtraction, multiplication or division) to obtain true equality $$2*0*1*6*7=1.$$ [b]p2.[/b] The interval of length $88$ cm is divided into three unequal parts. The distance between middle points of the left and right parts is $46$ cm. Find the length of the middle part. [b]p3.[/b] A $5\times 6$ rectangle is drawn on a square grid. Paint some cells of the rectangle in such a way that every $3\times 2$ sub‐rectangle has exactly two cells painted. [b]p4.[/b] There are $8$ similar coins. $5$ of them are counterfeit. A detector can analyze any set of coins and show if there are counterfeit coins in this set. The detector neither determines which coins nare counterfeit nor how many counterfeit coins are there. How to run the detector twice to find for sure at least one counterfeit coin? [b]p5.[/b] There is a set of $20$ weights of masses $1, 2, 3,...$ and $20$ grams. Can one divide this set into three groups of equal total masses? [b]p6.[/b] Replace letters $A,B,C,D,E,F,G$ by the digits $0,1,...,9$ to get true equality $AB+CD=EF * EG$ (different letters correspond to different digits, same letter means the same digit, $AB$, $CD$, $EF$, and $EG$ are two‐digit numbers). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

28. [b][15][/b] Find the shortest distance between the lines $\frac{x+2}{2}=\frac{y-1}{3}=\frac{z}{1}$ and $\frac{x-3}{-1}=\frac{y}{1}=\frac{z+1}{2}$ 29. [b][15][/b] Find the largest real number $k$ such that there exists a sequence of positive reals ${a_i}$ for which $\sum_{n=1}^{\infty}a_n$ converges but $\sum_{n=1}^{\infty}\frac{\sqrt{a_n}}{n^k}$ does not. 30. [b][15][/b] Find the largest integer $n$ such that the following holds: there exists a set of $n$ points in the plane such that, for any choice of three of them, some two are unit distance apart. 31. [b][17][/b] Two random points are chosen on a segment and the segment is divided at each of these two points. Of the three segments obtained, find the probability that the largest segment is more than three times longer than the smallest segment. 32. [b][17][/b] Find the sum of all positive integers $n\le 2015$ that can be expressed in the form $\left\lceil{\frac{x}{2}}\right \rceil +y+xy$, where $x$ and $y$ are positive integers. 33. [b][17][/b] How many ways are there to place four points in the plane such that the set of pairwise distances between the points consists of exactly $2$ elements? (Two configurations are the same if one can be obtained from the other via rotation and scaling.) 34. [b][20][/b] Let $n$ be the second smallest integer that can be written as the sum of two positive cubes in two different ways. Compute $n$. If your guess is $a$, you will receive $\max(25-5\cdot \max(\frac{a}{n},\frac{n}{a}),0)$, rounded up. 35. [b][20][/b] Let $n$ be the smallest positive integer such that any positive integer can be expressed as the sum of $n$ integer 2015th powers. Find $n$. If your answer is $a$, your score will be $\max(20-\frac{1}{5}|\log _{10} \frac{a}{n}|,0)$, rounded up. 36. [b][20][/b] Consider the following seven false conjectures with absurdly high counterexamples. Pick any subset of them, and list their labels in order of their smallest counterexample (the smallest $n$ for which the conjecture is false) from smallest to largest. For example, if you believe that the below list is already ordered by counterexample size, you should write ”PECRSGA”. - [b]P.[/b] (Polya’s conjecture) For any integer $n$, at least half of the natural numbers below $n$ have an odd number of prime factors. - [b]E.[/b] (Euler’s conjecture) There is no perfect cube $n$ that can be written as the sum of three positive cubes. - [b]C.[/b] (Cyclotomic) The polynomial with minimal degree whose roots are the primitive $n$th roots of unity has all coefficients equal to $-1$, $0$, or $1$. - [b]R.[/b] (Prime race) For any integer $n$, there are more primes below $n$ equal to $2(\mod 3)$ than there are equal to $1 (\mod 3)$. - [b]S.[/b] (Seventeen conjecture) For any integer $n$, $n^{17} + 9$ and $(n + 1)^{17} + 9$ are relatively prime. - [b]G.[/b] (Goldbach’s (other) conjecture) Any odd composite integer $n$ can be written as the sum of a prime and twice a square. - [b]A.[/b] (Average square) Let $a_1 = 1$ and $a_{k+1}=\frac{1+a_1^2+a_2^2+...+a_k^2}{k}$. Then $a_n$ is an integer for any n. If your answer is a list of $4\le n\le 7$ labels in the correct order, your score will be $(n-2)(n-3)$. Otherwise, your score will be $0$.

On a piece of paper, we write down all positive integers $n$ such that all proper divisors of $n$ are less than $30$. We know that the sum of all numbers on the paper having exactly one proper divisor is $2397$. What is the sum of all numbers on the paper having exactly two proper divisors? We say that $k$ is a proper divisor of the positive integer $n$ if $k | n$ and $1 < k < n$.

Let $n$ be a positive integer and $A$ a set of integers such that the set $\{x = a + b\ |\ a, b \in A\}$ contains $\{1^2, 2^2, \dots, n^2\}$. Prove that there is a positive integer $N$ such that if $n \ge N$, then $|A| > n^{0.666}$.

Let $a_1,a_2,\ldots, a_m$ be a set of $m$ distinct positive even numbers and $b_1,b_2,\ldots,b_n$ be a set of $n$ distinct positive odd numbers such that \[a_1+a_2+\cdots+a_m+b_1+b_2+\cdots+b_n=2019\] Prove that \[5m+12n\le 581.\]

Let $S$ be the set of all rational numbers $x \in [0, 1]$ with repeating base $6$ expansion $$x = 0.\overline{a_1a_2 ... a_k} = 0.a_1a_2...a_ka_1a_2...a_k...$$ for some finite sequence $\{a_i\}^{k}_{i=1}$ of distinct nonnegative integers less than $6$. What is the sum of all numbers that can be written in this form? (Put your answer in base $10$.)

Determine all pairs $(a, b)$ of integers having the following property: there is an integer $d \ge 2$ such that $a^n + b^n + 1$ is divisible by $d$ for all positive integers $n$.

Determine all triples $(a,b,c)$ of integers that simultaneously satisfy the following relations: \begin{align*} a^2 + a = b + c, \\ b^2 + b = a + c, \\ c^2 + c = a + b. \end{align*}

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

For each positive integer $n$ denote: \[n!=1\cdot 2\cdot 3\dots n\] Find all positive integers $n$ for which $1!+2!+3!+\cdots+n!$ is a perfect square.

The positive divisors of a positive integer $n$ are written in increasing order starting with 1. \[1=d_1<d_2<d_3<\cdots<n\] Find $n$ if it is known that: [b]i[/b]. $\, n=d_{13}+d_{14}+d_{15}$ [b]ii[/b]. $\,(d_5+1)^3=d_{15}+1$

I think we are allowed to discuss since its after 24 hours How do you do this Prove that $d(1)+d(3)+..+d(2n-1)\leq d(2)+d(4)+...d(2n)$ which $d(x)$ is the divisor function

Let $a$ be any positive integer. Prove that there exists a unique pair of positive integers $x$ and $y$ such that $$x +\frac12 (x + y - 1)(x + y- 2) = a.$$

Prove that an integer $n$ can be expressed as the sum of two squares if and only if $2n$ can be expressed as the sum of two squares.

Let $n$ be an odd positive integer greater than $2$, and consider a regular $n$-gon $\mathcal{G}$ in the plane centered at the origin. Let a [i]subpolygon[/i] $\mathcal{G}'$ be a polygon with at least $3$ vertices whose vertex set is a subset of that of $\mathcal{G}$. Say $\mathcal{G}'$ is [i]well-centered[/i] if its centroid is the origin. Also, say $\mathcal{G}'$ is [i]decomposable[/i] if its vertex set can be written as the disjoint union of regular polygons with at least $3$ vertices. Show that all well-centered subpolygons are decomposable if and only if $n$ has at most two distinct prime divisors.

The number $4$ has an odd number of odd positive divisors, namely $1$, and an even number of even positive divisors, namely $2$ and $4$. Is there a number with an odd number of even positive divisors and an even number of odd positive divisors?

Let $a$ and $b$ be positive integers such that (i) both $a$ and $b$ have at least two digits; (ii) $a + b$ is divisible by $10$; (iii) $a$ can be changed into $b$ by changing its last digit. Prove that the hundreds digit of the product $ab$ is even.

Compute the number of integer solutions $(x, y)$ to $xy - 18x - 35y = 1890$.

Let $n \geq 2$ be an integer such that $6^n + 11^n$ is divisible by $n$. Prove that $n^{100} + 6^n + 11^n$ is divisible by $17n$ and not divisible by $289n$.

Is it possible to pair up the numbers $0, 1, 2, 3,... , 61$ in such a way that when we sum each pair, the product of the $31$ numbers we get is a perfect f ifth power?

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]