Found problems: 85335
Find all ordered pairs $(a,b)$, of natural numbers, where $1<a,b\leq 100$, such that
$\frac{1}{\log_{a}{10}}+\frac{1}{\log_{b}{10}}$ is a natural number.
Find all pairs of positive integers $(m, n)$ satisfying the equation $$m!+n!=m^n+1.$$
In triangle $ABC$, point$ I$ is incenter , $I_a$ is the $A$-excenter. Let $K$ be the intersection point of the $BC$ with the external bisector of the angle $BAC$, and $E$ be the midpoint of the arc $BAC$ of the circumcircle of triangle $ABC$. Prove that $K$ is the orthocenter of triangle $II_aE$.
Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that
\[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\]
[i]Proposed by Gerhard Wöginger, Austria.[/i]
In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test,
\[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]
Two regular square pyramids have all edges $12$ cm in length. The pyramids have parallel bases and those bases have parallel edges, and each pyramid has its apex at the center of the other pyramid's base. What is the total number of cubic centimeters in the volume of the solid of intersection of the two pyramids?
Prove that the edges $AB$ and $CD$ of a tetrahedron $ABCD$ are perpendicular if and only if there exists a parallelogram $CDPQ$ such that $PA = PB = PD$ and $QA = QB = QC$.
A sequence composed by $0$s and $1$s has at most two consecutive $0$s. How many sequences of length $10$ exist?
Two circles with radii $3$ and $4$ are externally tangent at $P$. Let $A \neq P$ be on the first circle and $B \neq P$ be on the second circle, and let the tangents at $A$ and $B$ to the respective circles intersect at $Q$. Given that $QA = QB$ and $AB$ bisects $PQ$, compute the area of $QAB$.
The vertices of the pentagon $ABCDE$ are on a circle, and the points $H_1, H_2, H_3,H_4$ are the orthocenters of the triangles $ABC, ABE, ACD, ADE$ respectively . Prove that the quadrilateral determined by the four orthocenters is square if and only if $BE \parallel CD$ and the distance between them is $\frac{BE + CD}{2}$.
Find all pairs $(x,y)$ of positive integers that satisfy the equation \[y^{2}=x^{3}+16.\]
Let $ x_1,x_2,\dots,x_n$ be positive real numbers. Let $ m\equal{}\min\{x_1,x_2,\dots,x_n\}$, $ M\equal{}\max\{x_1,x_2,\dots,x_n\}$, $ A\equal{}\frac{1}{n}(x_1\plus{}x_2\plus{}\dots\plus{}x_n)$, and $ G\equal{}\sqrt[n]{x_1x_2 \dots x_n}$. Prove that \[ A\minus{}G \ge \frac{1}{n}(\sqrt{M}\minus{}\sqrt{m})^2.\]
Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform [i]stone moves[/i], defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$, such that $i<j$ and $k<l$. A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively, or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively.
Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.
How many different non-equivalent ways can Steve pile the stones on the grid?
For which positive integers $n$ do there exist two polynomials $f$ and $g$ with integer coefficients of $n$ variables $x_1, x_2, \ldots , x_n$ such that the following equality is satisfied:
\[\sum_{i=1}^n x_i f(x_1, x_2, \ldots , x_n) = g(x_1^2, x_2^2, \ldots , x_n^2) \ ? \]
Let $I$ be the incenter and $O$ be the circumcenter of triangle $ABC,$ where $\angle A < \angle B < \angle C.$ Points $P$ and $Q$ are such that $AIOP$ and $BIOQ$ are isosceles trapezoids ($AI \parallel OP,$ $BI \parallel OQ$). Prove that $CP = CQ.$
[i]Proposed by Volodymyr Brayman and Matthew Kurskyi[/i]
Let $\mathcal{F}$ be the set of all the functions $f : \mathcal{P}(S) \longrightarrow \mathbb{R}$ such that for all $X, Y \subseteq S$, we have $f(X \cap Y) = \min (f(X), f(Y))$, where $S$ is a finite set (and $\mathcal{P}(S)$ is the set of its subsets). Find
\[\max_{f \in \mathcal{F}}| \textrm{Im}(f) |. \]
A circle with center $O$ has radius $5,$ and has two points $A,B$ on the circle such that $\angle AOB = 90^{\circ}.$ Rays $OA$ and $OB$ are extended to points $C$ and $D,$ respectively, such that $AB$ is parallel to $CD,$ and the length of $CD$ is $200\%$ more than the radius of circle $O.$ Determine the length of $AC.$
Let $n$ be a positive integer. For a positive integer $m$, we partition the set $\{1, 2, 3,...,m\}$ into $n$ subsets, so that the product of two different elements in the same subset is never a perfect square. In terms of $n$, fi nd the largest positive integer $m$ for which such a partition exists.
Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.
Determine all natural numbers $n$ for which there is a partition of $\{1,2,...,3n\}$ in $n$ pairwise disjoint subsets of the form $\{a,b,c\}$, such that numbers $b-a$ and $c-b$ are different numbers from the set $\{n-1, n, n+1\}$.
Find all 4-digit numbers $\overline{abcd}$ that are multiples of $11$, such that the 2-digit number $\overline{ac}$ is a multiple of $7$ and $a + b + c + d = d^2$.
Let $ABC$ be an acute-angled triangle with $AB<AC$ and let $O$ be the centre of its circumcircle $\omega$. Let $D$ be a point on the line segment $BC$ such that $\angle BAD = \angle CAO$. Let $E$ be the second point of intersection of $\omega$ and the line $AD$. If $M$, $N$ and $P$ are the midpoints of the line segments $BE$, $OD$ and $AC$, respectively, show that the points $M$, $N$ and $P$ are collinear.
$f(x)$ is polynomial with integer coefficients, with module not exceeded $5*10^6$. $f(x)=nx$ has integer root for $n=1,2,...,20$. Prove that $f(0)=0$
Determine all functions $f : R \to R$ such that
$$f(x)f(y) = 2f(x + y) + 9xy \ \ \forall x, y \in R.$$
Find all odd prime $p$ such that $1+k(p-1)$ is prime for all integer $k$ where $1 \le k \le \dfrac{p-1}{2}$.