Prove that $n^2 + 8n + 15$ is not divisible by $n + 4$ for any positive integer $n$.

One of Landau’s four unsolved problems asks whether there are infinitely many primes $p$ such that $p- 1$ is a perfect square. How many such primes are there less than $100$?

Find all $x;y\in\mathbb{Z}$ satisfying the following condition: $$x^3=y^4+9x^2$$

There exists infinitely many positive integers such that $a^3 + 1990b^3 = c^4$.

Find all integer solutions $(x,y)$ of the equation $y^2=x^3-p^2x,$ where $p$ is a prime such that $p\equiv 3 \mod 4.$

[b]p1.[/b] Calculate $A \cdot B +M \cdot C$, where $A = 1$, $B = 2$, $C = 3$, $M = 13$. [b]p2.[/b] What is the remainder of $\frac{2022\cdot2023}{10}$ ? [b]p3.[/b] Daniel and Bryan are rolling fair $7$-sided dice. If the probability that the sum of the numbers that Daniel and Bryan roll is greater than $11$ can be represented as the fraction $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers, what is $a + b$? [b]p4.[/b] Billy can swim the breaststroke at $25$ meters per minute, the butterfly at $30$ meters per minute, and the front crawl at $40$ meters per minute. One day, he swam without stopping or slowing down, swimming $1130$ meters. If he swam the butterfly for twice as long as the breaststroke, plus one additional minute, and the front crawl for three times as long as the butterfly, minus eight minutes, for how many minutes did he swim? [b]p5.[/b] Elon Musk is walking around the circumference of Mars trying to find aliens. If the radius of Mars is $3396.2$ km and Elon Musk is $73$ inches tall, the difference in distance traveled between the top of his head and the bottom of his feet in inches can be expressed as $a\pi$ for an integer $a$. Find $a$. ($1$ yard is exactly $0.9144$ meters). [b]p6.[/b] Lukas is picking balls out of his five baskets labeled $1$,$2$,$3$,$4$,$5$. Each basket has $27$ balls, each labeled with the number of its respective basket. What is the least number of times Lukas must take one ball out of a random basket to guarantee that he has chosen at least $5$ balls labeled ”$1$”? If there are no balls in a chosen basket, Lukas will choose another random basket. [b]p7.[/b] Given $35_a = 42_b$, where positive integers $a$, $b$ are bases, find the minimum possible value of the sum $a + b$ in base $10$. [b]p8.[/b] Jason is playing golf. If he misses a shot, he has a $50$ percent chance of slamming his club into the ground. If a club is slammed into the ground, there is an $80$ percent chance that it breaks. Jason has a $40$ percent chance of hitting each shot. Given Jason must successfully hit five shots to win a prize, what is the expected number of clubs Jason will break before he wins a prize? [b]p9.[/b] Circle $O$ with radius $1$ is rolling around the inside of a rectangle with side lengths $5$ and $6$. Given the total area swept out by the circle can be represented as $a + b\pi$ for positive integers $a$, $b$ find $a + b$. [b]p10.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD$. [b]p11.[/b] Raymond is eating huge burgers. He has been trained in the art of burger consumption, so he can eat one every minute. There are $100$ burgers to start with. However, at the end of every $20$ minutes, one of Raymond’s friends comes over and starts making burgers. Raymond starts with $1$ friend. If each of his friends makes $1$ burger every $20$ minutes, after how long in minutes will there be $0$ burgers left for the first time? [b]p12.[/b] Find the number of pairs of positive integers $(a, b)$ and $b\le a \le 2022$ such that $a\cdot lcm(a, b) = b \cdot gcd(a, b)^2$. [b]p13.[/b] Triangle $ABC$ has sides $AB = 6$, $BC = 10$, and $CA = 14$. If a point $D$ is placed on the opposite side of $AC$ from $B$ such that $\vartriangle ADC$ is equilateral, find the length of $BD$. [b]p14.[/b] If the product of all real solutions to the equation $(x-1)(x-2)(x-4)(x-5)(x-7)(x-8) = -x^2+9x-64$ can be written as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, b, d) = 1$ and $c$ is squarefree, compute $a + b + c + d$. [b]p15.[/b] Joe has a calculator with the keys $1, 2, 3, 4, 5, 6, 7, 8, 9,+,-$. However, Joe is blind. If he presses $4$ keys at random, and the expected value of the result can be written as $\frac{x}{11^4}$ , compute the last $3$ digits of $x$ when $x$ divided by $1000$. (If there are consecutive signs, they are interpreted as the sign obtained when multiplying the two signs values together, e.g $3$,$+$,$-$,$-$, $2$ would return $3 + (-(-(2))) = 3 + 2 = 5$. Also, if a sign is pressed last, it is ignored.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Compute the smallest positive integer $N$ for which $N \cdot 2^{2024}$ is a multiple of $2024$.

p1. It is known that $m$ and $n$ are two positive integer numbers consisting of four digits and three digits respectively. Both numbers contain the number $4$ and the number $5$. The number $59$ is a prime factor of $m$. The remainder of the division of $n$ by $38$ is $ 1$. If the difference between $m$ and $n$ is not more than $2015$. determine all possible pairs of numbers $(m,n)$. p2. It is known that the equation $ax^2 + bx + c = $0 with $a> 0$ has two different real roots and the equation $ac^2x^4 + 2acdx^3 + (bc + ad^2) x^2 + bdx + c = 0$ has no real roots. Is it true that $ad^2 + 2ad^2 <4bc + 16c^3$ ? p3. A basketball competition consists of $6$ teams. Each team carries a team flag that is mounted on a pole located on the edge of the match field. There are four locations and each location has five poles in a row. Pairs of flags at each location starting from the far right pole in sequence. If not all poles in each location must be flagged, determine as many possible flag arrangements. p4. It is known that two intersecting circles $L_1$ and $L_2$ have centers at $M$ and $N$ respectively. The radii of the circles $L_1$ and $L_2$ are $5$ units and $6$ units respectively. The circle $L_1$ passes through the point $N$ and intersects the circle $L_2$ at point $P$ and at point $Q$. The point $U$ lies on the circle $L_2$ so that the line segment $PU$ is a diameter of the circle $L_2$. The point $T$ lies at the extension of the line segment $PQ$ such that the area of ​​the quadrilateral $QTUN$ is $792/25$ units of area. Determine the length of the $QT$. p5. An ice ball has an initial volume $V_0$. After $n$ seconds ($n$ is natural number), the volume of the ice ball becomes $V_n$ and its surface area is $L_n$. The ice ball melts with a change in volume per second proportional to its surface area, i.e. $V_n - V_{n+1} = a L_n$, for every n, where a is a positive constant. It is also known that the ratio between the volume changes and the change of the radius per second is proportional to the area of ​​the property, that is $\frac{V_n - V_{n+1}}{R_n - R_{n+1}}= k L_n$ , where $k$ is a positive constant. If $V_1=\frac{27}{64} V_0$ and the ice ball melts totally at exactly $h$ seconds, determine the value of $h$.

Are there positive integers $a, b$ with $b \ge 2$ such that $2^a + 1$ is divisible by $2^b - 1$?

Prove that any irreducible fraction $p/q$, where $p$ and $q$ are positive integers and $q$ is odd, is equal to a fraction $\frac{n}{2^k-1}$ for some positive integers $n$ and $k$.

[b]a)[/b] Solve the system $$ \left\{\begin{matrix} 3^y-4^x=11\\ \log_4{x} +\log_3 y =3/2\end{matrix}\right. $$ [b]b)[/b] Solve the equation $ \quad 9^{\log_5 (x-2)} -5^{\log_9 (x+2)} = 4. $

[b]p1.[/b] A band of pirates unloaded some number of treasure chests from their ship. The number of pirates was between $60$ and $69$ (inclusive). Each pirate handled exactly $11$ treasure chests, and each treasure chest was handled by exactly $7$ pirates. Exactly how many treasure chests were there? Show that your answer is the only solution. [b]p2.[/b] Let $a$ and $b$ be the lengths of the legs of a right triangle, let $c$ be the length of the hypotenuse, and let $h$ be the length of the altitude drawn from the vertex of the right angle to the hypotenuse. Prove that $c+h>a+b$. [b]p3.[/b] Prove that $$\frac{1}{70}< \frac{1}{2} \frac{3}{4} \frac{5}{6} ... \frac{2001}{2002} < \frac{1}{40}$$ [b]p4.[/b] Given a positive integer $a_1$ we form a sequence $a_1 , a_2 , a _3,...$ as follows: $a_2$ is obtained from $a_1$ by adding together the digits of $a_1$ raised to the $2001$-st power; $a_3$ is obtained from $a_2$ using the same rule, and so on. For example, if $a_1 =25$, then $a_2 =2^{2001}+5^{2001}$, which is a $1399$-digit number containing $106$ $0$'s, $150$ $1$'s, 4124$ 42$'s, $157$ $3$'s, $148$ $4$'s, $141$ $5$'s, $128$ $6$'s, $1504 47$'s, $152$ $8$'s, $143$ $9$'s. So $a_3 = 106 \times 0^{2001}+ 150 \times 1^{2001}+ 124 \times 2^{2001}+ 157 \times 3^{2001}+ ...+ 143 \times 9^{2001}$ which is a $1912$-digit number, and so forth. Prove that if any positive integer $a_1$ is chosen to start the sequence, then there is a positive integer $M$ (which depends on $a_1$ ) that is so large that $a_n < M$ for all $n=1,2,3,...$ [b]p5.[/b] Let $P(x)$ be a polynomial with integer coefficients. Suppose that there are integers $a$, $b$, and $c$ such that $P(a)=0$, $P(b)=1$, and $P(c)=2$. Prove that there is at most one integer $n$ such that $P(n)=4$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_1, a_2, ..., a_{2012}$ be pairwise distinct integers. Show that the equation $(x -a_1)(x - a_2)...(x - a_{2012}) = (1006!)^2$ has at most one integral solution.

With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?

Put $f(n) = \frac{n^n - 1}{n - 1}$. Show that $n!^{f(n)}$ divides $(n^n)! $. Find as many positive integers as possible for which $n!^{f(n)+1}$ does not divide $(n^n)!$ .

Show that for any positive integers $a$ and $b$, $(36a+b)(a+36b)$ cannot be a power of $2$.

Determine the last digit of $5^5+6^6+7^7+8^8+9^9$.

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

[u]Round 1[/u] [b]p1.[/b] A party is attended by ten people (men and women). Among them is Pat, who always lies to people of the opposite gender and tells the truth to people of the same gender. Pat tells five of the guests: “There are more men than women at the party.” Pat tells four of the guests: “There are more women than men at the party.” Is Pat a man or a woman? [b]p2.[/b] Once upon a time in a land far, far away there lived $100$ knights, $99$ princesses, and $101$ dragons. Over time, knights beheaded dragons, dragons ate princesses, and princesses poisoned knights. But they always obeyed an ancient law that prohibits killing any creature who has killed an odd number of others. Eventually only one creature remained alive. Could it have been a knight? A dragon? A princess? [b]p3.[/b] The numbers $1 \circ 2 \circ 3 \circ 4 \circ 5 \circ 6 \circ 7 \circ 8 \circ 9 \circ 10$ are written in a line. Alex and Vicky play a game, taking turns inserting either an addition or a multiplication symbol between adjacent numbers. The last player to place a symbol wins if the resulting expression is odd and loses if it is even. Alex moves first. Who wins? (Remember that multiplication is performed before addition.) [b]p4.[/b] A chess tournament had $8$ participants. Each participant played each other participant once. The winner of a game got $1$ point, the loser $0$ points, and in the case of a draw each got $1/2$ a point. Each participant scored a different number of points, and the person who got $2$nd prize scored the same number of points as the $5$th, $6$th, $7$th and $8$th place participants combined. Can you determine the result of the game between the $3$rd place player and the $5$th place player? [b]p5.[/b] One hundred gnomes sit in a circle. Each gnome gets a card with a number written on one side and a different number written on the other side. Prove that it is possible for all the gnomes to lay down their cards so that no two neighbors have the same numbers facing up. [u]Round 2[/u] [b]p6.[/b] A casino machine accepts tokens of $32$ different colors, one at a time. For each color, the player can choose between two fixed rewards. Each reward is up to $\$10$ cash, plus maybe another token. For example, a blue token always gives the player a choice of getting either $\$5$ plus a red token or $\$3$ plus a yellow token; a black token can always be exchanged either for $\$10$ (but no token) or for a brown token (but no cash). A player may keep playing as long as he has a token. Rob and Bob each have one white token. Rob watches Bob play and win $\$500$. Prove that Rob can win at least $\$1000$. [img]https://cdn.artofproblemsolving.com/attachments/6/6/e55614bae92233c9b2e7d66f5f425a18e6475a.png[/img] [b]p7.[/b] Each of the $100$ residents of Pleasantville has at least $30$ friends in town. A resident votes in the mayoral election only if one of her friends is a candidate. Prove that it is possible to nominate two candidates for mayor so that at least half of the residents will vote. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.

Let $p>10$ be a prime. Prove that there is positive integers $m,n$ with $m+n<p$ such that $p$ divides $5^m7^n -1$

Let $x$, $y$ be two positive integers such that $\displaystyle 3x^2+x=4y^2+y$. Prove that $x-y$ is a perfect square.

Let $A=20132013...2013$ be formed by joining $2013$, $165$ times. Prove that $2013^2 \mid A$.

A dartboard is the region B in the coordinate plane consisting of points $(x, y)$ such that $|x| + |y| \le 8$. A target T is the region where $(x^2 + y^2 - 25)^2 \le 49$. A dart is thrown at a random point in B. The probability that the dart lands in T can be expressed as $\frac{m}{n} \pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? $ \textbf{(A) }39 \qquad \textbf{(B) }71 \qquad \textbf{(C) }73 \qquad \textbf{(D) }75 \qquad \textbf{(E) }135 \qquad $

For positive integers $a$ and $b$ holds $a^3+4a=b^2$. Prove that $a=2t^2$ for some positive integer $t$