For three points $A,B,C$ in the plane, we define $m(ABC)$ to be the smallest length of the three heights of the triangle $ABC$, where in the case $A$, $B$, $C$ are collinear, we set $m(ABC) = 0$. Let $A$, $B$, $C$ be given points in the plane. Prove that for any point $X$ in the plane, \[ m(ABC) \leq m(ABX) + m(AXC) + m(XBC). \]

Let $n$ be a positive integer. Let $d$ be an integer such that $d \ge n$ and $d$ is a divisor of $\frac{n(n + 1)}{2}$. Prove that the set $\{ 1, 2, \dots, n \}$ can be partitioned into disjoint subsets such that the sum of the numbers in each subset equals $d$.

Are there integers $m$ and $n$ such that $m^2 + 1954 = n^2$?

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Positive real numbers $a, b, c$ satisfy $abc = 1$. Prove that $$\frac{a}{1+b}+\frac{b}{1+c}+\frac{c}{1+a} \ge \frac32$$

Find a polynomial $ p\left(x\right)$ with real coefficients such that $ \left(x\plus{}10\right)p\left(2x\right)\equal{}\left(8x\minus{}32\right)p\left(x\plus{}6\right)$ for all real $ x$ and $ p\left(1\right)\equal{}210$.

Two boys $A$ and $B$ start at the same time to ride from Port Jervis to Poughkeepsie, $60$ miles away. $A$ travels $4$ miles an hour slower than $B$. $B$ reaches Poughkeepsie and at once turns back meeting $A$ $12$ miles from Poughkeepsie. The rate of $A$ was: $\textbf{(A)}\ 4\text{ mph}\qquad \textbf{(B)}\ 8\text{ mph} \qquad \textbf{(C)}\ 12\text{ mph} \qquad \textbf{(D)}\ 16\text{ mph} \qquad \textbf{(E)}\ 20\text{ mph}$

In the triangle $ABC$, points $D$ and $E$ lie on the side $BC$, with $CE = BD$. Also, $M$ is the midpoint of $AD$. Show that the centroid of $ABC$ lies on $ME$.

The diameter \( AD \) of the circumcircle of triangle \( ABC \) intersects line \( BC \) at point \( K \). Point \( D \) is reflected symmetrically with respect to point \( K \), resulting in point \( L \). On line \( AB \), a point \( F \) is chosen such that \( FL \perp AC \). Prove that \( FK \perp AD \). [i]Proposed by Matthew Kurskyi[/i]

Two circles $ \gamma_{1}$ and $ \gamma_{2}$ meet at points $ X$ and $ Y$. Consider the parallel through $ Y$ to the nearest common tangent of the circles. This parallel meets again $ \gamma_{1}$ and $ \gamma_{2}$ at $ A$, and $ B$ respectively. Let $ O$ be the center of the circle tangent to $ \gamma_{1},\gamma_{2}$ and the circle $ AXB$, situated outside $ \gamma_{1}$ and $ \gamma_{2}$ and inside the circle $ AXB.$ Prove that $ XO$ is the bisector line of the angle $ \angle{AXB}.$ [b]Radu Gologan[/b]

Determine all positive integers $n$ for which $2^n + 1$ is divisible by $3$.

The circle $\gamma$ passing through the vertex $A$ of triangle $ABC$ intersects its sides $AB$ and $AC$ for the second time at points $X$ and $Y$, respectively. Also, the circle $\gamma$ intersects side $BC$ at points $D$ and $E$ so that $AD = AE$. Prove that the points $B, X, Y, C$ lie on the same circle. [i]Proposed by Mykhailo Shtandenko[/i]

On a chess table $n\times m$ we call a [i]move [/i] the following succesion of operations (i) choosing some unmarked squares, any two not lying on the same row or column; (ii) marking them with 1; (iii) marking with 0 all the unmarked squares which lie on the same line and column with a square marked with the number 1 (even if the square has been marked with 1 on another move). We call a [i]game [/i]a succession of moves that end in the moment that we cannot make any more moves. What is the maximum possible sum of the numbers on the table at the end of a game?

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]

Does there exist an integer n such that all three numbers (a) $n - 96$, $n$ and $n + 96$ (b) $n - 1996$, $n$ and $n + 1996$ are positive prime numbers? (V Senderov)

Find $26$ elements of $\{1, 2, 3, ... , 40\}$ such that the product of two of them is never a square. Show that one cannot find $27$ such elements.