Let $\omega=e^{\frac{2\pi i}{2017}}$ and $\zeta = e^{\frac{2\pi i}{2019}}$. Let $S=\{(a,b)\in\mathbb{Z}\,|\,0\leq a \leq 2016, 0 \leq b \leq 2018, (a,b)\neq (0,0)\}$. Compute $$\prod_{(a,b)\in S}(\omega^a-\zeta^b).$$

Hugo, Evo, and Fidel are playing Dungeons and Dragons, which requires many twenty-sided dice. Attempting to slay Evo's [i]vicious hobgoblin +1 of viciousness,[/i] Hugo rolls $25$ $20$-sided dice, obtaining a sum of (alas!) only $70$. Trying to console him, Fidel notes that, given that sum, the product of the numbers was as large as possible. How many $2$s did Hugo roll?

Prove that there is no square with its four vertices on four concentric circles whose radii form an arithmetic progression.

Find all primes $p$ for which the quotient \[ \dfrac{2^{p-1} - 1 }{p} \] is a square.

Suppose $P,Q\in \mathbb R[x]$ that $deg\ P=deg\ Q$ and $PQ'-QP'$ has no real root. Prove that for each $\lambda \in \mathbb R$ number of real roots of $P$ and $\lambda P+(1-\lambda)Q$ are equal.

A simplified model of a bicycle of mass $M$ has two tires that each comes into contact with the ground at a point. The wheelbase of this bicycle (the distance between the points of contact with the ground) is $w$, and the center of mass of the bicycle is located midway between the tires and a height h above the ground. The bicycle is moving to the right, but slowing down at a constant rate. The acceleration has a magnitude $a$. Air resistance may be ignored. [asy] size(175); pen dps = linewidth(0.7) + fontsize(4); defaultpen(dps); draw(circle((0,0),1),black+linewidth(2.5)); draw(circle((3,0),1),black+linewidth(2.5)); draw((1.5,0)--(0,0)--(1,1.5)--(2.5,1.5)--(1.5,0)--(1,1.5),black+linewidth(1)); draw((3,0)--(2.4,1.8),black+linewidth(1)); filldraw(circle((1.5,2/3),0.05),gray); draw((1.3,1.6)--(0.7,1.6)--(0.7,1.75)--cycle,black+linewidth(1)); label("center of mass of bicycle",(2.5,1.9)); draw((1.55,0.85)--(1.8,1.8),BeginArrow); draw((4.5,-1)--(4.5,2/3),BeginArrow,EndArrow); label("$h$",(4.5,-1/6),E); draw((1.5,2/3)--(4.5,2/3),dotted); draw((0,-1)--(4.5,-1),dotted); draw((0,-5/4)--(3,-5/4),BeginArrow,EndArrow); label("$w$",(3/2,-5/4),S); draw((0,-1)--(0,-6/4),dotted); draw((3,-1)--(3,-6/4),dotted); [/asy] Case 2 ([b][u]Question 30[/u][/b]): Assume, instead, that the coefficient of sliding friction between each tire and the ground is different: $\mu_1$ for the front tire and $\mu_2$ for the rear tire. Let $\mu_1 = 2\mu_2$. Assume that both tires are skidding: sliding without rotating. What is the maximum value of $a$ so that both tires remain in contact with the ground? $ \textbf{(A)}\ \frac{wg}{h} $ $ \textbf{(B)}\ \frac{wg}{3h} $ $ \textbf{(C)}\ \frac{2wg}{3h} $ $ \textbf{(D)}\ \frac{hg}{2w}$ $ \textbf{(E)}\ \text{none of the above} $

Triangle $ABC$ is isosceles with $AB + AC$ and $BC = 65$ cm. $P$ is a point on $\overline{BC}$ such that the perpendicular distances from $P$ to $\overline{AB}$ and $\overline{AC}$ are $24$ cm and $36$ cm, respectively. The area of $\triangle ABC$, in cm$^2$, is $ \mathrm{(A) \ } 1254 \qquad \mathrm{(B) \ } 1640 \qquad \mathrm {(C) \ } 1950 \qquad \mathrm{(D) \ } 2535 \qquad \mathrm{(E) \ } 2942$

Find all positive integer $n$ satisfying the conditions $a)n^2=(a+1)^3-a^3$ $b)2n+119$ is a perfect square.

Find the smallest positive number $\lambda$, such that for any $12$ points on the plane $P_1,P_2,\ldots,P_{12}$(can overlap), if the distance between any two of them does not exceed $1$, then $\sum_{1\le i<j\le 12} |P_iP_j|^2\le \lambda$.

A positive integer is called [i]beautiful[/i] if it can be represented in the form $\dfrac{x^2+y^2}{x+y}$ for two distinct positive integers $x,y$. A positive integer that is not beautiful is [i]ugly[/i]. a) Prove that $2014$ is a product of a beautiful number and an ugly number. b) Prove that the product of two ugly numbers is also ugly.

Show that the number of ordered pairs $(S,T)$ of subsets of $[n]$ satisfying $s>|T|$ for all $s\in S$ and $t>|S|$ for all $t\in T$ is equal to the Fibonacci number $F_{2n+2}$. [color=#008000] Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?p=296007#p296007 http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=515970&hilit=Putnam+1990[/color]

Consider the sequence of numbers defined recursively by $t_1=1$ and for $n>1$ by $t_n=1+t_{(n/2)}$ when $n$ is even and by $t_n=\frac{1}{t_{(n-1)}}$ when $n$ is odd. Given that $t_n=\frac{19}{87}$, the sum of the digits of $n$ is $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 17 \qquad\textbf{(C)}\ 19 \qquad\textbf{(D)}\ 21 \qquad\textbf{(E)}\ 23$

With a compass and a ruler, split a triangle into two smaller triangles with the same sum of squares of sides.

Given a positive integer $ n\geq 2$, let $ B_{1}$, $ B_{2}$, ..., $ B_{n}$ denote $ n$ subsets of a set $ X$ such that each $ B_{i}$ contains exactly two elements. Find the minimum value of $ \left|X\right|$ such that for any such choice of subsets $ B_{1}$, $ B_{2}$, ..., $ B_{n}$, there exists a subset $ Y$ of $ X$ such that: (1) $ \left|Y\right| \equal{} n$; (2) $ \left|Y \cap B_{i}\right|\leq 1$ for every $ i\in\left\{1,2,...,n\right\}$.

Let $A$ be a given set with $n$ elements. Let $k<n$ be a given positive integer. Find the maximum value of $m$ for which it is possible to choose sets $B_i$ and $C_i$ for $i=1,2,\ldots,m$ satisfying the following conditions: [list=1] [*]$B_i\subset A,$ $|B_i|=k,$ [*]$C_i\subset B_i$ (there is no additional condition for the number of elements in $C_i$), and [*]$B_i\cap C_j\neq B_j\cap C_i$ for all $i\neq j.$ [/list]

Find all integers $n$ for which $9n + 16$ and $16n + 9$ are both perfect squares.

I define a "good day" as a day when both the day and the month evenly divide the concatenation of the two. For example, today (March $15$) is a good day since $3$ and $15$ both divide $315.$ However, March $9$ is not a good day since $9$ does not divide $39.$ How many good days are in March, April, and May combined?

On the side $ CD $ of the square $ ABCD, $ consider $ E $ for which $ \angle ABE =60^{\circ } . $ On the line $ AB, $ take the point $ F $ distinct from $ B $ such that $ BE=BF $ and such that it is on the segment $ AB, $ or $ A $ is on $ BF. $ Moreover, $ M $ is the intersection of $ EF,AD. $ [b]a)[/b] Show that $ \angle BME =75^{\circ } . $ [b]b)[/b] If the bisector of $ \angle CBE $ intersects $ CD $ in $ N, $ show that $ BMN $ is equilateral.

Prove that every polynomial is a difference of two increasing polynomials.

Let $ABC$ be an acute triangle with circumcircle $\omega$ such that $AB<AC$. Let $M$ be the midpoint of the arc $BC$ of~$\omega$ containing the point~$A$, and let $X\neq M$ be the other point on $\omega$ such that $AX=AM$. Points $E$ and $F$ are chosen on sides $AC$ and $AB$ of the triangle $ABC$ such that $EX=EC$ and $FX=FB$. Prove that $AE=AF$.

Triangle $\vartriangle ABC$ has side lengths $AB = 26$, $BC = 34$, and $CA = 24\sqrt2$. A fourth point $D$ makes a right angle $\angle BDC$. What is the smallest possible length of $\overline{AD}$?

In the plane of a triangle $ABC,$ in its exterior$,$ we draw the triangles $ABR, BCP, CAQ$ so that $\angle PBC = \angle CAQ = 45^{\circ}$, $\angle BCP = \angle QCA = 30^{\circ}$, $\angle ABR = \angle RAB = 15^{\circ}$. Prove that [b]a.)[/b] $\angle QRP = 90\,^{\circ},$ and [b]b.)[/b] $QR = RP.$

The $8 \times 8$ board is covered with the same shape as in the picture to the right (each of the shapes can be rotated $90^o$) so that any two do not overlap or extend beyond the edge of the chessboard. Determine the largest possible number of fields of this chessboard can be covered as described above. [img]https://cdn.artofproblemsolving.com/attachments/e/5/d7f44f37857eb115edad5ea26400cdca04e107.png[/img]

Coordinate axes (without any marks, with the same scale) and the graph of a quadratic trinomial $y = x^2 + ax + b$ are drawn in the plane. The numbers $a$ and $b$ are not known. How to draw a unit segment using only ruler and compass?

A square is divided into $25$ unit squares by drawing lines parallel to the sides of the square. Some diagonals of unit squares are drawn from such that two diagonals do not share points. What is the maximum number diagonals that can be drawn with this property?