Found problems: 118
Let $ a, b, c$ be positive reals. Find the smallest value of
\[ \frac {a \plus{} 3c}{a \plus{} 2b \plus{} c} \plus{} \frac {4b}{a \plus{} b \plus{} 2c} \minus{} \frac {8c}{a \plus{} b \plus{} 3c}.
\]
Determine all real constants $t$ such that whenever $a$, $b$ and $c$ are the lengths of sides of a triangle, then so are $a^2+bct$, $b^2+cat$, $c^2+abt$.
Let $n \geq 2$ be a positive integer. Call a sequence $a_1, a_2, \cdots , a_k$ of integers an $n$[i]-chain[/i] if $1 = a_2 < a_ 2 < \cdots < a_k =n$, $a_i$ divides $a_{i+1}$ for all $i$, $1 \leq i \leq k-1$. Let $f(n)$ be the number of $n$[i]-chains[/i] where $n \geq 2$. For example, $f(4) = 2$ corresponds to the $4$-chains $\{1,4\}$ and $\{1,2,4\}$.
Prove that $f(2^m \cdot 3) = 2^{m-1} (m+2)$ for every positive integer $m$.
Find the positive integer $n$ for which \[ \lfloor \log_2{1}\rfloor+\lfloor\log_2{2}\rfloor+\lfloor\log_2{3}\rfloor+\cdots+\lfloor\log_2{n}\rfloor=1994. \] (For real $x$, $\lfloor x\rfloor$ is the greatest integer $\le x.$)
Prove that there are infinitely many triples $(a, b, p)$ of positive integers with $p$ prime, $a < p$, and $b < p$, such that $(a + b)^p - a^p - b^p$ is a multiple of $p^3$.
[i]Noam Elkies[/i]
The area of the smallest equilateral triangle with one vertex on each of the sides of the right triangle with side lengths $2\sqrt3$, $5$, and $\sqrt{37}$, as shown, is $\tfrac{m\sqrt{p}}{n}$, where $m$, $n$, and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p$.
[asy]
size(5cm);
pair C=(0,0),B=(0,2*sqrt(3)),A=(5,0);
real t = .385, s = 3.5*t-1;
pair R = A*t+B*(1-t), P=B*s;
pair Q = dir(-60) * (R-P) + P;
fill(P--Q--R--cycle,gray);
draw(A--B--C--A^^P--Q--R--P);
dot(A--B--C--P--Q--R);
[/asy]
Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous function such that for all $x\in\mathbb{R}$ and for all $t\geqslant 0$, $$f(x)=f(e^tx)$$ Show that $f$ is a constant function.
Niki and Kyle play a triangle game. Niki first draws $\triangle ABC$ with area $1$, and Kyle picks a point $X$ inside $\triangle ABC$. Niki then draws segments $\overline{DG}$, $\overline{EH}$, and $\overline{FI}$, all through $X$, such that $D$ and $E$ are on $\overline{BC}$, $F$ and $G$ are on $\overline{AC}$, and $H$ and $I$ are on $\overline{AB}$. The ten points must all be distinct. Finally, let $S$ be the sum of the areas of triangles $DEX$, $FGX$, and $HIX$. Kyle earns $S$ points, and Niki earns $1-S$ points. If both players play optimally to maximize the amount of points they get, who will win and by how much?
Assuming that real numbers $x$ and $y$ satisfy $y\left(1+x^2\right)=x\left(\sqrt{1-4y^2}-1\right)$, find the maximum value of $xy$.
For a positive integer $n$, let $f_n(x)=\cos (x) \cos (2 x) \cos (3 x) \cdots \cos (n x)$. Find the smallest $n$ such that $\left|f_n^{\prime \prime}(0)\right|>2023$.
Let $ \overline{AB}$ be a diameter of circle $ \omega$. Extend $ \overline{AB}$ through $ A$ to $ C$. Point $ T$ lies on $ \omega$ so that line $ CT$ is tangent to $ \omega$. Point $ P$ is the foot of the perpendicular from $ A$ to line $ CT$. Suppose $ AB \equal{} 18$, and let $ m$ denote the maximum possible length of segment $ BP$. Find $ m^{2}$.
Let $ a$, $ b$, $ c$ be positive real numbers. Prove that
\[ \dfrac{(2a \plus{} b \plus{} c)^2}{2a^2 \plus{} (b \plus{} c)^2} \plus{} \dfrac{(2b \plus{} c \plus{} a)^2}{2b^2 \plus{} (c \plus{} a)^2} \plus{} \dfrac{(2c \plus{} a \plus{} b)^2}{2c^2 \plus{} (a \plus{} b)^2} \le 8.
\]
You are standing at the edge of a river which is $1$ km wide. You have to go to your camp on the opposite bank . The distance to the camp from the point on the opposite bank directly across you is $1$ km . You can swim at $2$ km/hr and walk at $3$ km-hr . What is the shortest time you will take to reach your camp?(Ignore the speed of the river and assume that the river banks are straight and parallel).
Find the minimum value of $\int_1^e \left|\ln x-\frac{a}{x}\right|dx\ (0\leq a\leq e)$
Let $\mathcal F$ be the set of functions $f(x,y)$ that are twice continuously differentiable for $x\geq 1$, $y\geq 1$ and that satisfy the following two equations (where subscripts denote partial derivatives):
\[xf_x + yf_y = xy\ln(xy),\] \[x^2f_{xx} + y^2f_{yy} = xy.\]
For each $f\in\mathcal F$, let
\[
m(f) = \min_{s\geq 1}\left(f(s+1,s+1) - f(s+1,s)-f(s,s+1) + f(s,s)\right).
\]
Determine $m(f)$, and show that it is independent of the choice of $f$.
A group of children held a grape-eating contest. When the contest was over, the winner had eaten $ n$ grapes, and the child in $ k$th place had eaten $ n\plus{}2\minus{}2k$ grapes. The total number of grapes eaten in the contest was $ 2009$. Find the smallest possible value of $ n$.
Let $ \overline{MN}$ be a diameter of a circle with diameter $ 1$. Let $ A$ and $ B$ be points on one of the semicircular arcs determined by $ \overline{MN}$ such that $ A$ is the midpoint of the semicircle and $ MB\equal{}\frac35$. Point $ C$ lies on the other semicircular arc. Let $ d$ be the length of the line segment whose endpoints are the intersections of diameter $ \overline{MN}$ with the chords $ \overline{AC}$ and $ \overline{BC}$. The largest possible value of $ d$ can be written in the form $ r\minus{}s\sqrt{t}$, where $ r$, $ s$, and $ t$ are positive integers and $ t$ is not divisible by the square of any prime. Find $ r\plus{}s\plus{}t$.
Let $U$ be a set of $m$ triangles. Prove that there exists a subset $W$ of $U$ which satisfies the following.
(i). The number of triangles in $W$ is at least $0.45m^{\frac{4}{5}}$
(ii) There are no points $A, B, C, D, E, F$ such that triangles $ABC$, $BCD$, $CDE$, $DEF$, $EFA$, $FAB$ are all in $W$.