Reduce $$\frac{2}{\sqrt{4-3\sqrt[4]{5} + 2\sqrt[4]{25}-\sqrt[4]{125}}}$$ to its lowest form. Then generalize this result and show that it holds for any positive $n$.

Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.

The triangle $ABC$ is right-angled at $A$. Its incentre is $I$, and $H$ is the foot of the perpendicular from $I$ on $AB$. The perpendicular from $H$ on $BC$ meets $BC$ at $E$, and it meets the bisector of $\angle ABC$ at $D$. The perpendicular from $A$ on $BC$ meets $BC$ at $F$. Prove that $\angle EFD = 45^o$

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]R4.16 / P1.4[/b] Adam and Becky are building a house. Becky works twice as fast as Adam does, and they both work at constant speeds for the same amount of time each day. They plan to finish building in $6$ days. However, after $2$ days, their friend Charlie also helps with building the house. Because of this, they finish building in just $5$ days. What fraction of the house did Adam build? [b]R4.17[/b] A bag with $10$ items contains both pencils and pens. Kanye randomly chooses two items from the bag, with replacement. Suppose the probability that he chooses $1$ pen and $1$ pencil is $\frac{21}{50}$ . What are all possible values for the number of pens in the bag? [b]R4.18 / P2.8[/b] In cyclic quadrilateral $ABCD$, $\angle ABD = 40^o$, and $\angle DAC = 40^o$. Compute the measure of $\angle ADC$ in degrees. (In cyclic quadrilaterals, opposite angles sum up to $180^o$.) [b]R4.19 / P2.6[/b] There is a strange random number generator which always returns a positive integer between $1$ and $7500$, inclusive. Half of the time, it returns a uniformly random positive integer multiple of $25$, and the other half of the time, it returns a uniformly random positive integer that isn’t a multiple of $25$. What is the probability that a number returned from the generator is a multiple of $30$? [b]R4.20 / P2.7[/b] Julia is shopping for clothes. She finds $T$ different tops and $S$ different skirts that she likes, where $T \ge S > 0$. Julia can either get one top and one skirt, just one top, or just one skirt. If there are $50$ ways in which she can make her choice, what is $T - S$? [u]Set 5[/u] [b]R5.21[/b] A $5 \times 5 \times 5$ cube’s surface is completely painted blue. The cube is then completely split into $ 1 \times 1 \times 1$ cubes. What is the average number of blue faces on each $ 1 \times 1 \times 1$ cube? [b]R5.22 / P2.10[/b] Find the number of values of $n$ such that a regular $n$-gon has interior angles with integer degree measures. [b]R5.23[/b] $4$ positive integers form an geometric sequence. The sum of the $4$ numbers is $255$, and the average of the second and the fourth number is $102$. What is the smallest number in the sequence? [b]R5.24[/b] Let $S$ be the set of all positive integers which have three digits when written in base $2016$ and two digits when written in base $2017$. Find the size of $S$. [b]R5.25 / P3.12[/b] In square $ABCD$ with side length $13$, point $E$ lies on segment $CD$. Segment $AE$ divides $ABCD$ into triangle $ADE$ and quadrilateral $ABCE$. If the ratio of the area of $ADE$ to the area of $ABCE$ is $4 : 11$, what is the ratio of the perimeter of $ADE$ to the perimeter of $ABCE$? [u]Set 6[/u] [b]R6.26 / P6.25[/b] Submit a decimal n to the nearest thousandth between $0$ and $200$. Your score will be $\min (12, S)$, where $S$ is the non-negative difference between $n$ and the largest number less than or equal to $n$ chosen by another team (if you choose the smallest number, $S = n$). For example, 1.414 is an acceptable answer, while $\sqrt2$ and $1.4142$ are not. [b]R6.27 / P6.27[/b] Guang is going hard on his YNA project. From $1:00$ AM Saturday to $1:00$ AM Sunday, the probability that he is not finished with his project $x$ hours after $1:00$ AM on Saturday is $\frac{1}{x+1}$ . If Guang does not finish by 1:00 AM on Sunday, he will stop procrastinating and finish the project immediately. Find the expected number of minutes $A$ it will take for him to finish his project. An estimate of $E$ will earn $12 \cdot 2^{-|E-A|/60}$ points. [b]R6.28 / P6.28[/b] All the diagonals of a regular $100$-gon (a regular polygon with $100$ sides) are drawn. Let $A$ be the number of distinct intersection points between all the diagonals. Find $A$. An estimate of $E$ will earn $12 \cdot \left(16 \log_{10}\left(\max \left(\frac{E}{A},\frac{A}{E}\right)\right)+ 1\right)^{-\frac12}$ or $0$ points if this expression is undefined. [b]R6.29 / P6.29 [/b]Find the smallest positive integer $A$ such that the following is true: if every integer $1, 2, ..., A$ is colored either red or blue, then no matter how they are colored, there are always 6 integers among them forming an increasing arithmetic progression that are all colored the same color. An estimate of $E$ will earn $12 min \left(\frac{E}{A},\frac{A}{E}\right)$ points or $0$ points if this expression is undefined. [b]R6.30 / P6.30[/b] For all integers $n \ge 2$, let $f(n)$ denote the smallest prime factor of $n$. Find $A =\sum^{10^6}_{n=2}f(n)$. In other words, take the smallest prime factor of every integer from $2$ to $10^6$ and sum them all up to get $A$. You may find the following values helpful: there are $78498$ primes below $10^6$, $9592$ primes below $10^5$, $1229$ primes below $10^4$, and $168$ primes below $10^3$. An estimate of $E$ will earn $\max \left(0, 12-4 \log_{10}(max \left(\frac{E}{A},\frac{A}{E}\right)\right)$ or $0$ points if this expression is undefined. PS. You should use hide for answers. R1-15 /P1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2786721p24495629]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p = 2017$ be a prime and $\mathbb{F}_p$ be the integers modulo $p$. A function $f: \mathbb{Z}\rightarrow\mathbb{F}_p$ is called [i]good[/i] if there is $\alpha\in\mathbb{F}_p$ with $\alpha\not\equiv 0\pmod{p}$ such that \[f(x)f(y) = f(x + y) + \alpha^y f(x - y)\pmod{p}\] for all $x, y\in\mathbb{Z}$. How many good functions are there that are periodic with minimal period $2016$? [i]Ashwin Sah[/i]

If reals $x, y, z $ satises $tan x + tan y + tan z = 2$ and $0 < x, y,z < \frac{\pi}{2}.$ Prove that $$sin^2 x + sin^2 y + sin^2 z < 1.$$

Is it possible to fill the cells of a table of size $2019\times2019$ with pairwise distinct positive integers in such a way that in each rectangle of size $1\times2$ or $2\times1$ the larger number is divisible by the smaller one, and the ratio of the largest number in the table to the smallest one is at most $2019?$

Calculate the following indefinite integrals. [1] $\int (2x+1)\sqrt{x+2}\ dx$ [2] $\int \frac{1+\cos x}{x+\sin x}\ dx$ [3] $\int \sin ^ 5 x \cos ^ 3 x \ dx$ [4] $\int \frac{(x-3)^2}{x^4}\ dx$ [5] $\int \frac{dx}{\tan x}\ dx$

In how many ways you can pay $2015\$$ using bills of $1\$$, $10\$$, $100\$$ and $200\$$

A $(2^n - 1) \times (2^n +1)$ board is to be divided into rectangles with sides parallel to the sides of the board and integer side lengths such that the area of each rectangle is a power of 2. Find the minimum number of rectangles that the board may be divided into.

[b]a)[/b] Does there exist an infinite subset $S$ of the natural numbers, such that $S\neq \mathbb{N}$, and such that for each natural number $n\not \in S$, exactly $n$ members of $S$ are coprime with $n$? [b]b)[/b] Does there exist an infinite subset $S$ of the natural numbers, such that for each natural number $n\in S$, exactly $n$ members of $S$ are coprime with $n$? [i]Proposed by Morteza Saghafian[/i]

Arnim and Brentano have a little vase with $1500$ candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat $7$ candies or take $6$ candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?

Let $m \ge 2$ be an integer. Find the smallest integer $n>m$ such that for any partition of the set $\{m,m+1,\cdots,n\}$ into two subsets, at least one subset contains three numbers $a, b, c$ such that $c=a^{b}$.

On the sides of a triangle $ABC$ right angled at $A$ three points $D, E$ and $F$ (respectively $BC, AC$ and $AB$) are chosen so that the quadrilateral $AFDE$ is a square. If $x$ is the length of the side of the square, show that \[\frac{1}{x}=\frac{1}{AB}+\frac{1}{AC}\]

Let $P$ be an interior point of acute triangle $\Delta ABC$, which is different from the orthocenter. Let $D$ and $E$ be the feet of altitudes from $A$ to $BP$ and $CP$, and let $F$ and $G$ be the feet of the altitudes from $P$ to sides $AB$ and $AC$. Denote by $X$ the midpoint of $[AP]$, and let the second intersection of the circumcircles of triangles $\Delta DFX$ and $\Delta EGX$ lie on $BC$. Prove that $AP$ is perpendicular to $BC$ or $\angle PBA = \angle PCA$.

Prove that in a tournament with 799 teams, there exist 14 teams, that can be partitioned into groups in a way that all of the teams in the first group have won all of the teams in the second group.

Prove that the equation \[ x^n + 1 = y^{n+1}, \] where $n$ is a positive integer not smaller then 2, has no positive integer solutions in $x$ and $y$ for which $x$ and $n+1$ are relatively prime.

Let $a, b, c$ be positive reals. Prove that $$\left(\frac{a}{a+b}\right)^2+\left(\frac{b}{b+c}\right)^2+\left(\frac{c}{c+a}\right)^2\ge \frac34$$

(a) Let $u$ and $v$ be two nilpotent elements in a commutative ring (with or without unity). Prove that $u+v$ is also nilpotent. (b) Show an example of a (non-commutative) ring $R$ and nilpotent elements $u,v\in R$ such that $u+v$ is not nilpotent.

Let $ a, b, c, r,$ and $ s$ be real numbers. Show that if $ r$ is a root of $ ax^2\plus{}bx\plus{}c \equal{} 0$ and s is a root of $ \minus{}ax^2\plus{}bx\plus{}c \equal{} 0,$ then \[ \frac{a}{2} x^2 \plus{} bx \plus{} c \equal{} 0\] has a root between $ r$ and $ s.$

A sequence $a_1, a_2, a_3, . . . , a_{100}$ of $100$ (not necessarily distinct) positive numbers satisfy that the$ 99$ fractions$$\frac{a_1}{a_2},\frac{a_2}{a_3},\frac{a3}{a_4}, ... ,\frac{a_{99}}{a_{100}}$$ are all distinct. How many distinct numbers must there be, at least, in the sequence $a_1, a_2, a_3, . . . , a_{100}$?

Let $S_1$ be the area of the regular pentagon $ABCDE$. And let $S_2$ be the area of the regular pentagon whose sides lie on the lines $AC, CE, EB, BD, DA$. What is values of $\frac{S_1}{S_2}$ ? $\textbf{(A)}\ \frac{41}{6} \qquad\textbf{(B)}\ \frac{3+5\sqrt5}{2} \qquad\textbf{(C)}\ 4+\sqrt5 \qquad\textbf{(D)}\ \frac{7+3\sqrt5}2 \qquad\textbf{(E)}\ \text{None}$

Let sequences of real numbers $(x_n)$ and $(y_n)$ satisfy $x_1 = y_1 = 1$ and $x_{n+1} =\frac{x_n + 2}{x_n + 1}$ and $y_{n+1} = \frac{y_n^2 + 2}{2y_n}$ for $n = 1,2, ...$ Prove that $y_{n+1} = x_{2^n}$ holds for $n =0, 1,2, ... $

Show that: 1) If $2n-1$ is a prime number, then for any $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, there exists $i, j \in \{1, 2, \ldots , n\}$ such that \[\frac{a_i+a_j}{(a_i,a_j)} \geq 2n-1\] 2) If $2n-1$ is a composite number, then there exists $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, such that for any $i, j \in \{1, 2, \ldots , n\}$ we have \[\frac{a_i+a_j}{(a_i,a_j)} < 2n-1\] Here $(x,y)$ denotes the greatest common divisor of $x,y$.

On a highway, a pedestrian and a cyclist were going in the same direction, while a cart and a car were coming from the opposite direction. All were travelling at different constant speeds. The cyclist caught up with the pedestrian at $10$ o'clock. After a time interval, she met the cart, and after another time interval equal to the first, she met the car. After a third time interval, the car met the pedestrian, and after another time interval equal to the third, the car caught up with the cart. If the pedestrian met the car at $11$ o'clock, when did he meet the cart?