[hide=B stands for Bernoulli, G stands for Germain]they had two problem sets under those two names[/hide] [u]Set 1[/u] [b]B1 / G1[/b] Find $20^3 + 2^2 + 3^1$. [b]B2[/b] A piece of string of length $10$ is cut $4$ times into strings of equal length. What is the length of each small piece of string? [b]B3 / G2[/b] What is the smallest perfect square that is also a perfect cube? [b]B4[/b] What is the probability a $5$-sided die with sides labeled from $1$ through $5$ rolls an odd number? [b]B5 / G3[/b] Hanfei spent $14$ dollars on chicken nuggets at McDonalds. $4$ nuggets cost $3$ dollars, $6$ nuggets cost $4$ dollars, and $12$ nuggets cost $9$ dollars. How many chicken nuggets did Hanfei buy? [u]Set 2[/u] [b]B6[/b] What is the probability a randomly chosen positive integer less than or equal to $15$ is prime? [b]B7[/b] Andrew flips a fair coin with sides labeled 0 and 1 and also rolls a fair die with sides labeled $1$ through $6$. What is the probability that the sum is greater than $5$? [b]B8 / G4[/b] What is the radius of a circle with area $4$? [b]B9[/b] What is the maximum number of equilateral triangles on a piece of paper that can share the same corner? [b]B10 / G5[/b] Bob likes to make pizzas. Bab also likes to make pizzas. Bob can make a pizza in $20$ minutes. Bab can make a pizza in $30$ minutes. If Bob and Bab want to make $50$ pizzas in total, how many hours would that take them? [u]Set 3[/u] [b]B11 / G6[/b] Find the area of an equilateral rectangle with perimeter $20$. [b]B12 / G7[/b] What is the minimum possible number of divisors that the sum of two prime numbers greater than $2$ can have? [b]B13 / G8[/b] Kwu and Kz play rock-paper-scissors-dynamite, a variant of the classic rock-paperscissors in which dynamite beats rock and paper but loses to scissors. The standard rock-paper-scissors rules apply, where rock beats scissors, paper beats rock, and scissors beats paper. If they throw out the same option, they keep playing until one of them wins. If Kz randomly throws out one of the four options with equal probability, while Kwu only throws out dynamite, what is the probability Kwu wins? [b]B14 / G9[/b] Aven has $4$ distinct baguettes in a bag. He picks three of the bagged baguettes at random and lays them on a table in random order. How many possible orderings of three baguettes are there on the table? [b]B15 / G10[/b] Find the largest $7$-digit palindrome that is divisible by $11$. PS. You should use hide for answers. Rest problems have been posted [url=https://artofproblemsolving.com/community/c3h3132170p28376644]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a natural number $k$, find the smallest natural number $C$ such that $$\frac C{n+k+1}\binom{2n}{n+k}$$is an integer for every integer $n\ge k$.

Prove that $(n!)!$ is a multiple of $(n!)^{(n-1)!}$

Let $a, b, c$ be positive integers such that the product $$\gcd(a,b) \cdot \gcd(b,c) \cdot \gcd(c,a) $$ is a perfect square. Prove that the product $$\operatorname{lcm}(a,b) \cdot \operatorname{lcm}(b,c) \cdot \operatorname{lcm}(c,a) $$ is also a perfect square.

Let $a, b, c, d$ be digits such that $d > c > b > a \geq 0$. How many numbers of the form $1a1b1c1d1$ are multiples of $33$?

There is a long-standing conjecture that there is no number with $2n + 1$ instances in Pascal’s triangle for $n \ge 2$. Assuming this is true, for how many $n \le 100, 000$ are there exactly $3$ instances of $n$ in Pascal’s triangle?

[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for no integer $ n$ is $ n^7 \plus{} 7$ a perfect square.

Prove that there exists a prime number $p$, such that the sum of digits of $p$ is a composite odd integer. Find the smallest such $p$.

On the table there are several cards. Each card has an integer number written on it. Beto performs the following operation several times: he chooses two cards from the table, calculates the difference between the numbers written on them, writes the result on his notebook and removes those two cards from the table. He can perform this operation as many times as he wants, as long as there are at least two cards on the table. After this, Beto multiplies all the numbers that he wrote on his notebook. Beto's goal is that the result of this multiplication is a multiple of $7^{100}$. a) Prove that if there are $207$ cards initially on the table then Beto can always achieve his goal, no matter what the numbers on the cards are. b) If there are $128$ cards initially on the table, is it true that Beto can always achieve his goal?

Consider rows of the form: $[x], [2x], [3x], ...$ Proof that, if $N \in N$ does not occur in the sequence $([n x])$, then there is an $n \in N$ with $n - 1 < \frac{N}{x}< n -\frac{1}{x}$ Prove that, for $x, y \notin Q$: $\frac{1}{x}+\frac{1}{y} = 1$, then each $N \in N$ term is either of $([nx])$ or of $([ny])$.

Let $a_{i}$, $i = 1,2, \dots ,n$, $n \geq 3$, be positive integers, having the greatest common divisor 1, such that \[a_{j}\textrm{ divide }\sum_{i = 1}^{n}a_{i}\] for all $j = 1,2, \dots ,n$. Prove that \[\prod_{i = 1}^{n}a_{i}\textrm{ divides }\Big{(}\sum_{i = 1}^{n}a_{i}\Big{)}^{n-2}.\]

Given $2018 \times 4$ grids and tint them with red and blue. So that each row and each column has the same number of red and blue grids, respectively. Suppose there're $M$ ways to tint the grids with the mentioned requirement. Determine $M \pmod {2018}$.

a) Exist $a, b, c, \in N$, such that the numbers $ab+1,bc+1$ and $ca+1$ are simultaneously even perfect squares ? b) Show that there is an infinity of natural numbers (distinct two by two) $a, b, c$ and $d$, so that the numbers $ab+1,bc+1, cd+1$ and $da+1$ are simultaneously perfect squares.

We say that a natural number $ n\ge 4 $ is [i]unusual[/i] if, for any $ n\times n $ array of real numbers, the sum of the numbers from any $ 3\times 3 $ compact subarray is negative, and the sum of the numbers from any $ 4\times 4 $ compact subarray is positive. Find all unusual numbers.

Find all primes $p$ such that there exist positive integers $x,y$ that satisfy $x(y^2-p)+y(x^2-p)=5p$

[u]Round 1[/u] [b]p1.[/b] Five children, Aisha, Baesha, Cosha, Dasha, and Erisha, competed in running, jumping, and throwing. In each event, first place was won by someone from Renton, second place by someone from Seattle, and third place by someone from Tacoma. Aisha was last in running, Cosha was last in jumping, and Erisha was last in throwing. Could Baesha and Dasha be from the same city? [b]p2.[/b] Fifty-five Brits and Italians met in a coffee shop, and each of them ordered either coffee or tea. Brits tell the truth when they drink tea and lie when they drink coffee; Italians do it the other way around. A reporter ran a quick survey: Forty-four people answered “yes” to the question, “Are you drinking coffee?” Thirty-three people answered “yes” to the question, “Are you Italian?” Twenty-two people agreed with the statement, “It is raining outside.” How many Brits in the coffee shop are drinking tea? [b]p3.[/b] Doctor Strange is lost in a strange house with a large number of identical rooms, connected to each other in a loop. Each room has a light and a switch that could be turned on and off. The lights might initially be on in some rooms and off in others. How can Dr. Strange determine the number of rooms in the house if he is only allowed to switch lights on and off? [b]p4.[/b] Fifty street artists are scheduled to give solo shows with three consecutive acts: juggling, drumming, and gymnastics, in that order. Each artist will spend equal time on each of the three activities, but the lengths may be different for different artists. At least one artist will be drumming at every moment from dawn to dusk. A new law was just passed that says two artists may not drum at the same time. Show that it is possible to cancel some of the artists' complete shows, without rescheduling the rest, so that at least one show is going on at every moment from dawn to dusk, and the schedule complies with the new law. [b]p5.[/b] Alice and Bob split the numbers from $1$ to $12$ into two piles with six numbers in each pile. Alice lists the numbers in the first pile in increasing order as $a_1 < a_2 < a_3 < a_4 < a_5 < a_6$ and Bob lists the numbers in the second pile in decreasing order $b_1 > b_1 > b_3 > b_4 > b_5 > b_6$. Show that no matter how they split the numbers, $$|a_1 -b_1| + |a_2 -b_2| + |a_3 -b_3| + |a_4 -b_4| + |a_5 -b_5| + |a_6 -b_6| = 36.$$ [u]Round 2[/u] [b]p6.[/b] The Martian alphabet has ? letters. Marvin writes down a word and notices that within every sub-word (a contiguous stretch of letters) at least one letter occurs an odd number of times. What is the length of the longest possible word he could have written? [b]p7.[/b] For a long space journey, two astronauts with compatible personalities are to be selected from $24$ candidates. To find a good fit, each candidate was asked $24$ questions that required a simple yes or no answer. Two astronauts are compatible if exactly $12$ of their answers matched (that is, both answered yes or both answered no). Miraculously, every pair of these $24$ astronauts was compatible! Show that there were exactly $12$ astronauts whose answer to the question “Can you repair a flux capacitor?” was exactly the same as their answer to the question “Are you afraid of heights?” (that is, yes to both or no to both). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A twin prime pair is a pair of primes $(p,q)$ such that $q = p + 2$. The Twin Prime Conjecture states that there are infinitely many twin prime pairs. What is the arithmetic mean of the two primes in the smallest twin prime pair? (1 is not a prime.) $\textbf{(A) }4$

Let $k$ be a fixed odd integer, $k>3$. Prove: There exist infinitely many positive integers $n$, such that there are two positive integers $d_1, d_2$ satisfying $d_1,d_2$ each dividing $\frac{n^2+1}{2}$, and $d_1+d_2=n+k$.

Find all non-negative integers $n$, $a$, and $b$ satisfying \[2^a + 5^b + 1 = n!.\]

Given a prime $p$, show that \[\left(1+p\sum_{k=1}^{p-1}k^{-1}\right)^2 \equiv 1-p^2\sum_{k=1}^{p-1}k^{-2} \pmod{p^4}.\] [i]Timothy Chu.[/i]

Prove that there exist infinitely many positive integers $n$ such that the greatest prime divisor of $n^2+1$ is less than $n \cdot \pi^{-2019}.$

Find the number of integers $x$ such that the following three conditions all hold: $\bullet$ $x$ is a multiple of $5$ $\bullet$ $121 < x < 1331$ $\bullet$ When $x$ is written as an integer in base $11$ with no leading $0$s (i.e. no $0$s at the very left), its rightmost digit is strictly greater than its leftmost digit.

Given a number, we calculate its square and add $1$ to the sum of the digits in this square, obtaining a new number. If we start with the number $7$ we will obtain, in the first step, the number $1+(4+9)=14$, since $7^2 = 49$. What number will we obtain in the $1999$th step?

[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].