Find all real-valued continuously differentiable functions $f$ on the real line such that for all $x$, \[ \left( f(x) \right)^2 = \displaystyle\int_0^x \left[ \left( f(t) \right)^2 + \left( f'(t) \right)^2 \right] \, \mathrm{d}t + 1990. \]

A cube is partitioned into finitely many rectangular parallelepipeds with the edges parallel to the edges of the cube. Prove that if the sum of the volumes of the circumspheres of these parallelepipeds equals the volume of the circumscribed sphere of the cube, then all the parallelepipeds are cubes.

Let $P$ be an arbitrary point on side $BC$ of triangle $ABC$. Let $K$ be the incenter of triangle $PAB$. Let the incircle of triangle $PAC$ touch $BC$ at $F$. Point $G$ on $CK$ is such that $FG // PK$. Find the locus of $G$.

An isosceles trapezoid $ABCD$, inscribed in $\omega$, satisfies $AB=CD, AD<BC, AD<CD$. A circle with center $D$ and passing $A$ hits $BD, CD, \omega$ at $E, F, P(\not= A)$, respectively. Let $AP \cap EF = Q$, and $\omega$ meet $CQ$ and the circumcircle of $\triangle BEQ$ at $R(\not= C), S(\not= B)$, respectively. Prove that $\angle BER= \angle FSC$.

Sequence $ \{a_{n}\}$ is defined by $ a_{1}= 2007,\, a_{n+1}=\frac{a_{n}^{2}}{a_{n}+1}$ for $ n \ge 1.$ Prove that $ [a_{n}] =2007-n$ for $ 0 \le n \le 1004,$ where $ [x]$ denotes the largest integer no larger than $ x.$

A [i]checkerboard[/i] is a rectangular grid of cells colored black and white such that the top-left corner is black and no two cells of the same color share an edge. Two checkerboards are [i]distinct[/i] if and only if they have a different number of rows or columns. For example, a $20 \times 25$ checkerboard and a $25 \times 20$ checkerboard are considered distinct. Compute the number of distinct checkerboards that have exactly $41$ distinct black cells.

If $a,b,$ and $c$ are digits for which \[ \begin{tabular}{cccc} & 7 & a & 2 \\ - & 4 & 8 & b\\ \hline & c & 7 & 3 \end{tabular} \] then $a+b+c =$ $\text{(A)} \ 14 \qquad \text{(B)} \ 15 \qquad \text{(C)} \ 16 \qquad \text{(D)} \ 17 \qquad \text{(E)} \ 18$

Ms. Carr asks her students to read any 5 of the 10 books on a reading list. Harold randomly selects 5 books from this list, and Betty does the same. What is the probability that there are exactly 2 books that they both select? $\textbf{(A)}\ \frac{1}{8} \qquad\textbf{(B)}\ \frac{5}{36} \qquad\textbf{(C)}\ \frac{14}{45} \qquad\textbf{(D)}\ \frac{25}{63} \qquad\textbf{(E)}\ \frac{1}{2}$

Given a quadrilateral $ ABCD $ inscribed in a circle. The images of the points $ A $ and $ C $ in symmetry with respect to the line $ BD $ are the points $ A' $ and $ C' $, respectively, and the images of the points $ B $ and $ D $ in symmetry with respect to the line $ AC $ are the points $ B'$ and $D'$ respectively. Prove that the points $ A' $, $ B' $, $ C' $, $ D' $ lie on the circle.

Fill in the spaces of the grid below with positive integers so that in each $2\times 2$ square with top left number $a$, top right number $b$, bottom left number $c$, and bottom right number $d$, either $a + d = b + c$ or $ad = bc$. You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] size(3.85cm); for (int i=0; i<=5; ++i) draw((i,0)--(i,5), linewidth(.5)); for (int j=0; j<=5; ++j) draw((0,j)--(5,j), linewidth(.5)); void draw_num(pair ll_corner, int num) { label(string(num), ll_corner + (0.5, 0.5), p = fontsize(19pt)); } draw_num((0,0), 20); draw_num((1, 0), 36); draw_num((1,4), 9); draw_num((4, 0), 32); draw_num((0, 1), 15); draw_num((0, 2), 10); draw_num((0, 4), 3); draw_num((1,3), 11); draw_num((3,3), 7); draw_num((4,3), 2); draw_num((4,2), 16); void foo(int x, int y, string n) { label(n, (x+0.5,y+0.5), p = fontsize(19pt)); } foo(2, 4, " "); foo(3, 4, " "); foo(4, 4, " "); foo(0, 3, " "); foo(2, 3, " "); foo(1, 2, " "); foo(2, 2, " "); foo(3, 2, " "); foo(1, 1, " "); foo(2, 1, " "); foo(3, 1, " "); foo(4, 1, " "); foo(2, 0, " "); foo(3, 0, " "); [/asy]

With a roller shear, rectangular sheets of $1420$ mm wide should be made, namely with a width of $500$ mm and a total length of $1000$ m as well as a width of $300$ mm and a total length of $1800$ m can be cut. So far it has been based on the attached drawing cut, in which the gray area represents the waste, which is quite large. A socialist brigade proposes cutting in such a way that waste is significantly reduced becomes. a) What percentage is the waste if cutting continues as before? b) How does the brigade have to cut so that the waste is as small as possible and what is the total length of the starting sheets is required in this case? c) What percentage is the waste now? [img]https://cdn.artofproblemsolving.com/attachments/f/8/c6c88b79abb5d34674bf54524ae1731985c3f7.png[/img]

Let $N$ be the number of ordered pairs $(x,y)$ of integers such that $x^2+xy+y^2 \le 2007$. Remember, integers may be positive, negative, or zero! (a) Prove that $N$ is odd. (b) Prove that $N$ is not divisible by $3$.

Let $r$ and $s$ be real numbers in the interval $[1, \infty)$ such that for all positive integers $a$ and $b$ with $a \mid b \implies \left\lfloor ar \right\rfloor$ divides $\left\lfloor bs \right\rfloor$. a) Prove that $\frac{s}{r}$ is a natural number. b) Show that both $r$ and $s$ are natural numbers. Here, $\lfloor x \rfloor$ denotes the greatest integer that is less than or equal to $x$.

Points $ A,B,C,D,E$ and $ F$ lie, in that order, on $ \overline{AF}$, dividing it into five segments, each of length 1. Point $ G$ is not on line $ AF$. Point $ H$ lies on $ \overline{GD}$, and point $ J$ lies on $ \overline{GF}$. The line segments $ \overline{HC}, \overline{JE},$ and $ \overline{AG}$ are parallel. Find $ HC/JE$. $ \text{(A)}\ 5/4 \qquad \text{(B)}\ 4/3 \qquad \text{(C)}\ 3/2 \qquad \text{(D)}\ 5/3 \qquad \text{(E)}\ 2$

Let $A$, $B$, $C$, and $D$ be the vertices of a regular tetrahedron, each of whose edges measures 1 meter. A bug, starting from vertex $A$, observes the following rule: at each vertex it chooses one of the three edges meeting at that vertex, each edge being equally likely to be chosen, and crawls along that edge to the vertex at its opposite end. Let $p = n/729$ be the probability that the bug is at vertex $A$ when it has crawled exactly 7 meters. Find the value of $n$.

Let $ABC$ be a triangle with centroid $G$. Let the circumcircle of triangle $AGB$ intersect the line $BC$ in $X$ different from $B$; and the circucircle of triangle $AGC$ intersect the line $BC$ in $Y$ different from $C$. Prove that $G$ is the centroid of triangle $AXY$.

Given a chord $PQ$ of a circle and $M$ the midpoint of the chord, let $AB$ and $CD$ be two chords that pass through $M$. $AC$ and $BD$ are drawn until $PQ$ is intersected at points $X$ and $Y$ respectively. Show that $X$ and $Y$ are equidistant from $M$.

The sequence of polynomials $(a_n)$ is defined by $a_0=0$, $ a_1=x+2$ and $a_n=a_{n-1}+3a_{n-1}a_{n-2} +a_{n-2}$ for $n>1$. (a) Show for all positive integers $k,m$: if $k$ divides $m$ then $a_k$ divides $a_m$. (b) Find all positive integers $n$ such that the sum of the roots of polynomial $a_n$ is an integer.

You are given a quadrilateral $ABCD$. It is known that $\angle BAC = 30^o$, $\angle D = 150^o$ and, in addition, $AB = BD$. Prove that $AC$ is the bisector of angle $C$.

Circles centered at $ A$ and $ B$ each have radius $ 2$, as shown. Point $ O$ is the midpoint of $ \overline{AB}$, and $ OA \equal{} 2\sqrt {2}$. Segments $ OC$ and $ OD$ are tangent to the circles centered at $ A$ and $ B$, respectively, and $ EF$ is a common tangent. What is the area of the shaded region $ ECODF$? [asy]unitsize(6mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=3; pair O=(0,0); pair A=(-2*sqrt(2),0); pair B=(2*sqrt(2),0); pair G=shift(0,2)*A; pair F=shift(0,2)*B; pair C=shift(A)*scale(2)*dir(45); pair D=shift(B)*scale(2)*dir(135); pair X=A+2*dir(-60); pair Y=B+2*dir(240); path P=C--O--D--Arc(B,2,135,90)--G--Arc(A,2,90,45)--cycle; fill(P,gray); draw(Circle(A,2)); draw(Circle(B,2)); dot(A); label("$A$",A,W); dot(B); label("$B$",B,E); dot(C); label("$C$",C,W); dot(D); label("$D$",D,E); dot(G); label("$E$",G,N); dot(F); label("$F$",F,N); dot(O); label("$O$",O,S); draw(G--F); draw(C--O--D); draw(A--B); draw(A--X); draw(B--Y); label("$2$",midpoint(A--X),SW); label("$2$",midpoint(B--Y),SE);[/asy]$ \textbf{(A)}\ \frac {8\sqrt {2}}{3}\qquad \textbf{(B)}\ 8\sqrt {2} \minus{} 4 \minus{} \pi \qquad \textbf{(C)}\ 4\sqrt {2}$ $ \textbf{(D)}\ 4\sqrt {2} \plus{} \frac {\pi}{8}\qquad \textbf{(E)}\ 8\sqrt {2} \minus{} 2 \minus{} \frac {\pi}{2}$

Find the integer which is closest to the value of the following expression: $$((7 + \sqrt{48})^{2023} + (7 - \sqrt{48})^{2023})^2 - ((7 + \sqrt{48})^{2023} - (7 - \sqrt{48})^{2023})^2$$

Find the maximum number of natural numbers $x_1,x_2, ... , x_m$ satisfying the conditions: a) No $x_i - x_j , 1 \le i < j \le m$ is divisible by $11$, and b) The sum $x_2x_3 ...x_m + x_1x_3 ... x_m + \cdot \cdot \cdot + x_1x_2... x_{m-1}$ is divisible by $11$.

Given positive real numbers $a,b,c$ with $ab+bc+ca\ge a+b+c$ , prove that $$(a + b + c)(ab + bc+ca) + 3abc \ge 4(ab + bc + ca).$$ (I. Gorodnin)

Let $ a,b,c,d$ be rational numbers with $ a>0$. If for every integer $ n\ge 0$, the number $ an^{3} \plus{}bn^{2} \plus{}cn\plus{}d$ is also integer, then the minimal value of $ a$ will be $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac{1}{2} \qquad\textbf{(C)}\ \frac{1}{6} \qquad\textbf{(D)}\ \text{Cannot be found} \qquad\textbf{(E)}\ \text{None}$

Prove that an arbitrary triangle can be cut into three polygons, one of which must be an obtuse triangle, so that they can then be folded into a rectangle. (Turning over parts is possible).