Find the sum of all prime numbers between $ 1$ and $ 100$ that are simultaneously $ 1$ greater than a multiple of $ 4$ and $ 1$ less than a multiple of $ 5$. $ \textbf{(A)}\ 118\qquad \textbf{(B)}\ 137\qquad \textbf{(C)}\ 158\qquad \textbf{(D)}\ 187 \qquad \textbf{(E)}\ 245$

Given a natural number $n$, for what maximal value $k$ it is possible to construct a matrix of size $k \times n$ consisting only of elements $\pm 1$ in such a way that for any interchange of a $+1$ with a $-1$ or vice versa, its rank is equal to $k$?

p1. A set of cards contains $100$ cards, each of which is written with a number from $1$ up to $100$. On each of the two sides of the card the same number is written, side one is red and the other is green. First of all Leny arranges all the cards with red writing face up. Then Leny did the following three steps: I. Turn over all cards whose numbers are divisible by $2$ II. Turn over all the cards whose numbers are divisible by $3$ III. Turning over all the cards whose numbers are divisible by $5$, but didn't turn over all cards whose numbers are divisible by $5$ and $2$. Find the number of Leny cards now numbered in red and face up, p2. Find the area of ​​three intersecting semicircles as shown in the following image. [img]https://cdn.artofproblemsolving.com/attachments/f/b/470c4d2b84435843975a0664fad5fee4a088d5.png[/img] p3. It is known that $x+\frac{1}{x}=7$ . Determine the value of $A$ so that $\frac{Ax}{x^4+x^2+1}=\frac56$. p4. There are $13$ different gifts that will all be distributed to Ami, Ima, Mai,and Mia. If Ami gets at least $4$ gifts, Ima and Mai respectively got at least $3$ gifts, and Mia got at least $2$ gifts, how many possible gift arrangements are there? p5. A natural number is called a [i]quaprimal [/i] number if it satisfies all four following conditions: i. Does not contain zeros. ii. The digits compiling the number are different. iii. The first number and the last number are prime numbers or squares of an integer. iv. Each pair of consecutive numbers forms a prime number or square of an integer. For example, we check the number $971643$. (i) $971643$ does not contain zeros. (ii) The digits who compile $971643$ are different. (iii) One first number and one last number of $971643$, namely $9$ and $3$ is a prime number or a square of an integer. (iv) Each pair of consecutive numbers, namely $97, 71, 16, 64$, and $43$ form prime number or square of an integer. So $971643$ is a quadratic number. Find the largest $6$-digit quaprimal number. Find the smallest $6$-digit quaprimal number. Which digit is never contained in any arbitrary quaprimal number? Explain.

[b]p1.[/b] Suppose Mitchell has a fair die. He is about to roll it six times. The probability that he rolls $1$, $2$, $3$, $4$, $5$, and then $6$ in that order is $p$. The probability that he rolls $2$, $2$, $4$, $4$, $6$, and then $6$ in that order is $q$. What is $p - q$? [b]p2.[/b] What is the smallest positive integer $x$ such that $x \equiv 2017$ (mod $2016$) and $x \equiv 2016$ (mod $2017$) ? [b]p3.[/b] The vertices of triangle $ABC$ lie on a circle with center $O$. Suppose the measure of angle $ACB$ is $45^o$. If $|AB| = 10$, then what is the distance between $O$ and the line $AB$? [b]p4.[/b] A “word“ is a sequence of letters such as $YALE$ and $AELY$. How many distinct $3$-letter words can be made from the letters in $BOOLABOOLA$ where each letter is used no more times than the number of times it appears in $BOOLABOOLA$? [b]p5.[/b] How many distinct complex roots does the polynomial $p(x) = x^{12} - x^8 - x^4 + 1$ have? [b]p6.[/b] Notice that $1 = \frac12 + \frac13 + \frac16$ , that is, $1$ can be expressed as the sum of the three fractions $\frac12 $, $\frac13$ , and $\frac16$ , where each fraction is in the form $\frac{1}{n}$, with each $n$ different. Give a $6$-tuple of distinct positive integers $(a, b, c, d, e, f)$ where $a < b < c < d < e < f$ such that $\frac{1}{a} +\frac{1}{b} + \frac{1}{c} + \frac{1}{d} + \frac{1}{e} + \frac{1}{f} = 1$ and explain how you arrived at your $6$-tuple. Multiple answers will be accepted. [b]p7.[/b] You have a Monopoly board, an $11 \times 11$ square grid with the $9 \times 9$ internal square grid removed, where every square is blank except for Go, which is the square in the bottom right corner. During your turn, you determine how many steps forward (which is in the counterclockwise direction) to move by rolling two standard $6$-sided dice. Let $S$ be the set of squares on the board such that if you are initially on a square in $S$, no matter what you roll with the dice, you will always either land on Go (move forward enough squares such that you end up on Go) or you pass Go (you move forward enough squares such that you step on Go during your move and then you advance past Go). You randomly and uniformly select one square in $S$ as your starting position. What is the probability that you land on Go? [b]p8.[/b] Using $L$-shaped triominos, and dominos, where each square of a triomino and a domino covers one unit, what is the minimum number of tiles needed to cover a $3$-by-$2017$ rectangle without any gaps? [b]p9.[/b] Does there exist a pair of positive integers $(x, y)$, where $x < y$, such that $x^2 + y^2 = 1009^3$? If so, give a pair $(x, y)$ and explain how you found that pair. If not, explain why. [b]p10.[/b] Triangle $ABC$ has inradius $8$ and circumradius $20$. Let $M$ be the midpoint of side $BC$, and let $N$ be the midpoint of arc $BC$ on the circumcircle not containing $A$. Let $s_A$ denote the length of segment $MN$, and define $s_B$ and $s_C$ similarly with respect to sides $CA$ and $AB$. Evaluate the product $s_As_Bs_C$. [b]p11.[/b] Julia and Dan want to divide up $256$ dollars in the following way: in the first round, Julia will offer Dan some amount of money, and Dan can choose to accept or reject the offer. If Dan accepts, the game is over. Otherwise, if Dan rejects, half of the money disappears. In the second round, Dan can offer Julia part of the remaining money. Julia can then choose to accept or reject the offer. This process goes on until an offer is accepted or until $4$ rejections have been made; once $4$ rejections are made, all of the money will disappear, and the bargaining process ends. If Julia or Dan is indifferent between accepting and rejecting an offer, they will accept the offer. Given that Julia and Dan are both rational and both have the goal of maximizing the amount of money they get, how much will Julia offer Dan in the first round? [b]p12.[/b] A perfect partition of a positive integer $N$ is an unordered set of numbers (where numbers can be repeated) that sum to $N$ with the property that there is a unique way to express each positive integer less than $N$ as a sum of elements of the set. Repetitions of elements of the set are considered identical for the purpose of uniqueness. For example, the only perfect partitions of $3$ are $\{1, 1, 1\}$ and $\{1, 2\}$. $\{1, 1, 3, 4\}$ is NOT a perfect partition of $9$ because the sum $4$ can be achieved in two different ways: $4$ and $1 + 3$. How many integers $1 \le N \le 40$ each have exactly one perfect partition? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.

We call natural number $n$ [i]$crazy$[/i] iff there exist natural numbers $a$, $b >1$ such that $n=a^b+b$. Whether there exist $2014$ consecutive natural numbers among which are $2012$ [i]$crazy$[/i] numbers? [i]Proposed by Milos Milosavljevic[/i]

Aladdin has several gold ingots, and sometimes he asks the Genie to give him more. The Genie first adds a thousand ingots, but then takes half of the total number. Could it be possible that after asking the Genie for gold ten times, the number of Aladdin’s gold ingots increased, assuming that each time the Genie took half, he took an integer number of ingots? (5 points) Alexandr Perepechko

In trapezoid $ABCD$, the sides $AD$ and $BC$ are parallel, and $AB = BC = BD$. The height $BK$ intersects the diagonal $AC$ at $M$. Find $\angle CDM$.

Assume the $n$ sets $A_1, A_2..., A_n$ are a partition of the set $A=\{1,2,...,29\}$, and the sum of any elements in $A_i$ , $(i=1,2,...,n)$ is not equal to $30$. Find the smallest possible value of $n$.

$16$ people sit around a circular table. After some time, they all stand up and sit down in either the chair they were previously sitting on or on a chair next to it. Determine the number of ways that this can be done. Note: two or more people cannot sit on the same chair.

In a group $G$, we have two elements $x,y$ such that $x^{n}=e,y^2=e,yxy=x^{-1}$, $n\ge 1$. Prove that for any $k\in\mathbb{N}$ holds $(x^ky)^2=e$. Note : e=group's identity .

Prove that the following inequality holds for all real $a$ and natural $n$: $$|a| \cdot |a-1|\cdot |a-2|\cdot ...\cdot |a-n| \ge \frac{n!F(a)}{2n}$$ $F(a)$ is the distance from $a$ to the closest integer.

Circle $C_1$ and $C_2$ each have radius $1$, and the distance between their centers is $\frac{1}{2}$. Circle $C_3$ is the largest circle internally tangent to both $C_1$ and $C_2$. Circle $C_4$ is internally tangent to both $C_1$ and $C_2$ and externally tangent to $C_3$. What is the radius of $C_4$? [asy] import olympiad; size(10cm); draw(circle((0,0),0.75)); draw(circle((-0.25,0),1)); draw(circle((0.25,0),1)); draw(circle((0,6/7),3/28)); pair A = (0,0), B = (-0.25,0), C = (0.25,0), D = (0,6/7), E = (-0.95710678118, 0.70710678118), F = (0.95710678118, -0.70710678118); dot(B^^C); draw(B--E, dashed); draw(C--F, dashed); draw(B--C); label("$C_4$", D); label("$C_1$", (-1.375, 0)); label("$C_2$", (1.375,0)); label("$\frac{1}{2}$", (0, -.125)); label("$C_3$", (-0.4, -0.4)); label("$1$", (-.85, 0.70)); label("$1$", (.85, -.7)); import olympiad; markscalefactor=0.005; [/asy] $\textbf{(A) } \frac{1}{14} \qquad \textbf{(B) } \frac{1}{12} \qquad \textbf{(C) } \frac{1}{10} \qquad \textbf{(D) } \frac{3}{28} \qquad \textbf{(E) } \frac{1}{9}$

Find the number of primes $p$ between $100$ and $200$ for which $x^{11}+y^{16}\equiv 2013\pmod p$ has a solution in integers $x$ and $y$.

Given is a positive integer $k$. There are $n$ points chosen on a line, such the distance between any two adjacent points is the same. The points are colored in $k$ colors. For each pair of monochromatic points such that there are no points of the same color between them, we record the distance between these two points. If all distances are distinct, find the largest possible $n$.

Prove that for positive reals $a$, $b$, $c$ we have \[ 3(a+b+c) \ge 8\sqrt[3]{abc} + \sqrt[3]{\frac{a^3+b^3+c^3}{3}}. \]