Consider a convex $100$-gon $A_1A_2...A_{100}$. Draw the diagonal $A_{43}A_{81}$ which divides it into two convex polygons $P_1,P_2$. How many vertices and how diagonals, has each of the polygons $P_1,P_2$?

Jane's mother bakes cookies for Jane to share with her $6$ friends. When the cookies are evenly divided among the $7$ children (Jane and her $6$ friends), there is one cookie left over. Given that each child receives at least $1$ cookie, and Jane's mother baked less than $100$ cookies, how many different numbers of cookies could Jane's mother have baked? For example, she could have baked $15$ cookies, because each child receives $2$ cookies, with $1$ left over. $\textbf{(A) }9\qquad\textbf{(B) }11\qquad\textbf{(C) }14\qquad\textbf{(D) }15\qquad\textbf{(E) }17$

a) Do there exist positive integers $a$ and $d$ such that $[a, a+d] = [a, a+2d]$? b) Do there exist positive integers $a$ and $d$ such that $[a, a+d] = [a, a+4d]$? Here $[a, b]$ denotes the least common multiple of integers $a, b$.

[b]p1.[/b] Find all prime factors of $8051$. [b]p2.[/b] Simplify $$[\log_{xyz}(x^z)][1 + \log_x y + \log_x z],$$ where $x = 628$, $y = 233$, $z = 340$. [b]p3.[/b] In prokaryotes, translation of mRNA messages into proteins is most often initiated at start codons on the mRNA having the sequence AUG. Assume that the mRNA is single-stranded and consists of a sequence of bases, each described by a single letter A,C,U, or G. Consider the set of all pieces of bacterial mRNA six bases in length. How many such mRNA sequences have either no A’s or no U’s? [b]p4.[/b] What is the smallest positive $n$ so that $17^n + n$ is divisible by $29$? [b]p5.[/b] The legs of the right triangle shown below have length $a = 255$ and $b = 32$. Find the area of the smaller rectangle (the one labeled $R$). [img]https://cdn.artofproblemsolving.com/attachments/c/d/566f2ce631187684622dfb43f36c7e759e2f34.png[/img] [b]p6.[/b] A $3$ dimensional cube contains ”cubes” of smaller dimensions, ie: faces ($2$-cubes),edges ($1$-cubes), and vertices ($0$-cubes). How many 3-cubes are in a $5$-cube? PS. You had better use hide for answers.

$k$ and $n$ are positive integers that are greater than $1$. $N$ is the set of positive integers. $A_1, A_2, \cdots A_k$ are pairwise not-intersecting subsets of $N$ and $A_1 \cup A_2 \cup \cdots \cup A_k = N$. Prove that for some $i \in \{ 1,2,\cdots,k \}$, there exsits infinity many non-factorable n-th degree polynomials so that coefficients of one polynomial are pairwise distinct and all the coeficients are in $A_i$.

Quadratics $g(x) = ax^2 + bx + c$ and $h(x) = dx^2 + ex + f$ are such that the six roots of $g,h$, and $g - h$ are distinct real numbers (in particular, they are not double roots) forming an arithmetic progression in some order. Determine all possible values of $a/d$.

Find all functions $f: \mathbb{R}^{\ge 0} \to \mathbb{R}^{\ge 0}$ such that: $f(x^3+xf(xy))=f(xy)+x^2f(x+y) \forall x,y \in \mathbb{R}^{\ge 0}$

Given a non-right triangle $ABC$ with $BC>AC>AB$. Two points $P_1 \neq P_2$ on the plane satisfy that, for $i=1,2$, if $AP_i, BP_i$ and $CP_i$ intersect the circumcircle of the triangle $ABC$ at $D_i, E_i$, and $F_i$, respectively, then $D_iE_i \perp D_iF_i$ and $D_iE_i = D_iF_i \neq 0$. Let the line $P_1P_2$ intersects the circumcircle of $ABC$ at $Q_1$ and $Q_2$. The Simson lines of $Q_1$, $Q_2$ with respect to $ABC$ intersect at $W$. Prove that $W$ lies on the nine-point circle of $ABC$.

In triangle $ABC$ with incenter $I$ and circumcenter $O$, let $A',B',C'$ be the points of tangency of its circumcircle with its $A,B,C$-mixtilinear circles, respectively. Let $\omega_A$ be the circle through $A'$ that is tangent to $AI$ at $I$, and define $\omega_B, \omega_C$ similarly. Prove that $\omega_A,\omega_B,\omega_C$ have a common point $X$ other than $I$, and that $\angle AXO = \angle OXA'$. [i]Proposed by Sammy Luo[/i]

The numbers $x, y, z, t, a$ and $b$ are positive integers, so that $xt-yz = 1$ and $$\frac{x}{y} \ge \frac{a}{b} \ge \frac{z}{t} .$$Prove that $$ab \le (x + z) (y +t)$$

Alex and Bob play a game 2015 x 2015 checkered board by the following rules.Initially the board is empty: the players move in turn, Alex moves first. By a move, a player puts either red or blue token into any unoccopied square. If after a player's move there appears a row of three consecutive tokens of the same color( this row may be vertical,horizontal, or dioganal), then this player wins. If all the cells are occupied by tokens, but no such row appears, then a draw is declared.Determine whether Alex, Bob, or none of them has winning strategy.

Prove that for any positive integer $k$ there exist $k$ pairwise distinct integers for which the sum of their squares equals the sum of their cubes.

Suppose $V= \mathbb{Z}_2^n$ and for a vector $x=(x_1,..x_n)$ in $V$ and permutation $\sigma$.We have $x_{\sigma}=(x_{\sigma(1)},...,x_{\sigma(n)})$ Suppose $ n=4k+2,4k+3$ and $f:V \to V$ is injective and if $x$ and $y$ differ in more than $n/2$ places then $f(x)$ and $f(y)$ differ in more than $n/2$ places. Prove there exist permutaion $\sigma$ and vector $v$ that $f(x)=x_{\sigma}+v$

A triangle $ABC$ is inscribed in a circle $\omega$. A variable line $\ell$ chosen parallel to $BC$ meets segments $AB$, $AC$ at points $D$, $E$ respectively, and meets $\omega$ at points $K$, $L$ (where $D$ lies between $K$ and $E$). Circle $\gamma_1$ is tangent to the segments $KD$ and $BD$ and also tangent to $\omega$, while circle $\gamma_2$ is tangent to the segments $LE$ and $CE$ and also tangent to $\omega$. Determine the locus, as $\ell$ varies, of the meeting point of the common inner tangents to $\gamma_1$ and $\gamma_2$. [i](Russia) Vasily Mokin and Fedor Ivlev[/i]

There are three candidates in the Hundilaane forest governor elections: $A, B$ and $C$. For each of the $20$ forest dwellers, the names of all three candidates were written on the ballot paper in the order of their preference. Examination of the ballots revealed that $11$ forest dwellers prefer $A$, $12$ $B$ and $14$ $C$. Which of the candidates will be marked first on the largest number of ballot papers when it is known that each possible the order of the candidates appears on at least one ballot?

$\boxed{N1}$Let $n$ be a positive integer,$g(n)$ be the number of positive divisors of $n$ of the form $6k+1$ and $h(n)$ be the number of positive divisors of $n$ of the form $6k-1,$where $k$ is a nonnegative integer.Find all positive integers $n$ such that $g(n)$ and $h(n)$ have different parity.

Find all couples of natural numbers $(a,b)$ not relatively prime ($\gcd(a,b)\neq\ 1$) such that \[\gcd(a,b)+9\operatorname{lcm}[a,b]+9(a+b)=7ab.\]

The surface area and the volume of a cube are numerically equal. Find the cube’s volume.

Divide each side of a triangle into $50$ equal parts, and each point of the division is joined to the opposite vertex by a segment. Calculate the number of intersection points determined by these segments. Clarification : the vertices of the original triangle are not considered points of intersection or division.

Regular hexagon $ABCDEF$ is inscribed in rectangle $PQRS$ with $AB = 1$, A and $B$ on side $PQ$, $C$ on side $QR$, $D$ and $E$ on side $RS$, and $F$ on side $SP$. What is the area of $PQRS$?

The number of real quadruples $(x,y,z,w)$ satisfying $x^3+2=3y, y^3+2=3z, z^3+2=3w, w^3+2=3x$ is $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ \text{None}$

Determine all integers $n \ge 3$ whose decimal expansion has less than $20$ digits, such that every quadratic non-residue modulo $n$ is a primitive root modulo $n$. [i]An integer $a$ is a quadratic non-residue modulo $n$, if there is no integer $b$ such that $a - b^2$ is divisible by $n$. An integer $a$ is a primitive root modulo $n$, if for every integer $b$ relatively prime to n there is a positive integer $k$ such that $a^k - b$ is divisible by $n$.[/i]

Let $\{a_n\}$ be a sequence of positive terms such that $a_{n+1}=a_n+ \frac{n^2}{a_n}$ . Let $b_n =a_n-n$ . (1) Are there infinitely many $n$ such that $b_n \ge 0$ ? (2) Prove that there is a positive number $M$ such that $\sum^{\infty}_{n=3} \frac{b_n}{n+1}<M$.

Define $f(x)$ as $\frac{x^2-x-2}{x^2+x-6}$. $f(f(f(f(1))))$ can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p,q$. Find $10p+q$.

$ a_1, a_2, \ldots, a_n$ are integers, not all equal. Prove that there exist infinitely many prime numbers $ p$ such that for some $ k$ \[ p\mid a_1^k \plus{} \dots \plus{} a_n^k.\]