Found problems: 85335
Determine the number of ordered pairs $(a,b)$ of integers such that $\log_a b + 6\log_b a=5$, $2 \leq a \leq 2005$, and $2 \leq b \leq 2005$.
Find the number of subsets $ S$ of $ \{1,2, \dots 63\}$ the sum of whose elements is $ 2008$.
Let $N>= 2$ be an integer. Show that $4n(N-n)+1$ is never a perfect square for each natural number $n$ less than $N$ if and only if $N^2+1$ is prime.
Prove that no matter what digits are placed in the four empty boxes, the eight-digit number
\[ \textbf{9999}\Box\Box\Box\Box \]
is not a perfect square. (A $\textit{perfect square}$ is a whole number times itself. For example, $25$ is a perfect square because $25 = 5 \times 5$.)
Let $p \geq 7$ be a prime number and $$S = \bigg\{jp+1 : 1 \leq j \leq \frac{p-5}{2}\bigg\}.$$ Prove that at least one element of $S$ can be written as $x^2+y^2$, where $x, y$ are integers.
In a triangle $ABC$ we have $AB = AC.$ A circle which is internally tangent with the circumscribed circle of the triangle is also tangent to the sides $AB, AC$ in the points $P,$ respectively $Q.$ Prove that the midpoint of $PQ$ is the center of the inscribed circle of the triangle $ABC.$
Determine all pairs $(a, b)$ of positive real numbers with $a \neq 1$ such that
\[\log_a b < \log_{a+1} (b + 1).\]
Find all pairs $(a,b)$ of real numbers such that $\lfloor an + b \rfloor$ is a perfect square, for all positive integer $n$.
Let $f:[0,\infty)\to\mathbb{R}$ be a differentiable function, with a continous derivative. Given that $f(0)=0$ and $0\leqslant f'(x)\leqslant 1$ for every $x>0$ prove that\[\frac{1}{n+1}\int_0^af(t)^{2n+1}\mathrm{d}t\leqslant\left(\int_0^af(t)^n\mathrm{d}t\right)^2,\]for any positive integer $n{}$ and real number $a>0.$
Let $ABC$ be a triangle with $A',B',C'$ are midpoints of $BC,CA,AB$ respectively. The circle $(\omega_A)$ of center $A$ has a big enough radius cuts $B'C'$ at $X_1,X_2$. Define circles $(\omega_B), (\omega_C)$ with $Y_1, Y_2,Z_1,Z_2$ similarly. Suppose that these circles have the same radius, prove that $X_1,X_2, Y_1, Y_2,Z_1,Z_2$ are concyclic.
A graph has $ n$ vertices and $ \frac {1}{2}\left(n^2 \minus{} 3n \plus{} 4\right)$ edges. There is an edge such that, after removing it, the graph becomes unconnected. Find the greatest possible length $ k$ of a circuit in such a graph.
A natural number $n$ is said to have the property $P,$ if, for all $a, n^2$ divides $a^n - 1$ whenever $n$ divides $a^n - 1.$
a.) Show that every prime number $n$ has property $P.$
b.) Show that there are infinitely many composite numbers $n$ that possess property $P.$
Three-digit powers of 2 and 5 are used in this ''cross-number'' puzzle. What is the only possible digit for the outlined square?
\begin{tabular}{lcl}
\textbf{ACROSS} & & \textbf{DOWN} \\
\textbf{2}. $2^m$ & & \textbf{1}. $5^n$
\end{tabular}
[asy]
size(120);
draw((0,-1)--(1,-1)--(1,2)--(0,2)--cycle);
draw((0,1)--(3,1)--(3,0)--(0,0));
draw((3,0)--(2,0)--(2,1)--(3,1)--cycle,linewidth(1.3));
label("$1$",(0,2),SE);
label("$2$",(0,1),SE);
[/asy]
$\text{(A)}\ 0 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 8$
A difficult mathematical competition consisted of a Part I and a Part II with a combined total of $28$ problems. Each contestant solved $7$ problems altogether. For each pair of problems, there were exactly two contestants who solved both of them. Prove that there was a contestant who, in Part I, solved either no problems or at least four problems.
Let $I$ be an incenter of a triangle $ABC, A_1,B_1,C_1$ be intersection points of the circumcircle of the triangle $ABC$ and the lines $AI, BI, Cl$ respectively. Prove that
a) $\frac{AI}{IA_1}+ \frac{BI}{IB_1}+ \frac{CI}{IC_1}\ge 3$
b) $AI \cdot BI \cdot CI \le I_1A_1\cdot I_2B_1 \cdot I_1C_1$
(D. Pirshtuk)
We are given $13$ apparently equal balls, all but one having the same weight (the remaining one has a different weight). Is it posible to determine the ball with the different weight in $3$ weighings?
Find all real number $x$ which could be represented as
$x = \frac{a_0}{a_1a_2 . . . a_n} + \frac{a_1}{a_2a_3 . . . a_n} + \frac{a_2}{a_3a_4 . . . a_n} + . . . + \frac{a_{n-2}}{a_{n-1}a_n} + \frac{a_{n-1}}{a_n}$ , with $n, a_1, a_2, . . . . , a_n$ are positive integers and $1 = a_0 \leq a_1 < a_2 < . . . < a_n$
Three distinct points $A$, $B$, and $N$ are marked on the line $l$, with $B$ lying between $A$ and $N$. For an arbitrary angle $\alpha \in (0,\frac{\pi}{2})$, points $C$ and $D$ are marked in the plane on the same side of $l$ such that $N$, $C$, and $D$ are collinear; $\angle NAD = \angle NBC = \alpha$; and $A$, $B$, $C$, and $D$ are concyclic. Find the locus of the intersection points of the diagonals of $ABCD$ as $\alpha$ varies between $0$ and $\frac{\pi}{2}$.
A game is played with tokens according to the following rules. In each round, the player with the most tokens gives one token to each of the other players and also places one token into a discard pile. The game ends when some player runs out of tokens. Players $ A$, $ B$, and $ C$ start with $ 15$, $ 14$, and $ 13$ tokens, respectively. How many rounds will there be in the game?
$ \textbf{(A)}\ 36 \qquad \textbf{(B)}\ 37 \qquad \textbf{(C)}\ 38\qquad \textbf{(D)}\ 39\qquad \textbf{(E)}\ 40$
In a triangle $ABC$, $\angle BAC =90^{\circ}$. Point $D$ lies on the side $BC$ and satisfies $\angle BDA=2\angle BAD$. Prove that
\[\frac{2}{AD}=\frac{1}{BD}+\frac{1}{CD} \]
Carl has $5$ cubes each having side length $1$, and Kate has $5$ cubes each having side length $2$. What is the total volume of the $10$ cubes?
$\textbf{(A) }24 \qquad \textbf{(B) }25 \qquad \textbf{(C) } 28\qquad \textbf{(D) } 40\qquad \textbf{(E) } 45$
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]
Let $G = (V, E)$ be a finite simple graph on $n$ vertices. An edge $e$ of $G$ is called a [i]bottleneck[/i] if one can partition $V$ into two disjoint sets $A$ and $B$ such that
[list]
[*] at most $100$ edges of $G$ have one endpoint in $A$ and one endpoint in $B$; and
[*] the edge $e$ is one such edge (meaning the edge $e$ also has one endpoint in $A$ and one endpoint in $B$).
[/list]
Prove that at most $100n$ edges of $G$ are bottlenecks.
[i]Proposed by Yang Liu[/i]
Given that $n$ elements $a_1, a_2,\dots, a_n$ are organized into $n$ pairs $P_1, P_2, \dots, P_n$ in such a way that two pairs $P_i, P_j$ share exactly one element when $(a_i, a_j)$ is one of the pairs, prove that every element is in exactly two of the pairs.
Prove that the family of curves $$\frac{x^2}{a^2+\lambda}+\frac{y^2}{b^2+\lambda}=1$$ satisfies $$\frac{dy}{dx}(a^2-b^2)=\left(x+y\frac{dy}{dx}\right)\left(x\frac{dy}{dx}-y\right)$$