A scout troop buys $ 1000$ candy bars at a price of five for $ \$2$. They sell all the candy bars at a price of two for $ \$1$. What was their profit, in dollars? $ \textbf{(A)}\ 100 \qquad \textbf{(B)}\ 200 \qquad \textbf{(C)}\ 300 \qquad \textbf{(D)}\ 400 \qquad \textbf{(E)}\ 500$

$12$ students need to form five study groups. They will form three study groups with $2$ students each and two study groups with $3$ students each. In how many ways can these groups be formed?

In a triangle $ABC$ , let $P$ be a point on its circumscribed circle (on the arc $AC$ that does not contain $B$). Let $H,H_1,H_2$ and $H_3$ be the orthocenters of triangles $ABC, BCP, ACP$ and $ABP$, respectively. Let $L = PB \cap AC$ and $J = HH_2 \cap H_1H_3$. If $M$ and $N$ are the midpoints of $JH$ and $LP$, respectively, prove that $MN$ and $JL$ intersect at their midpoint.

Let $ K $ be the group of Klein. Prove that: [b]a)[/b] There is an unique division ring (up to isomorphism), $ D, $ such that $ (D,+)\cong K. $ [b]b)[/b] There are no division rings $ A $ such that $ (A\setminus\{ 0\} ,+)\cong K. $

Two finite sequences $a_1,a_2,...,a_n,b_1,b_2,...,b_n$ are just rearranged sequence $1, 1/2, ... , 1/n$ with $$a_1+b_1\ge a_2+b_2\ge...\ge a_n+b_n.$$ Prove that $a_m+a_n\ge 4/m$ for every $m$ ($1\le m\le n$) .

Find all positive integers $n$ with the property that the set \[\{n,n+1,n+2,n+3,n+4,n+5\}\] can be partitioned into two sets such that the product of the numbers in one set equals the product of the numbers in the other set.

Let $a, b, c, n$ be four integers, where n$\ge 2$, and let $p$ be a prime dividing both $a^2+ab+b^2$ and $a^n+b^n+c^n$, but not $a+b+c$. for instance, $a \equiv b \equiv -1 (mod \,\, 3), c \equiv 1 (mod \,\, 3), n$ a positive even integer, and $p = 3$ or $a = 4, b = 7, c = -13, n = 5$, and $p = 31$ satisfy these conditions. Show that $n$ and $p - 1$ are not coprime.

On the grid board shown, a token is placed on each white space. [img]https://cdn.artofproblemsolving.com/attachments/3/2/0060b2436edb0ce25160d2f94f379defef237c.png[/img] A move consists of choosing four squares on the board that form a "$T$" in any of the shapes shown below, and add a token to each of these four squares. [img]https://cdn.artofproblemsolving.com/attachments/8/c/3890aed5289ec9ea2d147f8000a0422c233029.png[/img] Is it possible, after carrying out several moves, to get the $25$ squares to have the same amount of chips?

An acute triangle $ABC$ is given. Let $D$ be the foot of altitude dropped for $A$. Tangents from $D$ to circles with diameters $AB$ and $AC$ intersects with the said circles at $K$ and $L$, in respective. Point $S$ in the plane is given so that $\angle ABC + \angle ABS = \angle ACB + \angle ACS = 180^\circ$. Prove that $A, K, L$ and $S$ lie on a circle.

We randomly choose 5 distinct positive integers less than or equal to 90. What is the floor of 10 times the expected value of the fourth largest number?

A segment $AB$ is given. Let $C$ be an arbitrary point of the perpendicular bisector to $AB$; $O$ be the point on the circumcircle of $ABC$ opposite to $C$; and an ellipse centred at $O$ touch $AB, BC, CA$. Find the locus of touching points of the ellipse with the line $BC$.

$A$ is the point $(1,0)$, $L$ is the line $y = kx$ (where $k > 0$). For which points $P(t,0)$ can we find a point $Q$ on $L$ such that $AQ$ and $QP$ are perpendicular?

In the unit cube, given 75 points, no three of which are collinear. Prove that there exits a triangle whose vertices are among the given points and whose area is not greater than 7/72.

A sequence of polynomials $P_m(x, y, z), m = 0, 1, 2, \cdots$, in $x, y$, and $z$ is defined by $P_0(x, y, z) = 1$ and by \[P_m(x, y, z) = (x + z)(y + z)P_{m-1}(x, y, z + 1) - z^2P_{m-1}(x, y, z)\] for $m > 0$. Prove that each $P_m(x, y, z)$ is symmetric, in other words, is unaltered by any permutation of $x, y, z.$

$x,y,z \in \mathbb{R}^+$ and $x^5+y^5+z^5=xy+yz+zx$. Prove that $$3 \ge x^2y+y^2z+z^2x$$

Let $N_0$ be the set of all non-negative integers. Let $f : N_0 \times N_0 \to N_0$ be a function such that for all non-negative integers $a,b$: $$f(a,b) = f(b,a),$$ $$f(a,0) = 0,$$ $$f(a+b,b) = f(a,b) +b.$$ Compute $$\sum_{i=0}^{30}\sum_{j=0}^{2^i-1}f(2^i, j)$$

Triangle $ ABC$ has a right angle at $ B$, $ AB \equal{} 1$, and $ BC \equal{} 2$. The bisector of $ \angle BAC$ meets $ \overline{BC}$ at $ D$. What is $ BD$? [asy]unitsize(2cm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair A=(0,1), B=(0,0), C=(2,0); pair D=extension(A,bisectorpoint(B,A,C),B,C); pair[] ds={A,B,C,D}; dot(ds); draw(A--B--C--A--D); label("$1$",midpoint(A--B),W); label("$B$",B,SW); label("$D$",D,S); label("$C$",C,SE); label("$A$",A,NW); draw(rightanglemark(C,B,A,2));[/asy]$ \textbf{(A)}\ \frac {\sqrt3 \minus{} 1}{2} \qquad \textbf{(B)}\ \frac {\sqrt5 \minus{} 1}{2} \qquad \textbf{(C)}\ \frac {\sqrt5 \plus{} 1}{2} \qquad \textbf{(D)}\ \frac {\sqrt6 \plus{} \sqrt2}{2}$ $ \textbf{(E)}\ 2\sqrt3 \minus{} 1$

Let $ABC$ be a triangle with $\angle A=\angle C=30^{\circ}.$ Points $D,E,F$ are chosen on the sides $AB,BC,CA$ respectively so that $\angle BFD=\angle BFE=60^{\circ}.$ Let $p$ and $p_1$ be the perimeters of the triangles $ABC$ and $DEF$, respectively. Prove that $p\le 2p_1.$

In a cyclic quadrilateral $ABCD$, the diagonals meet at point $E$, the midpoint of side $AB$ is $F$, and the feet of perpendiculars from $E$ to the lines $DA,AB$ and $BC$ are $P,Q$ and $R$, respectively. Prove that the points $P,Q,R$ and $F$ are concyclic.

A graph $G=(V,E)$ is given. If at least $n$ colors are required to paints its vertices so that between any two same colored vertices no edge is connected, then call this graph ''$n-$colored''. Prove that for any $n \in \mathbb{N}$, there is a $n-$colored graph without triangles.

Given the linear fractional transformation of $x$ into $f_1(x) = \tfrac{2x-1}{x+1},$ define $f_{n+1}(x) = f_1(f_n(x))$ for $n=1,2,3,\ldots.$ It can be shown that $f_{35} = f_5.$ Determine $A,B,C,D$ so that $f_{28}(x) = \tfrac{Ax+B}{Cx+D}.$

Square $ABCD$ is cut by a line segment $EF$ into two rectangles $AEFD$ and $BCFE$. The lengths of the sides of each of these rectangles are positive integers. It is known that the area of the rectangle $AEFD$ is $30$ and it is larger than the area of the rectangle $BCFE$. Find the area of square $ABCD$. [i]Proposed by Bogdan Rublov[/i]

Let $n$ and $k$ be given relatively prime natural numbers, $k<n.$ Each number in the set $M=\{1,2,...,n-1\}$ is colored either blue or white. It is given that [list] [*] for each $i\in M,$ both $i$ and $n-i$ have the same color, [*] for each $i\in M,i\ne k,$ both $i$ and $\left \vert i-k \right \vert $ have the same color. [/list] Prove that all numbers in $M$ have the same color.

Let $d(n)$ be the quantity of positive divisors of $n$, for example $d(1)=1,d(2)=2,d(10)=4$. The [b]size[/b] of $n$ is $k$ if $k$ is the least positive integer, such that $d^k(n)=2$. Note that $d^s(n)=d(d^{s-1}(n))$. a) How many numbers in the interval $[3,1000]$ have size $2$ ? b) Determine the greatest size of a number in the interval $[3,1000]$.

A positive integer $n$ is $inverosimil$ if there exists $n$ integers not necessarily distinct such that the sum and the product of this integers are equal to $n$. How many positive integers less than or equal to $2022$ are $inverosimils$?