A function $g$ defined for all positive integers $n$ satisfies [list][*]$g(1) = 1$; [*]for all $n\ge 1$, either $g(n+1)=g(n)+1$ or $g(n+1)=g(n)-1$; [*]for all $n\ge 1$, $g(3n) = g(n)$; and [*]$g(k)=2001$ for some positive integer $k$.[/list] Find, with proof, the smallest possible value of $k$.

Find the functions $f(x),\ g(x)$ such that $f(x)=e^{x}\sin x+\int_0^{\pi} ug(u)\ du$ $g(x)=e^{x}\cos x+\int_0^{\pi} uf(u)\ du$

Suppose you have $15$ circles of radius $1$. Compute the side length of the smallest equilateral triangle that could possibly contain all the circles, if you are free to arrange them in any shape, provided they don’t overlap.

As shown in the following figure, a heart is a shape consist of three semicircles with diameters $AB$, $BC$ and $AC$ such that $B$ is midpoint of the segment $AC$. A heart $\omega$ is given. Call a pair $(P, P')$ bisector if $P$ and $P'$ lie on $\omega$ and bisect its perimeter. Let $(P, P')$ and $(Q,Q')$ be bisector pairs. Tangents at points $P, P', Q$, and $Q'$ to $\omega$ construct a convex quadrilateral $XYZT$. If the quadrilateral $XYZT$ is inscribed in a circle, find the angle between lines $PP'$ and $QQ'$. [img]https://cdn.artofproblemsolving.com/attachments/3/c/8216889594bbb504372d8cddfac73b9f56e74c.png[/img] [i]Proposed by Mahdi Etesamifard - Iran[/i]

Find the minimum positive value of $ 1*2*3*4*...*2020*2021*2022$ where you can replace $*$ as $+$ or $-$

Imagine a regular a $2015$-gon with edge length $2$. At each vertex, draw a unit circle centered at that vertex and color the circle’s circumference orange. Now, another unit circle $S$ is placed inside the polygon such that it is externally tangent to two adjacent circles centered at the vertices. This circle $S$ is allowed to roll freely in the interior of the polygon as long as it remains externally tangent to the vertex circles. As it rolls, $S$ turns the color of any point it touches into black. After it rolls completely around the interior of the polygon, the total length of the black lengths can be expressed in the form $\tfrac{p\pi}{q}$ for positive integers $p, q$ satisfying $\gcd(p, q) = 1$. What is $p + q$?

Let $f(x) = (x^2+3x+2)^{\cos(\pi x)}$. Find the sum of all positive integers $n$ for which \[\left| \sum_{k=1}^n \log_{10} f(k) \right| = 1.\]

For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim. Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant? [i]Proposed by Brandon Wang and Edward Wan[/i]

A circle passes through the three vertices of an isosceles triangle that has two sides of length $ 3$ and a base of length $ 2$. What is the area of this circle? $ \textbf{(A)}\ 2\pi\qquad \textbf{(B)}\ \frac {5}{2}\pi\qquad \textbf{(C)}\ \frac {81}{32}\pi\qquad \textbf{(D)}\ 3\pi\qquad \textbf{(E)}\ \frac {7}{2}\pi$

We call two non-constant polynomials [i]friendly[/i] if each of them has only real roots, and every root of one polynomial is also a root of the other. For two friendly polynomials \( P(x), Q(x) \) and a constant \( C \in \mathbb{R}, C \neq 0 \), it is given that \( P(x) + C \) and \( Q(x) + C \) are also friendly polynomials. Prove that \( P(x) \equiv Q(x) \).

A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number. (Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)

[size=130]In $\triangle ABC$, $\angle A=60^\circ$. $\odot I$ is the incircle of $\triangle ABC$. $\odot I$ is tangent to sides $AB$, $AC$ at $D$, $E$, respectively. Line $DE$ intersects line $BI$ and $CI$ at $F$, $G$ respectively. Prove that [/size]$FG=\frac{BC}{2}$.

What is the value of $$(\sqrt{2}-1)^4+\frac{1}{(\sqrt{2}-1)^4}?$$ $\textbf{(A) }32-16\sqrt{2}\qquad\textbf{(B) }30\qquad\textbf{(C) }34\qquad\textbf{(D) }15+15\sqrt{2}\qquad\textbf{(E) }16+16\sqrt{2}$

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, $CA = 15$. Company $XYZ$ wants to locate their base at the point $P$ in the plane minimizing the total distance to their workers, who are located at vertices $A$, $B$, and $C$. There are $1$, $5$, and $4$ workers at $A$, $B$, and $C$, respectively. Find the minimum possible total distance Company $XYZ$'s workers have to travel to get to $P$.

$ D$ is a point on the edge $ BC$ of triangle $ ABC$ such that $ AD\equal{}\frac{BD^2}{AB\plus{}AD}\equal{}\frac{CD^2}{AC\plus{}AD}$. $ E$ is a point such that $ D$ is on $ [AE]$ and $ CD\equal{}\frac{DE^2}{CD\plus{}CE}$. Prove that $ AE\equal{}AB\plus{}AC$.

What is the area of the shaded figure shown below? [asy] size(200); defaultpen(linewidth(0.4)+fontsize(12)); pen s = linewidth(0.8)+fontsize(8); pair O,X,Y; O = origin; X = (6,0); Y = (0,5); fill((1,0)--(3,5)--(5,0)--(3,2)--cycle, palegray+opacity(0.2)); for (int i=1; i<7; ++i) { draw((i,0)--(i,5), gray+dashed); label("${"+string(i)+"}$", (i,0), 2*S); if (i<6) { draw((0,i)--(6,i), gray+dashed); label("${"+string(i)+"}$", (0,i), 2*W); } } label("$0$", O, 2*SW); draw(O--X+(0.15,0), EndArrow); draw(O--Y+(0,0.15), EndArrow); draw((1,0)--(3,5)--(5,0)--(3,2)--(1,0), black+1.5); [/asy]

There are $\frac{k(k+1)}{2}+1$ points on the planes, some are connected by disjoint segments ( also point can not lies on segment, that connects two other points). It is true, that plane is divided to some parallelograms and one infinite region. What maximum number of segments can be drawn ? [i] A.Kupavski, A. Polyanski[/i]

In the plane of the triangle $ ABC $ a straight line moves which intersects the sides $ AC $ and $ BC $ in such points $ D $ and $ E $ that $ AD = BE $. Find the locus of the midpoint $ M $ of the segment $ DE $.

Find all functions $f (x) : Z \to Z$ defined on integers, take integer values, and for all $x,y \in Z$ satisfy $$f(x+y)+f(xy)=f(x)f(y)+1$$

Consider the following $100$ sets of $10$ elements each: \begin{align*} &\{1,2,3,\cdots,10\}, \\ &\{11,12,13,\cdots,20\},\\ &\{21,22,23,\cdots,30\},\\ &\vdots\\ &\{991,992,993,\cdots,1000\}. \end{align*} How many of these sets contain exactly two multiples of $7$? $\textbf{(A)} 40\qquad\textbf{(B)} 42\qquad\textbf{(C)} 43\qquad\textbf{(D)} 49\qquad\textbf{(E)} 50$

Let $ABCD$ be a square of side length $1$, and let $E$ and $F$ be points on $BC$ and $DC$ such that $\angle{EAF}=30^\circ$ and $CE=CF$. Determine the length of $BD$. [i]2015 CCA Math Bonanza Lightning Round #4.2[/i]

A cow lives on a cubic planet of side length $12$. It is tied on a leash $12$ units long that is staked at the center of one of the faces of the cube. The total surface area that the cow can graze is $A \pi+B( \sqrt3 -1)$. Find $A + B$.

Determine the radius of the largest circle which can lie on the ellipsoid $$\frac{x^2 }{a^2 } +\frac{ y^2 }{b^2 } +\frac{z^2 }{c^2 }=1 \;\;\;\; (a>b>c).$$

Call a positive integer $k$ $\textit{pretty}$ if for every positive integer $a$, there exists an integer $n$ such that $n^2+n+k$ is divisible by $2^a$ but not $2^{a+1}$. Find the remainder when the $2021$st pretty number is divided by $1000$. [i]Proposed by i3435[/i]

For a convex quadrilateral $ABCD$, call a point in the interior of $ABCD$ [b]balanced[/b], if (1) $P$ is not on $AC,BD$ (2) Let $AP,BP,CP,DP$ intersect the boundaries of $ABCD$ at $A', B', C', D'$, respectively, then $$AP \cdot PA' = BP \cdot PB' = CP \cdot PC' = DP \cdot PD'$$ Find the maximum possible number of balanced points.