Isabella uses one-foot cubical blocks to build a rectangular fort that is 12 feet long, 10 feet wide, and 5 feet high. The floor and the four walls are all one foot thick. How many blocks does the fort contain? [asy] import three; size(3inch); currentprojection=orthographic(-8,15,15); triple A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P; A = (0,0,0); B = (0,10,0); C = (12,10,0); D = (12,0,0); E = (0,0,5); F = (0,10,5); G = (12,10,5); H = (12,0,5); I = (1,1,1); J = (1,9,1); K = (11,9,1); L = (11,1,1); M = (1,1,5); N = (1,9,5); O = (11,9,5); P = (11,1,5); //outside box far draw(surface(A--B--C--D--cycle),white,nolight); draw(A--B--C--D--cycle); draw(surface(E--A--D--H--cycle),white,nolight); draw(E--A--D--H--cycle); draw(surface(D--C--G--H--cycle),white,nolight); draw(D--C--G--H--cycle); //inside box far draw(surface(I--J--K--L--cycle),white,nolight); draw(I--J--K--L--cycle); draw(surface(I--L--P--M--cycle),white,nolight); draw(I--L--P--M--cycle); draw(surface(L--K--O--P--cycle),white,nolight); draw(L--K--O--P--cycle); //inside box near draw(surface(I--J--N--M--cycle),white,nolight); draw(I--J--N--M--cycle); draw(surface(J--K--O--N--cycle),white,nolight); draw(J--K--O--N--cycle); //outside box near draw(surface(A--B--F--E--cycle),white,nolight); draw(A--B--F--E--cycle); draw(surface(B--C--G--F--cycle),white,nolight); draw(B--C--G--F--cycle); //top draw(surface(E--H--P--M--cycle),white,nolight); draw(surface(E--M--N--F--cycle),white,nolight); draw(surface(F--N--O--G--cycle),white,nolight); draw(surface(O--G--H--P--cycle),white,nolight); draw(M--N--O--P--cycle); draw(E--F--G--H--cycle); label("10",(A--B),SE); label("12",(C--B),SW); label("5",(F--B),W);[/asy] $\textbf{(A)}\ 204 \qquad \textbf{(B)}\ 280 \qquad \textbf{(C)}\ 320 \qquad \textbf{(D)}\ 340 \qquad \textbf{(E)}\ 600$

Let $p$ be a prime number. Let $\mathbb F_p$ denote the integers modulo $p$, and let $\mathbb F_p[x]$ be the set of polynomials with coefficients in $\mathbb F_p$. Define $\Psi : \mathbb F_p[x] \to \mathbb F_p[x]$ by \[ \Psi\left( \sum_{i=0}^n a_i x^i \right) = \sum_{i=0}^n a_i x^{p^i}. \] Prove that for nonzero polynomials $F,G \in \mathbb F_p[x]$, \[ \Psi(\gcd(F,G)) = \gcd(\Psi(F), \Psi(G)). \] Here, a polynomial $Q$ divides $P$ if there exists $R \in \mathbb F_p[x]$ such that $P(x) - Q(x) R(x)$ is the polynomial with all coefficients $0$ (with all addition and multiplication in the coefficients taken modulo $p$), and the gcd of two polynomials is the highest degree polynomial with leading coefficient $1$ which divides both of them. A non-zero polynomial is a polynomial with not all coefficients $0$. As an example of multiplication, $(x+1)(x+2)(x+3) = x^3+x^2+x+1$ in $\mathbb F_5[x]$. [i]Proposed by Mark Sellke[/i]

A rhombus with sidelength $1$ has an inscribed circle with radius $\frac{1}{3}.$ If the area of the rhombus can be expressed as $\frac{a}{b}$ for relatively prime, positive $a,b,$ evaluate $a+b.$ [i]Proposed by Alex Li[/i]

Given an arbitrary angle $\alpha$, compute $cos \alpha + cos \big( \alpha +\frac{2\pi }{3 }\big) + cos \big( \alpha +\frac{4\pi }{3 }\big)$ and $sin \alpha + sin \big( \alpha +\frac{2\pi }{3 } \big) + sin \big( \alpha +\frac{4\pi }{3 } \big)$ . Generalize this result and justify your answer.

Determine all tuples of positive integers $(x, y, z, t)$ such that: $$ xyz = t!$$ $$ (x+1)(y+1)(z+1) = (t+1)!$$ holds simultaneously.

What is the area of the letter $O$ made by Dürer? The two circles have a unit radius. Their centers, or the angle of a triangle formed by an intersection point of the circles is $30^o$. [img]https://cdn.artofproblemsolving.com/attachments/b/c/fe052393871a600fc262bd60047433972ae1be.png[/img]

Prove that for $k>10$ Nazar may replace in the following product some one $\cos$ by $\sin$ so that the new function $f_{1}(x)$ would satisfy inequality $|f_{1}(x)|\le 3\cdot 2^{-1-k}$ for all real $x$. \[f(x) = \cos x \cos 2x \cos 3x \dots \cos 2^{k}x \] [i]N. Agakhanov[/i]

Let $a_1, a_2, \cdots , a_n$ be real numbers, with $n\geq 3,$ such that $a_1 + a_2 +\cdots +a_n = 0$ and $$ 2a_k\leq a_{k-1} + a_{k+1} \ \ \ \text{for} \ \ \ k = 2, 3, \cdots , n-1.$$ Find the least number $\lambda(n),$ such that for all $k\in \{ 1, 2, \cdots, n\} $ it is satisfied that $|a_k|\leq \lambda (n)\cdot \max \{|a_1|, |a_n|\} .$

Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$. (a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$. (b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good

Let $\triangle ABC$ be a right-angled triangle with $\angle A = 90^{\circ}$, and $AB < AC$. Let points $D, E, F$ be located on side $BC$ such that $AD$ is the altitude, $AE$ is the internal angle bisector, and $AF$ is the median. Prove that $3AD + AF > 4AE$.

At a certain mathematical conference, every pair of mathematicians are either friends or strangers. At mealtime, every participant eats in one of two large dining rooms. Each mathematician insists upon eating in a room which contains an even number of his or her friends. Prove that the number of ways that the mathematicians may be split between the two rooms is a power of two (i.e., is of the form $ 2^k$ for some positive integer $ k$).

Find all numbers $x \in \mathbb Z$ for which the number \[x^4 + x^3 + x^2 + x + 1\] is a perfect square.

Let $S$ be the set of points $(x,y)$ in the coordinate plane such that two of the three quantities $3$, $x+2$, and $y-4$ are equal and the third of the three quantities is no greater than this common value. Which of the following is a correct description of $S$? $\textbf{(A) } \text{a single point} \qquad \textbf{(B) } \text{two intersecting lines} \\ \\ \textbf{(C) } \text{three lines whose pairwise intersections are three distinct points} \\ \\ \textbf{(D) } \text{a triangle} \qquad \textbf{(E) } \text{three rays with a common endpoint}$

Two sides of an integer sided triangle have lengths $18$ and $x$. If there are exactly $35$ possible integer $y$ such that $18,x,y$ are the sides of a non-degenerate triangle, find the number of possible integer values $x$ can have.

Let $ABCD$ be a rectangle with center $O$ such that $\angle DAC = 60^o$. Bisector of $\angle DAC$ cuts a $DC$ at $S$, $OS$ and $AD$ intersect at $L$, $BL$ and $AC$ intersect at $M$. Prove that $SM \parallel CL$.

Convex hexagon $ABCDEF$ is drawn in the plane such that $ACDF$ and $ABDE$ are parallelograms with area 168. $AC$ and $BD$ intersect at $G$. Given that the area of $AGB$ is 10 more than the area of $CGB$, find the smallest possible area of hexagon $ABCDEF$.

A positive integer $n$ is called $oeirense$ if there exist two positive integers $a$ and $b$, not necessarily distinct, such that $n=a^2+b^2$. Determine the greatest integer $k$ such that there exist infinitely many positive integers $n$ such that $n$, $n+1$, $\dots$, $n+k$ are oeirenses.

What are last three digits of $2^{2^{2004}}$ ?

Let $ABCD$ be a circumscribed quadrilateral and $M$ the centre of the incircle. There are points $P$ and $Q$ on the lines $MA$ and $MC$ such that $\angle CBA= 2\angle QBP.$ Prove that $\angle ADC = 2 \angle PDQ.$

The function $f$ is defined on the set of integers and satisfies \[ f(n)=\begin{cases} n-3 & \text{if } n\ge 1000 \\ f(f(n+5)) & \text{if } n<1000\end{cases} \] Find $f(84)$.

Each of the 12 edges of a cube is coloured either red or green. Every face of the cube has at least one red edge. What is the smallest number of red edges? $\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

While doing her homework for a Momentum Learning class, Valencia draws two intersecting segments $AB = 10$ and $CD = 7$ on a plane. Across all possible configurations of those two segments, determine the maximum possible area of quadrilateral $ACBD$.

Two players, Aurelio and Bernardo, play the following game. Aurelio begins by writing the number $1$. Next it is Bernardo's turn, who writes number $2$. From then on, each player chooses whether to add $1$ to the number just written by the previous player, or whether multiply that number by $2$. Then write the result and it's the other player's turn. The first player to write a number greater than $ 2007$ loses the game. Determine if one of the players can ensure victory no matter what the other does.

Find all functions $f : R \to R$ that satisfy $f (xy + f(xy)) = 2x f(y)$ for all $x, y \in R$

For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.