Carrie has a rectangular garden that measures $6$ feet by $8$ feet. She plants the entire garden with strawberry plants. Carrie is able to plant $4$ strawberry plants per square foot, and she harvests an average of $10$ strawberries per plant. How many strawberries can she expect to harvest? $\textbf{(A)}\ 560 \qquad \textbf{(B)}\ 960 \qquad \textbf{(C)}\ 1120 \qquad \textbf{(D)}\ 1920 \qquad \textbf{(E)}\ 3840$

Let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a function that admits a primitive $ F. $ [b]a)[/b] Show that there exists a real number $ c $ such that $ f(c)-F(c)>1 $ if $ \lim_{x\to\infty } \frac{1+F(x)}{e^x} =-\infty . $ [b]b)[/b] Prove that there exists a real number $ c' $ such that $ f(c') -(F(c'))^2<1. $ [i]Cristinel Mortici[/i]

On each of the $2014^2$ squares of a $2014 \times 2014$-board a light bulb is put. Light bulbs can be either on or off. In the starting situation a number of the light bulbs is on. A move consists of choosing a row or column in which at least $1007$ light bulbs are on and changing the state of all $2014$ light bulbs in this row or column (from on to off or from off to on). Find the smallest non-negative integer $k$ such that from each starting situation there is a finite sequence of moves to a situation in which at most $k$ light bulbs are on.

General Tilly and the Duke of Wallenstein play "Divide and rule!" (Divide et impera!). To this end, they arrange $N$ tin soldiers in $M$ companies and command them by turns. Both of them must give a command and execute it in their turn. Only two commands are possible: The command "[i]Divide![/i]" chooses one company and divides it into two companies, where the commander is free to choose their size, the only condition being that both companies must contain at least one tin soldier. On the other hand, the command "[i]Rule![/i]" removes exactly one tin soldier from each company. The game is lost if in your turn you can't give a command without losing a company. Wallenstein starts to command. a) Can he force Tilly to lose if they start with $7$ companies of $7$ tin soldiers each? b) Who loses if they start with $M \ge 1$ companies consisting of $n_1 \ge 1, n_2 \ge 1, \dotsc, n_M \ge 1$ $(n_1+n_2+\dotsc+n_M=N)$ tin soldiers?

Sam spends his days walking around the following $2\times 2$ grid of squares. \begin{tabular}[t]{|c|c|}\hline 1&2\\ \hline 4&3 \\ \hline \end{tabular} Say that two squares are adjacent if they share a side. He starts at the square labeled $1$ and every second walks to an adjacent square. How many paths can Sam take so that the sum of the numbers on every square he visits in his path is equal to $20$ (not counting the square he started on)?

Give a triangle $ABC$ with heights $h_a = 3$ cm, $h_b = 7$ cm and $h_c = d$ cm, where $d$ is an integer. Determine $d$.

Let $E$ be a point lies inside the parallelogram $ABCD$ such that $\angle BCE = \angle BAE$. Prove that the circumcenters of triangles $ABE,BCE,CDE,DAE$ are concyclic.

Let $f(n)$ denote the number of permutations $(a_{1}, a_{2}, \ldots ,a_{n})$ of the set $\{1,2,\ldots,n\}$, which satisfy the conditions: $a_{1}=1$ and $|a_{i}-a_{i+1}|\leq2$, for any $i=1,2,\ldots,n-1$. Prove that $f(2006)$ is divisible by 3.

$n$ is a positive integer, $F_n=2^{2^{n}}+1$. Prove that for $n \geq 3$, there exists a prime factor of $F_n$ which is larger than $2^{n+2}(n+1)$.

The vertices of a cube have coordinates $(0,0,0),(0,0,4),(0,4,0),(0,4,4),(4,0,0)$,$(4,0,4),(4,4,0)$, and $(4,4,4)$. A plane cuts the edges of this cube at the points $(0,2,0),(1,0,0),(1,4,4)$, and two other points. Find the coordinates of the other two points.

A quadrilateral $ABCD$ is inscribed in a circle of center $O$. It is known that the diagonals $AC$ and $BD$ are perpendicular. On each side we build semicircles, externally, as shown in the figure. a) Show that the triangles $AOB$ and $COD$ have the equal areas. b) If $AC=8$ cm and $BD= 6$ cm, determine the area of the shaded region.

The quadratic equation $ax^2 + bx + c = 0$ has its roots in the interval $[0, 1]$. Find the maximum of $\frac{(a - b)(2a - b)}{a(a - b + c)}$.

We say that a positive integer is [i]irregular [/i] if said number is not a multiple of none of its digits. For example, $203$ is irregular because $ 203$ is not a multiple of $2$, it is not multiple of $0$ and is not a multiple of $3$. Consider a set consisting of $n$ consecutive positive integers. If all the numbers in that set are irregular, determine the largest possible value of $n$.

On a line are given $n$ blue and $n$ red points. Prove that the sum of distances between pairs of points of the same color does not exceed the sum of distances between pairs of points of different colors. (O. Musin)

An acute triangle has area $84$ and perimeter $42$, with each side being at least $10$ units long. Let $S$ be the set of points that are within $5$ units of some vertex of the triangle. What fraction of the area of $S$ lies outside the triangle? [i]Proposed by Nathan Ramesh

Simplify $$\dbinom{2020}{1010}\dbinom{1010}{1010}+\dbinom{2019}{1010}\dbinom{1011}{1010}+\cdots+\dbinom{1011}{1010}\dbinom{2019}{1010} + \dbinom{1010}{1010}\dbinom{2020}{1010}.$$

For a positive integer $N$, let $f_N$ be the function defined by \[ f_N (x)=\sum_{n=0}^N \frac{N+1/2-n}{(N+1)(2n+1)} \sin\left((2n+1)x \right). \] Determine the smallest constant $M$ such that $f_N (x)\le M$ for all $N$ and all real $x$.

Nathaniel and Obediah play a game in which they take turns rolling a fair six-sided die and keep a running tally of the sum of the results of all rolls made. A player wins if, after he rolls, the number on the running tally is a multiple of 7. Play continues until either player wins, or else indenitely. If Nathaniel goes first, determine the probability that he ends up winning.

Let $ S \equal{} \{0,1,2,\ldots,1999\}$ and $ T \equal{} \{0,1,2,\ldots \}.$ Find all functions $ f: T \mapsto S$ such that [b](i)[/b] $ f(s) \equal{} s \quad \forall s \in S.$ [b](ii)[/b] $ f(m\plus{}n) \equal{} f(f(m)\plus{}f(n)) \quad \forall m,n \in T.$

At the ends of a checkered strip measuring $1 \times 101$ squares there are two chips: on the left is the chip of the first player, on the right is the second. Per turn dares to move his piece in the direction of the opposite edge of the strip by 1, 2, 3 or 4 cells. In this case, you are allowed to jump over opponent's chip, but it is forbidden to place your chip on the same square with her. The first one to reach the opposite edge of the strip wins. Who wins if the game is played correctly: the one who goes first, or him rival?

Find the maximum value of the real constant $C$ such that $x^{2}+y^{2}+1\geq C(x+y)$, and $ x^{2}+y^{2}+xy+1\geq C(x+y)$ for all reals $x,y$.

Find the maximum value of an integer $B$ such that for every 9 distinct natural number with the sum of $2023$, there must exist a sum of 4 of the number that is greater than or equal to $B$

Let $f(x)=x^2-3x+1,$ and let $\alpha_1, \alpha_2, \alpha_3, \alpha_4$ be the $4$ roots of $f(f(x))=x.$ Evaluate $\lfloor 10\alpha_1\rfloor+ $ $\lfloor 10\alpha_2\rfloor$ $+$ $\lfloor 10\alpha_3\rfloor+\lfloor 10\alpha_4\rfloor.$

There is a set of cards with numbers from $1$ to $30$ (which may be repeated) . Each student takes one such card. The teacher can perform the following operation: He reads a list of such numbers (possibly only one) and then asks the students to raise an arm if their number was in this list. How many times must he perform such an operation in order to determine the number on each student 's card? (Indicate the number of operations and prove that it is minimal . Note that there are not necessarily 30 students.)

Let $0<x_{1},x_{2},x_{3},x_{4}\leq\frac{1}{2}$ are real numbers. Prove that $\frac{x_{1}x_{2}x_{3}x_{4}}{(1-x_{1})(1-x_{2})(1-x_{3})(1-x_{4})}\leq\frac{x_{1}^{4}+x_{2}^{4}+x_{3}^{4}+x_{4}^{4}}{(1-x_{1})^{4}+(1-x_{2})^{4}+(1-x_{3})^{4}+(1-x_{4})^{4}}$.