Let $\gamma=\alpha \times \beta$ where \[\alpha=999 \cdots 9\] (2010 '9') and \[\beta=444 \cdots 4\] (2010 '4') Find the sum of digits of $\gamma$.

Given an acute triangle $ABC$ with $AC>BC$ and the circumcenter of triangle $ABC$ is $O$. The altitude of triangle $ABC$ from $C$ intersects $AB$ and the circumcircle at $D$ and $E$, respectively. A line which passed through $O$ which is parallel to $AB$ intersects $AC$ at $F$. Show that the line $CO$, the line which passed through $F$ and perpendicular to $AC$, and the line which passed through $E$ and parallel with $DO$ are concurrent. [i]Fajar Yuliawan, Bandung[/i]

Let $p$ be an odd prime. Prove that \[\sum^{p-1}_{k=1} k^{2p-1} \equiv \frac{p(p+1)}{2}\pmod{p^2}.\]

Suppose that real number $x$ satisfies $$\sqrt{49-x^2}-\sqrt{25-x^2}=3.$$ What is the value of $\sqrt{49-x^2}+\sqrt{25-x^2}$? $ \textbf{(A) }8 \qquad \textbf{(B) }\sqrt{33}+8\qquad \textbf{(C) }9 \qquad \textbf{(D) }2\sqrt{10}+4 \qquad \textbf{(E) }12 \qquad $

Let $s$ and $t$ be two parallel lines. We have marked $k$ points on line $s$ and $n$ points on line $t$ ($k\geq n$). If it is known that the total number of triangles that have their three vertices at marked points is $220$, find all possible values of $k$ and $n$.

How many pairs of rational number $ \left(x,y\right)$ are there satisfying the equation $ y \equal{} \sqrt {x^{2} \plus{} \frac {1}{1999} }$? $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{Infinitely many}$

Prove that there are infinitely many multiples of 2005 that contain all the digits 0, 1, 2,...,9 an equal number of times.

A series of lockers, numbered 1 through 100, are all initially closed. Student 1 goes through and opens every locker. Student 3 goes through and "flips" every 3rd locker ("fipping") a locker means changing its state: if the locker is open he closes it, and if the locker is closed he opens it. Student 5 then goes through and "flips" every 5th locker. This process continues with all students with odd numbers $n < 100$ going through and "flipping" every $n$th locker. How many lockers are open after this process?

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

When the integer $ {\left(\sqrt{3} \plus{} 5\right)}^{103} \minus{} {\left(\sqrt{3} \minus{} 5\right)}^{103}$ is divided by 9, what is the remainder?

Does there exist a piecewise linear, continuous, surjective mapping $f: [0,1]\to [0,1]$ such that $f(0)=f(1)=0$, and for all positive integer $n$, $$2.0001^{(n-10)} <P_n(f)<2.9999^{(n+10)}$$holds, where $P_n(f)$ is the number of points $x$ such that $\underbrace{f(\dotsc f}_n(x)\dotsc )=x$?

Form the infinite graph $A$ by taking the set of primes $p$ congruent to $1\pmod{4}$, and connecting $p$ and $q$ if they are quadratic residues modulo each other. Do the same for a graph $B$ with the primes $1\pmod{8}$. Show $A$ and $B$ are isomorphic to each other. [i]Linus Hamilton.[/i]

If $ n$ runs through all the positive integers, then $ f(n) \equal{} \left[n \plus{} \sqrt {\frac {n}{3}} \plus{} \frac {1}{2} \right]$ runs through all positive integers skipping the terms of the sequence $ a_n \equal{} 3 \cdot n^2 \minus{} 2 \cdot n.$

Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2n \times 2n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contain two marked cells.

Solve: $$\begin{cases} 2x_1 - 5x_2 + 3x_3 \ge 0 \\ 2x_2 - 5x_3 + 3x4 \ge 0 \\ ...\\ 2x_{23} - 5x_{24} + 3x_{25} \ge 0\\ 2x_{24} - 5x_{25} + 3x_1 \ge 0\\ 2x_{25} - 5x_1 + 3x_2 \ge 0 \end{cases}$$

[b]p1.[/b] Find $$2^{\left(0^{\left(2^3\right)}\right)}$$ [b]p2.[/b] Amy likes to spin pencils. She has an $n\%$ probability of dropping the $n$th pencil. If she makes $100$ attempts, the expected number of pencils Amy will drop is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p3.[/b] Determine the units digit of $3 + 3^2 + 3^3 + 3^4 +....+ 3^{2022} + 3^{2023}$. [b]p4.[/b] Cyclic quadrilateral $ABCD$ is inscribed in circle $\omega$ with center $O$ and radius $20$. Let the intersection of $AC$ and $BD$ be $E$, and let the inradius of $\vartriangle AEB$ and $\vartriangle CED$ both be equal to $7$. Find $AE^2 - BE^2$. [b]p5.[/b] An isosceles right triangle is inscribed in a circle which is inscribed in an isosceles right triangle that is inscribed in another circle. This larger circle is inscribed in another isosceles right triangle. If the ratio of the area of the largest triangle to the area of the smallest triangle can be expressed as $a+b\sqrt{c}$, such that $a, b$ and $c$ are positive integers and no square divides $c$ except $1$, find $a + b + c$. [b]p6.[/b] Jonny has three days to solve as many ISL problems as he can. If the amount of problems he solves is equal to the maximum possible value of $gcd \left(f(x), f(x+1) \right)$ for $f(x) = x^3 +2$ over all positive integer values of $x$, then find the amount of problems Jonny solves. [b]p7.[/b] Three points $X$, $Y$, and $Z$ are randomly placed on the sides of a square such that $X$ and $Y$ are always on the same side of the square. The probability that non-degenerate triangle $\vartriangle XYZ$ contains the center of the square can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p8.[/b] Compute the largest integer less than $(\sqrt7 +\sqrt3)^6$. [b]p9.[/b] Find the minimum value of the expression $\frac{(x+y)^2}{x-y}$ given $x > y > 0$ are real numbers and $xy = 2209$. [b]p10.[/b] Find the number of nonnegative integers $n \le 6561$ such that the sum of the digits of $n$ in base $9$ is exactly $4$ greater than the sum of the digits of $n$ in base $3$. [b]p11.[/b] Estimation (Tiebreaker) Estimate the product of the number of people who took the December contest, the sum of all scores in the November contest, and the number of incorrect responses for Problem $1$ and Problem $2$ on the October Contest. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABCDE$ be a convex pentagon with $AB=14,$ $BC=7,$ $CD=24,$ $DE=13,$ $EA=26,$ and $\angle B=\angle E=60^{\circ}.$ For each point $X$ in the plane, define $f(X)=AX+BX+CX+DX+EX.$ The least possible value of $f(X)$ can be expressed as $m+n\sqrt{p},$ where $m$ and $n$ are positive integers and $p$ is not divisible by the square of any prime. Find $m+n+p.$

Let $n$ be a positive integer such that $2+2\sqrt{28n^2 +1}$ is an integer. Show that $2+2\sqrt{28n^2 +1}$ is the square of an integer.

An interior point in a rectangle is connected by line segments to the midpoints of its four sides. Thus four domains (polygons) with the areas $a, b, c$ and $d$ appear (see the figure). Prove that $a + c = b + d$. [img]https://1.bp.blogspot.com/-BipDNHELjJI/XzcCa68P3HI/AAAAAAAAMXY/H2Iqya9VItMLXrRqsdyxHLTXCAZ02nEtgCLcBGAsYHQ/s0/2002%2BMohr%2Bp1.png[/img]

$N> 4$ points move around the circle, each with a constant speed. For Any four of them have a moment in time when they all meet. Prove that is the moment when all the points meet.

Find the positive integer $n{}$ if $$\left(1-\frac{1}{1+2}\right)\cdot\left(1-\frac{1}{1+2+3}\right)\cdot\ldots\cdot\left(1-\frac{1}{1+2+\ldots+n}\right)=\frac{2021}{6057}.$$

If $a$ is a given real number, then the number of subsets of $M=\{x\in\mathbb{R}|x^2-3x-a^2+2=0\}$ is $\text{(A)}1\qquad\text{(B)}2\qquad\text{(C)}4\qquad\text{(D)}$ Not sure

Let $X=\{1,2,3,...,10\}$. Find the number of pairs of $\{A,B\}$ such that $A\subseteq X, B\subseteq X, A\ne B$ and $A\cap B=\{5,7,8\}$.

For each nonnegative integer $n$, we define a set $H_n$ of points in the plane as follows: [list] [*]$H_0$ is the unit square $\{(x,y) \mid 0 \le x, y \le 1\}$. [*]For each $n \ge 1$, we construct $H_n$ from $H_{n-1}$ as follows. Note that $H_{n-1}$ is the union of finitely many square regions $R_1, \ldots, R_k$. For each $i$, divide $R_i$ into four congruent square quadrants. If $n$ is odd, then the upper-right and lower-left quadrants of each $R_i$ make up $H_n$. If $n$ is even, then the upper-left and lower-right quadrants of each $R_i$ make up $H_n$. [/list] The figures $H_0$, $H_1$, $H_2$, and $H_3$ are shown below. [asy] pair[]sq(int n){pair[]a; if(n == 0)a.push((.5,.5)); else for(pair k:sq(n-1)) { pair l=1/2^(n+1)*(1,(-1)^(1+(n%2)));a.push(k+l);a.push(k-l); } return a;} void hh(int n,real k){ pair[] S=sq(n);real r=1/2^(n+1); for(pair p:S)filldraw(shift(p+(k,0))*((r,r)--(r,-r)--(-r,-r)--(-r,r)--cycle)); label("$H_"+string(n)+"$",(k+.5,-.3));} size(7cm); for(int i=0;i<=3;++i)hh(i,1.6*i); [/asy] Suppose that the point $P = (x,y)$ lies in $H_n$ for all $n \ge 0$. The greatest possible value of $xy$ is $\tfrac{m}{n}$, for relatively prime positive integers $m, n$. Compute $100m+n$. [i]Proposed by Michael Tang[/i]

Restore the triangle with a compass and a ruler given the intersection point of altitudes and the feet of the median and angle bisectors drawn to one side. (No research required.)