Find all prime numbers p such that $2^p+p^2 $ is also a prime number.

Define the sequence $(x_n)$ by $x_0 = 0$ and for all $n \in \mathbb N,$ \[x_n=\begin{cases} x_{n-1} + (3^r - 1)/2,&\mbox{ if } n = 3^{r-1}(3k + 1);\\ x_{n-1} - (3^r + 1)/2, & \mbox{ if } n = 3^{r-1}(3k + 2).\end{cases}\] where $k \in \mathbb N_0, r \in \mathbb N$. Prove that every integer occurs in this sequence exactly once.

For a given positive integer $n$, you may perform a series of steps. At each step, you may apply an operation: you may increase your number by one, or if your number is divisible by 2, you may divide your number by 2. Let $\ell(n)$ be the minimum number of operations needed to transform the number $n$ to 1 (for example, $\ell(1) = 0$ and $\ell(7) = 4$). How many positive integers $n$ are there such that $\ell(n) \leq 12$?

[u]Round 1[/u] [b]p1.[/b] Three two-digit numbers are written on a board. One starts with $5$, another with $6$, and the last one with $7$. Annie added the first and the second numbers; Benny added the second and the third numbers; Denny added the third and the first numbers. Could it be that one of these sums is equal to $148$, and the two other sums are three-digit numbers that both start with $12$? [b]p2.[/b] Three rocks, three seashells, and one pearl are placed in identical boxes on a circular plate in the order shown. The lids of the boxes are then closed, and the plate is secretly rotated. You can open one box at a time. What is the smallest number of boxes you need to open to know where the pearl is, no matter how the plate was rotated? [img]https://cdn.artofproblemsolving.com/attachments/0/2/6bb3a2a27f417a84ab9a64100b90b8768f7978.png[/img] [b]p3.[/b] Two detectives, Holmes and Watson, are hunting the thief Raffles in a library, which has the floorplan exactly as shown in the diagram. Holmes and Watson start from the center room marked $D$. Show that no matter where Raffles is or how he moves, Holmes and Watson can find him. Holmes and Watson do not need to stay together. A detective sees Raffles only if they are in the same room. A detective cannot stand in a doorway to see two rooms at the same time. [img]https://cdn.artofproblemsolving.com/attachments/c/1/6812f615e60a36aea922f145a1ffc470d0f1bc.png[/img] [b]p4.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken. [img]https://cdn.artofproblemsolving.com/attachments/4/6/bf0185e142cd3f653d4a9c0882d818c55c64e4.png[/img] [b]p5.[/b] The numbers $1–14$ are placed around a circle in some order. You can swap two neighbors if they differ by more than $1$. Is it always possible to rearrange the numbers using swaps so they are ordered clockwise from $1$ to $14$? [u]Round 2[/u] [b]p6.[/b] A triangulation of a regular polygon is a way of drawing line segments between its vertices so that no two segments cross, and the interior of the polygon is divided into triangles. A flip move erases a line segment between two triangles, creating a quadrilateral, and replaces it with the opposite diagonal through that quadrilateral. This results in a new triangulation. [img]https://cdn.artofproblemsolving.com/attachments/a/a/657a7cf2382bab4d03046075c6e128374c72d4.png[/img] Given any two triangulations of a polygon, is it always possible to find a sequence of flip moves that transforms the first one into the second one? [img]https://cdn.artofproblemsolving.com/attachments/0/9/d09a3be9a01610ffc85010d2ac2f5b93fab46a.png[/img] [b]p7.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9,..., 121)$ are in one column? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The number $2020$ has three different prime factors. What is their sum?

[u]Round 1[/u] [b]p1.[/b] Is it possible to draw some number of diagonals in a convex hexagon so that every diagonal crosses EXACTLY three others in the interior of the hexagon? (Diagonals that touch at one of the corners of the hexagon DO NOT count as crossing.) [b]p2.[/b] A $ 3\times 3$ square grid is filled with positive numbers so that (a) the product of the numbers in every row is $1$, (b) the product of the numbers in every column is $1$, (c) the product of the numbers in any of the four $2\times 2$ squares is $2$. What is the middle number in the grid? Find all possible answers and show that there are no others. [b]p3.[/b] Each letter in $HAGRID$'s name represents a distinct digit between $0$ and $9$. Show that $$HAGRID \times H \times A\times G\times R\times I\times D$$ is divisible by $3$. (For example, if $H=1$, $A=2$, $G=3$, $R = 4$, $I = 5$, $D = 64$, then $HAGRID \times H \times A\times G\times R\times I\times D= 123456\times 1\times2\times3\times4\times5\times 6$). [b]p4.[/b] You walk into a room and find five boxes sitting on a table. Each box contains some number of coins, and you can see how many coins are in each box. In the corner of the room, there is a large pile of coins. You can take two coins at a time from the pile and place them in different boxes. If you can add coins to boxes in this way as many times as you like, can you guarantee that each box on the table will eventually contain the same number of coins? [b]p5.[/b] Alex, Bob and Chad are playing a table tennis tournament. During each game, two boys are playing each other and one is resting. In the next game the boy who lost a game goes to rest, and the boy who was resting plays the winner. By the end of tournament, Alex played a total of $10$ games, Bob played $15$ games, and Chad played $17$ games. Who lost the second game? [u]Round 2[/u] [b]p6.[/b] After going for a swim in his vault of gold coins, Scrooge McDuck decides he wants to try to arrange some of his gold coins on a table so that every coin he places on the table touches exactly three others. Can he possibly do this? You need to justify your answer. (Assume the gold coins are circular, and that they all have the same size. Coins must be laid at on the table, and no two of them can overlap.) [b]p7.[/b] You have a deck of $50$ cards, each of which is labeled with a number between $1$ and $25$. In the deck, there are exactly two cards with each label. The cards are shuffled and dealt to $25$ students who are sitting at a round table, and each student receives two cards. The students will now play a game. On every move of the game, each student takes the card with the smaller number out of his or her hand and passes it to the person on his/her right. Each student makes this move at the same time so that everyone always has exactly two cards. The game continues until some student has a pair of cards with the same number. Show that this game will eventually end. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For all positive integer $ n\geq 2$, prove that product of all prime numbers less or equal than $ n$ is smaller than $ 4^{n}$.

[b]p1.[/b] What is $2 \cdot 24 + 20 \cdot 24 + 202 \cdot 4 + 2024$? [b]p2.[/b] Jerry has $300$ legos. Tie can either make cars, which require $17$ legos, or bikes, which require $13$ legos. Assuming he uses all of his legos, how many ordered pairs $(a, b)$ are there such that he makes $a$ cars and $b$ bikes? [b]p3.[/b] Patrick has $7$ unique textbooks: $2$ Geometry books, $3$ Precalculus books and $2$ Algebra II books. How many ways can he arrange his books on a bookshelf such that all the books of the same subjects are adjacent to each other? [b]p4.[/b] After a hurricane, a $32$ meter tall flagpole at the Act on-Boxborough Regional High School snapped and fell over. Given that the snapped part remains in contact with the original pole, and the top of the polo falls $24$ meters away from the bottom of the pole, at which height did the polo snap? (Assume the flagpole is perpendicular to the ground.) [b]p5.[/b] Jimmy is selling lemonade. Iio has $200$ cups of lemonade, and he will sell them all by the end of the day. Being the ethically dubious individual he is, Jimmy intends to dilute a few of the cups of lemonade with water to conserve resources. Jimmy sells each cup for $\$4$. It costs him $\$ 1$ to make a diluted cup of lemonade, and it costs him $\$2.75$ to make a cup of normal lemonade. What is the minimum number of diluted cups Jimmy must sell to make a profit of over $\$400$? [b]p6.[/b] Jeffrey has a bag filled with five fair dice: one with $4$ sides, one with $6$ sides, one with $8$ sides, one with $12$ sides, and one with $20$ sides. The dice are numbered from $1$ to the number of sides on the die. Now, Marco will randomly pick a die from .Jeffrey's bag and roll it. The probability that Marco rolls a $7$ can be expressed as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a+b$. [b]p7.[/b] What is the remainder when the sum of the first $2024$ odd numbers is divided by $6072$? [b]p8.[/b] A rhombus $ABCD$ with $\angle A = 60^o$ and $AB = 600$ cm is drawn on a piece of paper. Three ants start moving from point $A$ to the three other points on the rhombus. One ant walks from $A$ to $B$ at a leisurely speed of $10$ cm/s. The second ant runs from $A$ to $C$ at a slightly quicker pace of $6\sqrt3$ cm/s, arriving to $C$ $x$ seconds after the first ant. The third ant travels from $A$ to $B$ to $D$ at a constant speed, arriving at $D$ $x$ seconds after the second ant. The speed of the last ant can be written as $\frac{m}{n}$ cm/s, where $m$ and $n$ are relatively prime positive integers. Find $mn$. [b]p9.[/b] This year, the Apple family has harvested so many apples that they cannot sell them all! Applejack decides to make $40$ glasses of apple cider to give to her friends. If Twilight and Fluttershy each want $1$ or $2$ glasses; Pinkie Pic wants cither $2$, $14$, or $15$ glasses; Rarity wants an amount of glasses that is a power of three; and Rainbow Dash wants any odd number of glasses, then how many ways can Applejack give her apple cider to her friends? Note: $1$ is considered to be a power of $3$. [b]p10.[/b] Let $g_x$ be a geometric sequence with first term $27$ and successive ratio $2n$ (so $g_{x+1}/g_x = 2n$). Then, define a function $f$ as $f(x) = \log_n(g_x)$, where $n$ is the base of the logarithm. It is known that the sum of the first seven terms of $f(x)$ is $42$. Find $g_2$, the second term of the geometric sequence. Note: The logarithm base $b$ of $x$, denoted $\log_b(x)$ is equal to the value $y$ such that $b^y = x$. In other words, if $\log_b(x) = y$, then $b^y = x$. [b]p11.[/b] Let $\varepsilon$ be an ellipse centered around the origin, such that its minor axis is perpendicular to the $x$-axis. The length of the ellipse's major and minor axes is $8$ and $6$, respectively. Then, let $ABCD$ be a rectangle centered around the origin, such that $AB$ is parallel to the $x$-axis. The lengths of $AB$ and $BC$ are $8$ and $3\sqrt2$, respectively. The area outside the ellipse but inside the rectangle can be expressed as $a\sqrt{b}-c-d\pi$, for positive integers $a$, $b$, $c$, $d$ where $b$ is not divisible by a perfect square of any prime. Find $a + b + c + d$. [img]https://cdn.artofproblemsolving.com/attachments/e/c/9d943966763ee7830d037ef98c21139cf6f529.png[/img] [b]p12.[/b] Let $N = 2^7 \cdot 3^7 \cdot 5^5$. Find the number of ways to express $N$ as the product of squares and cubes, all of which are integers greater than $1$. [b]p13.[/b] Jerry and Eric are playing a $10$-card game where Jerry is deemed the ’’landlord" and Eric is deemed the ' peasant'’. To deal the cards, the landlord keeps one card to himself. Then, the rest of the $9$ cards are dealt out, such that each card has a $1/2$ chance to go to each player. Once all $10$ cards are dealt out, the landlord compares the number of cards he owns with his peasant. The probability that the landlord wins is the fraction of cards he has. (For example, if Jerry has $5$ cards and Eric has $2$ cards, Jerry has a$ 5/7$ ths chance of winning.) The probability that Jerry wins the game can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime. Find $p + q$. [b]p14.[/b] Define $P(x) = 20x^4 + 24x^3 + 10x^2 + 21x+ 7$ to have roots $a$, $b$, $c$, and $d$. If $Q(x)$ has roots $\frac{1}{a-2}$,$\frac{1}{b-2}$,$ \frac{1}{c-2}$, $\frac{1}{d-2}$ and integer coefficients with a greatest common divisor of $1$, then find $Q(2)$. [b]p15.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 14$, $BC = 13$, and $AC = 15$. The incircle of $\vartriangle ABC$ is drawn with center $I$, tangent to $\overline{AB}$ at $X$. The line $\overleftrightarrow{IX}$ intersects the incircle again at $Y$ and intersects $\overline{AC}$ at $Z$. The area of $\vartriangle AYZ$ can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Compute the sum of all positive integers $n < 200$ such that $gcd(n, k) \ne 1$ for every $k \in\{2 \cdot 11 \cdot 19, 3 \cdot 13 \cdot 17, 5 \cdot 11 \cdot 13, 7 \cdot 17 \cdot 19\}$.

Each of $11$ weights is weighing an integer number of grams. No two weights are equal. It is known that if all these weights or any group of them are placed on a balance then the side with a larger number of weights is always heavier. Prove that at least one weight is heavier than $35$ grams.

Let $a/b$ be the probability that a randomly selected divisor of $2007$ is a multiple of $3$. If $a$ and $b$ are relatively prime positive integers, find $a+b$.

Find the largest possible sum $ m + n$ for positive integers $m, n \le 100$ such that $m + 1 \equiv 3$ (mod $4$) and there exists a prime number $p$ and nonnegative integer $a$ such $\frac{m^{2n-1}-1}{m-1} = m^n+p^a$ .

Find all functions $f : \mathbb{N} \to \mathbb{N}$ such that for any positive integers $m, n$ the number $$(f(m))^2+ 2mf(n) + f(n^2)$$ is the square of an integer. [i]Proposed by Fedir Yudin[/i]

Prove that there exists only one pair $ (p,q) $ of odd primes satisfying the properties that $ p^2\equiv 4\pmod q $ and $ q^2\equiv 1\pmod p. $ [i]Ana Maria Acu[/i]

Prove that for any natural numbers $a,b,c$ and $d$ there exist infinetly natural numbers $n$ such that $a^n+b^n+c^n+d^n$ is composite.

Let $f$ be the unique polynomial of degree at most $2026$ such that for all $n \in \{1,2, 3, \ldots, 2027\},$ $$f(n)=\begin{cases} 1 & \text{if } $n$ \text{ is a perfect square}, \\ 0 & \text{otherwise.} \end{cases}$$ Suppose that $\tfrac{a}{b}$ is the coefficient of $x^{2025}$ in $f,$ where $a$ and $b$ are integers such that $\gcd(a,b)=1.$ Compute the unique integer $r$ between $0$ and $2026$ (inclusive) such that $a-rb$ is divisible by $2027.$ (Note that $2027$ is prime.)

$(a)$ Prove that for every positive integer $n$, the number of ordered pairs $(x, y)$ of integers satisfying $x^2-xy+y^2 = n$ is divisible by $3.$ $(b)$ Find all ordered pairs of integers satisfying $x^2-xy+y^2=727.$

Let $a, b$ and $c$ be integers such that $a+b+c = 0$. Prove that $\frac12(a^4 +b^4 +c^4)$ is a perfect square.

Determine the remainder when $$2^{\frac {1 \cdot 2}{2}} + 2^{\frac {2 \cdot 3}{2}}+ ...+ 2^{\frac {2011 \cdot 2012}{2}}$$ is divided by $7$.

Given natural number $k$ with a property "if $n$ is divisible by $k$, than the number, obtained from $n$ by reversing the order of its digits is also divisible by $k$". Prove that the $k$ is a divisor of $99$.

Find the largest positive integer $n$ such that $n\varphi(n)$ is a perfect square. ($\varphi(n)$ is the number of integers $k$, $1 \leq k \leq n$ that are relatively prime to $n$)

Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$

Let $n$ be a positive integer. Prove that there exists a natural number $m$ with exactly $n$ prime factors, such that for every positive integer $d$ the numbers in $\{1,2,3,\ldots,m\}$ of order $d$ modulo $m$ are multiples of $\phi (d)$. (15 points)

A number is called cool if the sum of its digits is multiple of $17$ and the sum of digits of its successor is multiple of $17$. What is the smallest cool number?

Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$