Which are there more of among the natural numbers from 1 to 1000000, inclusive: numbers that can be represented as the sum of a perfect square and a (positive) perfect cube, or numbers that cannot be? [i]A. Golovanov[/i]

Let $m$ and $n$ denote integers greater than $1$, and let $\nu (n)$ be the number of primes less than or equal to $n$. Show that if the equation $\frac{n}{\nu(n)}=m$ has a solution, then so does the equation $\frac{n}{\nu(n)}=m-1$.

Solve equation $\frac{1}{x}-\frac{1}{y}=\frac{1}{5}-\frac{1}{xy}$, where $x$ and $y$ are positive integers.

In triangle $ABC$, let $\omega$ be the excircle opposite to $A$. Let $D, E$ and $F$ be the points where $\omega$ is tangent to $BC, CA$, and $AB$, respectively. The circle $AEF$ intersects line $BC$ at $P$ and $Q$. Let $M$ be the midpoint of $AD$. Prove that the circle $MPQ$ is tangent to $\omega$.

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [b]R1.[/b] What is $11^2 - 9^2$? [b]R2.[/b] Write $\frac{9}{15}$ as a decimal. [b]R3.[/b] A $90^o$ sector of a circle is shaded, as shown below. What percent of the circle is shaded? [b]R4.[/b] A fair coin is flipped twice. What is the probability that the results of the two flips are different? [b]R5.[/b] Wayne Dodson has $55$ pounds of tungsten. If each ounce of tungsten is worth $75$ cents, and there are $16$ ounces in a pound, how much money, in dollars, is Wayne Dodson’s tungsten worth? [b]R6.[/b] Tenley Towne has a collection of $28$ sticks. With these $28$ sticks he can build a tower that has $1$ stick in the top row, $2$ in the next row, and so on. Let $n$ be the largest number of rows that Tenley Towne’s tower can have. What is n? [b]R7.[/b] What is the sum of the four smallest primes? [b]R8 / P1.[/b] Let $ABC$ be an isosceles triangle such that $\angle B = 42^o$. What is the sum of all possible degree measures of angle $A$? [b]R9.[/b] Consider a line passing through $(0, 0)$ and $(4, 8)$. This line passes through the point $(2, a)$. What is the value of $a$? [b]R10 / P2.[/b] Brian and Stan are playing a game. In this game, Brian rolls a fair six-sided die, while Stan rolls a fair four-sided die. Neither person shows the other what number they rolled. Brian tells Stan, “The number I rolled is guaranteed to be higher than the number you rolled.” Stan now has to guess Brian’s number. If Stan plays optimally, what is the probability that Stan correctly guesses the number that Brian rolled? [b]R11.[/b] Guang chooses $4$ distinct integers between $0$ and $9$, inclusive. How many ways can he choose the integers such that every pair of chosen integers sums up to an even number? [b]R12 / P4.[/b] David is trying to write a problem for MBMT. He assigns degree measures to every interior angle in a convex $n$-gon, and it so happens that every angle he assigned is less than $144$ degrees. He tells Pratik the value of $n$ and the degree measures in the $n$-gon, and to David’s dismay, Pratik claims that such an $n$-gon does not exist. What is the smallest value of $n \ge 3$ such that Pratik’s claim is necessarily true? [b]R13 / P3.[/b] Consider a triangle $ABC$ with side lengths of $5$, $5$, and $2\sqrt5$. There exists a triangle with side lengths of $5, 5$, and $x$ ($x \ne 2\sqrt5$) which has the same area as $ABC$. What is the value of $x$? [b]R14 / P5.[/b] A mother has $11$ identical apples and $9$ identical bananas to distribute among her $3$ kids. In how many ways can the fruits be allocated so that each child gets at least one apple and one banana? [b]R15 / P7.[/b] Find the sum of the five smallest positive integers that cannot be represented as the sum of two not necessarily distinct primes. [b]P6.[/b] Srinivasa Ramanujan has the polynomial $P(x) = x^5 - 3x^4 - 5x^3 + 15x^2 + 4x - 12$. His friend Hardy tells him that $3$ is one of the roots of $P(x)$. What is the sum of the other roots of $P(x)$? [b]P8.[/b] $ABC$ is an equilateral triangle with side length $10$. Let $P$ be a point which lies on ray $\overrightarrow{BC}$ such that $PB = 20$. Compute the ratio $\frac{PA}{PC}$. [b]P9.[/b] Let $ABC$ be a triangle such that $AB = 10$, $BC = 14$, and $AC = 6$. The median $CD$ and angle bisector $CE$ are both drawn to side $AB$. What is the ratio of the area of triangle $CDE$ to the area of triangle $ABC$? [b]P10.[/b] Find all integer values of $x$ between $0$ and $2017$ inclusive, which satisfy $$2016x^{2017} + 990x^{2016} + 2x + 17 \equiv 0 \,\,\, (mod \,\,\, 2017).$$ [b]P11.[/b] Let $x^2 + ax + b$ be a quadratic polynomial with positive integer roots such that $a^2 - 2b = 97$. Compute $a + b$. [b]P12.[/b] Let $S$ be the set $\{2, 3, ... , 14\}$. We assign a distinct number from $S$ to each side of a six-sided die. We say a numbering is predictable if prime numbers are always opposite prime numbers and composite numbers are always opposite composite numbers. How many predictable numberings are there? (Rotations of a die are not distinct) [b]P13.[/b] In triangle $ABC$, $AB = 10$, $BC = 21$, and $AC = 17$. $D$ is the foot of the altitude from $A$ to $BC$, $E$ is the foot of the altitude from $D$ to $AB$, and $F$ is the foot of the altitude from $D$ to $AC$. Find the area of the smallest circle that contains the quadrilateral $AEDF$. [b]P14.[/b] What is the greatest distance between any two points on the graph of $3x^2 + 4y^2 + z^2 - 12x + 8y + 6z = -11$? [b]P15.[/b] For a positive integer $n$, $\tau (n)$ is defined to be the number of positive divisors of $n$. Given this information, find the largest positive integer $n$ less than $1000$ such that $$\sum_{d|n} \tau (d) = 108.$$ In other words, we take the sum of $\tau (d)$ for every positive divisor $d$ of $n$, which has to be $108$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If the solutions of the equation $x^2+px+q=0$ are the cubes of the solutions of the equation $x^2+mx+n=0$, then $\textbf{(A) }p=m^3+3mn\qquad\textbf{(B) }p=m^3-3mn\qquad$ $\textbf{(C) }p+q=m^3\qquad\textbf{(D) }\left(\frac{m}{n}\right)^2=\frac{p}{q}\qquad \textbf{(E) }\text{none of these}$

Let $ABC$ be a triangle such that $\angle ABC = 90 ^{\circ}$. Let $I$ be an incenter of $ABC$ and let $F$, $D$ and $E$ be points where incircle touches sides $AB$, $BC$ and $AC$, respectively. If lines $CI$ and $EF$ intersect at point $M$ and if $DM$ and $AB$ intersect in $N$, prove that $AI=ND$

Consider $A\in \mathcal{M}_{2020}(\mathbb{C})$ such that $$ (1)\begin{cases} A+A^{\times} =I_{2020},\\ A\cdot A^{\times} =I_{2020},\\ \end{cases} $$ where $A^{\times}$ is the adjugate matrix of $A$, i.e., the matrix whose elements are $a_{ij}=(-1)^{i+j}d_{ji}$, where $d_{ji}$ is the determinant obtained from $A$, eliminating the line $j$ and the column $i$. Find the maximum number of matrices verifying $(1)$ such that any two of them are not similar.

The total in-store price for an appliance is $\$99.99$. A television commercial advertises the same product for three easy payments of $\$29.98$ and a one-time shipping and handling charge of $\$9.98$. How much is saved by buying the appliance from the television advertiser? $\textbf{(A)}\ \text{6 cents} \qquad \textbf{(B)}\ \text{7 cents} \qquad \textbf{(C)}\ \text{8 cents} \qquad \textbf{(D)}\ \text{9 cents} \qquad \textbf{(E)}\ \text{10 cents}$

Let $a,b$ and $c$ be positive real numbers . Prove that\[\left | \frac{4(b^3-c^3)}{b+c}+ \frac{4(c^3-a^3)}{c+a}+ \frac{4(a^3-b^3)}{a+b} \right |\leq (b-c)^2+(c-a)^2+(a-b)^2.\]

Determine all functions $f:\Bbb{R}\to\Bbb{R}$ such that \[ f(x^2 + f(y)) = (f(x) + y^2)^ 2 \] , for all $x,y\in \Bbb{R}.$

Given is cyclic quadrilateral $ABCD$ with∠$A = 3$∠$B$. On the $AB$ side is chosen point $C_1$, and on side $BC$ - point $A_1$ so that $AA_1 = AC = CC_1$. Prove that $3A_1C_1>BD$.

Let $O,H$ be the circumcenter and orthocenter of $\triangle ABC,$ respectively. Line $AH$ and $BC$ intersect at $D,$ Line $BH$ and $AC$ intersect at $E,$ Line $CH$ and $AB$ intersect at $F,$ Line $AB$ and $ED$ intersect at $M,$ $AC$ and $FD$ intersect at $N.$ Prove that $(1)OB\perp DF,OC\perp DE;$ $(2)OH\perp MN.$

Consider a composition of functions $\sin, \cos, \tan, \cot, \arcsin, \arccos, \arctan, \arccos$, applied to the number $1$. Each function may be applied arbitrarily many times and in any order. (ex: $\sin \cos \arcsin \cos \sin\cdots 1$). Can one obtain the number $2010$ in this way?

Define a domino to be a $1\times 2$ rectangular block. A $2023\times 2023$ square grid is filled with non-overlapping dominoes, leaving a single $1\times 1$ gap. John then repeatedly slides dominoes into the gap; each domino is moved at most once. What is the maximum number of times that John could have moved a domino? (Example: In the $3\times 3$ grid shown below, John could move 2 dominoes: $D$, followed by $A$.) [asy] unitsize(18); draw((0,0)--(3,0)--(3,3)--(0,3)--(0,0)--cycle); draw((0,1)--(3,1)); draw((2,0)--(2,3)); draw((1,1)--(1,3)); label("A",(0.5,2)); label("B",(1.5,2)); label("C",(2.5,2)); label("D",(1,0.5)); [/asy]

Let $m,n$ be natural numbers and let $d = gcd(m,n)$. Let $x = 2^{m} -1$ and $y= 2^n +1$ (a) If $\frac{m}{d}$ is odd, prove that $gcd(x,y) = 1$ (b) If $\frac{m}{d}$ is even, Find $gcd(x,y)$

In regular hexagon $ABCDEF$ with side length $2$, let $P$, $Q$, $R$, and $S$ be the feet of the altitudes from $A$ to $BC$, $EF$, $CF$, and $BE$, respectively. Find the area of quadrilateral $PQRS$.

Arnav is placing three rectangles into a $3 \times 3$ grid of unit squares. He has a $1\times 3$ rectangle, a $1\times 2$ rectangle, and a $1\times 1$ rectangle. He must place the rectangles onto the grid such that the edges of the rectangles align with the gridlines of the grid. If he is allowed to rotate the rectangles, how many ways can he place the three rectangles into the grid, without overlap? [i]Proposed by William Yue[/i]

Nickolas and Peter divide $2n+1$ nuts amongst each other. Both of them want to get as many as possible. Three methods are suggested to them for doing so, each consisting of three stages. The first two stages are the same in all three methods: [i]Stage 1:[/i] Peter divides the nuts into 2 heaps, each containing at least 2 nuts. [i]Stage 2:[/i] Nickolas divides both heaps into 2 heaps, each containing at least 1 nut. Finally, stage 3 varies among the three methods as follows: [i]Method 1:[/i] Nickolas takes the smallest and largest of the heaps. [i]Method 2:[/i] Nickolas takes the two middle size heaps. [i]Method 3:[/i] Nickolas chooses between taking the biggest and the smallest heap or the two middle size heaps, but gives one nut to Peter for the right of choice. Determine the most and the least profitable method for Nickolas.

Two circles $\omega_1(O)$ and $\omega_2$ intersect each other at $A,B$ ,and $O$ lies on $\omega_2$. Let $S$ be a point on $AB$ such that $OS\perp AB$. Line $OS$ intersects $\omega_2$  at $P$ (other than $O$). The bisector of $\hat{ASP}$ intersects  $\omega_1$ at $L$ ($A$ and $L$ are on the same side of the line $OP$). Let $K$ be a point on $\omega_2$ such that $PS=PK$ ($A$ and $K$ are on the same side of the line $OP$). Prove that $SL=KL$. [i]Proposed by Ali Zamani [/i]

(a) Prove that the number of all digits in the sequence $1, 2, 3,... , 10^8$ is equal to the number of all zeros in the sequence $1, 2, 3, ... , 10^9$. (b) Prove that the number of all digits in the sequence $1, 2, 3, ... , 10^k$ is equal to the number of all zeros in the sequence $1, 2, 3, ... , 10^{k+1}$.

1. If five fair coins are flipped simultaneously, what is the probability that at least three of them show heads? 2. How many perfect squares divide $10^{10}$? 3. Evaluate $\frac{2016!^2}{2015!2017!}$ . Here $n!$ denotes $1 \times 2 \times \ldots \times n$.

Inside triangle $ABC$ there is a chosen point $P$. The rays $AP$, $BP$, $CP$ intersect the boundary of the triangle in the points $A'$, $B'$, $C'$ respectively. Set $u = |AP| : |PA'|, v = |BP| : |PB'|, w = |CP| : |PC'|$. Express the product $uvw$ in terms of the sum $u + v + w$.

Let $P$ be a non-selfintersecting closed polygon with $n$ sides. Let its vertices be $P_1 , P_2 ,\ldots, P_n .$ Let $m$ other points,$Q_1 , Q_2 ,\ldots, Q_m $ , interior to $P$, be given. Let the figure be triangulated. This means that certain pairs of the $(n+m)$ points $P_1 ,\ldots , Q_m$ are connected by line segments such that (i) the resulting figure consists exclusively of a set $T$ of triangles, (ii) if two different triangles in $T$ have more than a vertex in common then they have exactly a side in common, and (iii) the set of vertices of the triangles in $T$ is precisely the set of the $(n+m)$ points $P_1 ,\ldots , Q_m.$ How many triangles are in $T$?

Consider an acute non-isosceles triangle. In a single step it is allowed to cut any one of the available triangles into two triangles along its median. Is it possible that after a finite number of cuttings all triangles will be isosceles? [i]Proposed by E. Bakaev[/i]