2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.

Each of the points $A$, $B$, $C$, $D$, $E$, and $F$ in the figure below represent a different digit from 1 to 6. Each of the five lines shown passes through some of these points. The digits along the line each are added to produce 5 sums, one for each line. The total of the sums is $47$. What is the digit represented by $B$? [asy] size(200); dotfactor = 10; pair p1 = (-28,0); pair p2 = (-111,213); draw(p1--p2,linewidth(1)); pair p3 = (-160,0); pair p4 = (-244,213); draw(p3--p4,linewidth(1)); pair p5 = (-316,0); pair p6 = (-67,213); draw(p5--p6,linewidth(1)); pair p7 = (0, 68); pair p8 = (-350,10); draw(p7--p8,linewidth(1)); pair p9 = (0, 150); pair p10 = (-350, 62); draw(p9--p10,linewidth(1)); pair A = intersectionpoint(p1--p2, p5--p6); dot("$A$", A, 2*W); pair B = intersectionpoint(p5--p6, p3--p4); dot("$B$", B, 2*WNW); pair C = intersectionpoint(p7--p8, p5--p6); dot("$C$", C, 1.5*NW); pair D = intersectionpoint(p3--p4, p7--p8); dot("$D$", D, 2*NNE); pair EE = intersectionpoint(p1--p2, p7--p8); dot("$E$", EE, 2*NNE); pair F = intersectionpoint(p1--p2, p9--p10); dot("$F$", F, 2*NNE); [/asy] $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Let $A$ be a set of numbers chosen from $1,2,..., 2015$ with the property that any two distinct numbers, say $x$ and $y$, in $A$ determine a unique isosceles triangle (which is non equilateral) whose sides are of length $x$ or $y$. What is the largest possible size of $A$?

Let $\triangle ABC$ be a acute triangle. Let $H$ the foot of the C-altitude in $AB$ such that $AH=3BH$, let $M$ and $N$ the midpoints of $AB$ and $AC$ and let $P$ be a point such that $NP=NC$ and $CP=CB$ and $B$, $P$ are located on different sides of the line $AC$. Prove that $\measuredangle APM=\measuredangle PBA$.

Prove that the circumcircle of a triangle contains exactly 3 points whose Simson lines are tangent to the triangle's Euler circle and these points are the vertices of an equilateral triangle.

What is the $100^\text{th}$ digit to the right of the decimal point in the decimal form of $4/37$? $\text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 2 \qquad \text{(D)}\ 7 \qquad \text{(E)}\ 8$

In $\triangle ABC$ with incenter $I$, $AB = 61$, $AC = 51$, and $BC=71$. The circumcircles of triangles $AIB$ and $AIC$ meet line $BC$ at points $D$ ($D \neq B$) and $E$ ($E \neq C$), respectively. Determine the length of segment $DE$. [i]James Tao[/i]

[b]p1.[/b] In triangle $ABC$, the median $BM$ is drawn. The length $|BM| = |AB|/2$. The angle $\angle ABM = 50^o$. Find the angle $\angle ABC$. [b]p2.[/b] Is there a positive integer $n$ which is divisible by each of $1, 2,3,..., 2018$ except for two numbers whose difference is$ 7$? [b]p3.[/b] Twenty numbers are placed around the circle in such a way that any number is the average of its two neighbors. Prove that all of the numbers are equal. [b]p4.[/b] A finite number of frogs occupy distinct integer points on the real line. At each turn, a single frog jumps by $1$ to the right so that all frogs again occupy distinct points. For some initial configuration, the frogs can make $n$ moves in $m$ ways. Prove that if they jump by $1$ to the left (instead of right) then the number of ways to make $n$ moves is also $m$. [b]p5.[/b] A square box of chocolates is divided into $49$ equal square cells, each containing either dark or white chocolate. At each move Alex eats two chocolates of the same kind if they are in adjacent cells (sharing a side or a vertex). What is the maximal number of chocolates Alex can eat regardless of distribution of chocolates in the box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The point $E$ is taken inside the square $ABCD$, the point $F$ is taken outside, so that the triangles $ABE$ and $BCF$ are congruent . Find the angles of the triangle $ABE$, if it is known that$EF$ is equal to the side of the square, and the angle $BFD$ is right.

Find the value of real parameter $ a$ such that $ 2$ is the smallest integer solution of \[ \frac{x\plus{}\log_2 (2^x\minus{}3a)}{1\plus{}\log_2 a} >2.\]

In the game of [i]Ring Mafia[/i], there are $2019$ counters arranged in a circle. $673$ of these counters are mafia, and the remaining $1346$ counters are town. Two players, Tony and Madeline, take turns with Tony going first. Tony does not know which counters are mafia but Madeline does. On Tony’s turn, he selects any subset of the counters (possibly the empty set) and removes all counters in that set. On Madeline’s turn, she selects a town counter which is adjacent to a mafia counter and removes it. Whenever counters are removed, the remaining counters are brought closer together without changing their order so that they still form a circle. The game ends when either all mafia counters have been removed, or all town counters have been removed. Is there a strategy for Tony that guarantees, no matter where the mafia counters are placed and what Madeline does, that at least one town counter remains at the end of the game? [i]Proposed by Andrew Gu[/i]

Do there exist infinitely many quadruples $(a,b,c,d)$ of positive integers such that the number $a^{a!} + b^{b!} - c^{c!} - d^{d!}$ is prime and $2 \leq d \leq c \leq b \leq a \leq d^{2024}$?

How many non-intersecting pairs of paths we have from (0,0) to (n,n) so that path can move two ways:top or right?

You are given a ruler with two parallel straight edges a distance $d$ apart. It may be used (1) to draw the line through two points, (2) given two points a distance $\ge d$ apart, to draw two parallel lines, one through each point, (3) to draw a line parallel to a given line, a distance d away. One can also (4) choose an arbitrary point in the plane, and (5) choose an arbitrary point on a line. Show how to construct : (A) the bisector of a given angle, and (B) the perpendicular to the midpoint of a given line segment.

Consider the function $f_k:\mathbb{Z}^{+}\rightarrow\mathbb{Z}^{+}$ satisfying \[f_k(x)=x+k\varphi(x)\] where $\varphi(x)$ is Euler's totient function, that is, the number of positive integers up to $x$ coprime to $x$. We define a sequence $a_1,a_2,...,a_{10}$ with [list] [*] $a_1=c$, and [*] $a_n=f_k(a_{n-1}) \text{ }\forall \text{ } 2\le n\le 10$ [/list] Is it possible to choose the initial value $c\ne 1$ such that each term is a multiple of the previous, if (a) $k=2025$ ? (b) $k=2065$ ? [i]Proposed by chorn[/i]

The circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$, point $M$ is the midpoint of $AB$. On line $AB$ select points $S_1$ and $S_2$. Let $S_1X_1$ and $S_1Y_1$ be tangents drawn from $S_1$ to circle $\omega_1$, similarly $S_2X_2$ and $S_2Y_2$ are tangents drawn from $S_2$ to circles $\omega_2$. Prove that if the point $M$ lies on the line $X_1X_2$, then it also lies on the line $Y_1Y_2$.

Let $A$ and $B$ are two points on a plane, and let $M$ be the midpoint of $AB$. Let $r$ be a line and let $R$ and $S$ be the projections of $A$ and $B$ onto $r$. Assuming that $A$, $M$, and $R$ are not collinear, prove that the circumcircle of triangle $AMR$ has the same radius as the circumcircle of $BSM$.

Let $S$ be the set of all ordered pairs of integers $(m,n)$ satisfying $m>0$ and $n<0.$ Let $<$ be a partial ordering on $S$ defined by the statement $(m,n)<(m',n')$ if and only if $m\le m'$ and $n\le n'.$ An example is $(5,-10)<(8,-2).$ Now let $O$ be a completely ordered subset of $S,$ in other words if $(a,b)\in O$ and $(c,d) \in O,$ then $(a,b)<(c,d)$ or $(c,d)<(a,b).$ Also let $O'$ denote the collection of all such completely ordered sets. (a) Determine whether and arbitrary $O\in O'$ is finite. (b) Determine whether the carnality $|O|$ of $O$ is bounded for $O\in O'.$ (c) Determine whether $|O|$ can be countable infinite for any $O\in O'.$

Let $A$ be a $n\times n$ complex matrix whose eigenvalues have absolute value at most $1$. Prove that $$ \|A^n\|\le \dfrac{n}{\ln 2} \|A\|^{n-1}. $$ (Here $\|B\|=\sup\limits_{\|x\|\leq 1} \|Bx\|$ for every $n\times n$ matrix $B$ and $\|x\|=\sqrt{\sum\limits_{i=1}^n |x_i|^2}$ for every complex vector $x\in\mathbb{C}^n$.) (Proposed by Ian Morris and Fedor Petrov, St. Petersburg State University)

Let the set $M =\{\frac{1998}{1999},\frac{1999}{2000} \}$. The set $M$ is completed with new fractions according to the rule: take two distinct fractions$ \frac{p_1}{q_1}$ and $\frac{p_2}{q_2}$ from $M$ thus there are no other numbers in $M$ located between them and a new fraction is formed, $\frac{p_1+p_2}{q_1+q_2}$ which is included in $M$, etc. Show that, after each procedure, the newly obtained fraction is irreducible and is different from the fractions previously included in $M$.

Which of the followings gives the product of the real roots of the equation $x^4+3x^3+5x^2 + 21x -14=0$? $ \textbf{(A)}\ -2 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ -14 \qquad\textbf{(D)}\ 21 \qquad\textbf{(E)}\ \text{None of the preceding} $

Find all nonnegative integers $x, y, z$ satisfying the equation $$2^x+31^y=z^2.$$

Define $S_n=\sum_{j,k=1}^{n} \frac{1}{\sqrt{j^2+k^2}}$. Find a positive constant $C$ such that the inequality $n\le S_n \le Cn$ holds for all $n \ge 3$. (Note. The smaller $C$, the better the solution.)

Consider a homogeneous function with degree $4$. $f(x,y,z)=a_1x^4+a_2y^4+a_3z^4+3a_4x^2y^2+3a_5y^2z^2+3a_6x^2z^2$. Find $\oiint_{\sum} f(x,y,z)dS$, where $\sum: x^2+y^2+z^2=1$.

Let the Sierpinski triangle graph $S_n$ be defined as follows. $S_0$ consists of three vertices and three edges in a triangle. $S_1$ consists of $6$ vertices and $9$ edges. To make $S_n+1,$ we take three copies of $S_n$ and merge vertices at the corners, where the bottom-left corner of the top copy merges with the top corner of the bottom-left copy, etc. Then the number of cycles on $S_4,$ which visit each vertex exactly once and traverse each edge at most once, can be expressed as $p_1^{e_1}p_2^{e_2}$ for some primes $p_1, p_2$ and positive integers $e_1, e_2.$ Find $p_1 + p_2 + e_1 + e_2.$ [center] [img]https://cdn.artofproblemsolving.com/attachments/6/2/51d83da65910cd32ce0b235a9615ec467870e1.png[/img] [/center]