Found problems: 85335
What is $10! - 7! \cdot 6!$?
$
\textbf{(A) }-120 \qquad
\textbf{(B) }0 \qquad
\textbf{(C) }120 \qquad
\textbf{(D) }600 \qquad
\textbf{(E) }720 \qquad
$
Let $ A\in\mathcal{M}_4\left(\mathbb{R}\right) $ be an invertible matrix whose trace is equal to the trace of its adjugate, which is nonzero. Show that $ A^2+I $ is singular if and only if there exists a nonzero matrix in $ \mathcal{M}_4\left( \mathbb{R} \right) $ that anti-commutes with it.
The schoolchildren sat down on chairs located in transverse and longitudinal rows. The tallest student was chosen from each transverse row, and the lowest was chosen among them. Then the lowest student was selected from each longitudinal row, and the tallest was chosen among them. Which of these two students is higher?
Let $P$ be a point inside a triangle $ABC$ such that
$$ \frac{AP + BP}{AB} = \frac{BP + CP}{BC} = \frac{CP + AP}{CA} .$$
Lines $AP$, $BP$, $CP$ intersect the circumcircle of triangle $ABC$ again in $A'$, $B'$, $C'$. Prove that the triangles $ABC$ and $A'B'C'$ have a common incircle.
Points $A$, $B$, $C$, and $D$ lie on a circle $\Gamma$, in that order, with $AB=5$ and $AD=3$. The angle bisector of $\angle ABC$ intersects $\Gamma$ at point $E$ on the opposite side of $\overleftrightarrow{CD}$ as $A$ and $B$. Assume that $\overline{BE}$ is a diameter of $\Gamma$ and $AC=AE$. Compute $DE$.
For a positive integer $n$, an [i]$n$-sequence[/i] is a sequence $(a_0,\ldots,a_n)$ of non-negative integers satisfying the following condition: if $i$ and $j$ are non-negative integers with $i+j \leqslant n$, then $a_i+a_j \leqslant n$ and $a_{a_i+a_j}=a_{i+j}$.
Let $f(n)$ be the number of $n$-sequences. Prove that there exist positive real numbers $c_1$, $c_2$, and $\lambda$ such that \[c_1\lambda^n<f(n)<c_2\lambda^n\] for all positive integers $n$.
Solve for $x$ if $20x + 21 = 121$.
$\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }7$
For how many values of $k$ is $12^{12}$ the least common multiple of the positive integers $6^6, 8^8,$ and $k$?
A committee of $3366$ film critics are voting for the Oscars. Every critic voted just an actor and just one actress. After the voting, it was found that for every positive integer $n \in \left \{1, 2, \ldots, 100 \right \}$, there is some actor or some actress who was voted exactly $n$ times. Prove that there are two critics who voted the same actor and the same actress.
[i](Cyprus)[/i]
Original in Hungarian; translated with Google translate; polished by myself.
Let $f: [0, \infty) \to [0, \infty)$ be a function that is linear between adjacent integers, and for $n = 0, 1, \dots$ satisfies
$$f(n) = \begin{cases} 0, & \textrm{if }2\mid n,\\4^l + 1, & \textrm{if }2 \nmid n, 4^{l - 1} \leq n < 4^l(l = 1, 2, \dots).\end{cases}$$
Let $f^1(x) = f(x)$, and $f^k(x) = f(f^{k - 1}(x))$ for all integers $k \geq 2$. Determine the values of $\liminf\nolimits_{k\to\infty}f^k(x)$ and $\limsup\nolimits_{k\to\infty}f^k(x)$ for almost all $x \in [0, \infty)$ under Lebesgue measure.
(Not sure whether the last sentence translates correctly; the original:
Határozzuk meg Lebesgue majdnem minden $x\in [0, \infty)$-re a $\liminf\nolimits_{k\to\infty}f^k(x)$ és $\limsup\nolimits_{k\to\infty}f^k(x)$ értékét.)
Let $A,B$ and $C$ be three points on a line with $B$ between $A$ and $C$. Let $\Gamma_1,\Gamma_2, \Gamma_3$ be semicircles, all on the same side of $AC$ and with $AC,AB,BC$ as diameters, respectively. Let $l$ be the line perpendicular to $AC$ through $B$. Let $\Gamma$ be the circle which is tangent to the line $l$, tangent to $\Gamma_1$ internally, and tangent to $\Gamma_3$ externally. Let $D$ be the point of contact of $\Gamma$ and $\Gamma_3$. The diameter of $\Gamma$ through $D$ meets $l$ in $E$. Show that $AB=DE$.
In a square of side 6 the points $A,B,C,D$ are given such that the distance between any two of the four points is at least 5. Prove that $A,B,C,D$ form a convex quadrilateral and its area is greater than 21.
[i]Laurentiu Panaitopol[/i]
$ABCD$ is a cyclic quadrilateral inscribed in a circle of radius $5$, with $AB=6$, $BC=7$, $CD=8$. Find $AD$.
a) If positive integer $N$ is a perfect cube and is not divisible by $10$, then $N=(10m+n)^2$ where $m,n \in N$ with $1\le n\le 9$
b) Find all the positive integers $N$ which are perfect cubes, are not divisible by $10$, such that the number obtained by erasing the last three digits to be also also a perfect cube.
Let $p$ be a prime with $p \equiv 1 \pmod{4}$. Let $a$ be the unique integer such that \[p=a^{2}+b^{2}, \; a \equiv-1 \pmod{4}, \; b \equiv 0 \; \pmod{2}\] Prove that \[\sum^{p-1}_{i=0}\left( \frac{i^{3}+6i^{2}+i }{p}\right) = 2 \left( \frac{2}{p}\right),\] where $\left(\frac{k}{p}\right)$ denotes the Legendre Symbol.
If $ A \equal{} 20^{\circ}$ and $ B \equal{} 25^{\circ}$, then the value of $ (1 \plus{} \tan A)(1 \plus{} \tan B)$ is
$ \textbf{(A)} \sqrt3 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 1 \plus{} \sqrt2 \qquad \textbf{(D)}\ 2(\tan A \plus{} \tan B)$
$ \textbf{(E)}\ \text{ none of these}$
Find all positive integers $ k$ for which the following statement is true: If $ F(x)$ is a polynomial with integer coefficients satisfying the condition $ 0 \leq F(c) \leq k$ for each $ c\in \{0,1,\ldots,k \plus{} 1\}$, then $ F(0) \equal{} F(1) \equal{} \ldots \equal{} F(k \plus{} 1)$.
Find all real positive solutions (if any) to
\begin{align*}
x^3+y^3+z^3 &= x+y+z, \mbox{ and} \\
x^2+y^2+z^2 &= xyz.
\end{align*}
$find$ all non negative integers $m$, $n$ such that $mn-1$ divides $n^3-1$
Fix an integer $n \geq 2$ and let $a_1, \ldots, a_n$ be integers, where $a_1 = 1$. Let
$$ f(x) = \sum_{m=1}^n a_mm^x. $$ Suppose that $f(x) = 0$ for some $K$ consecutive positive integer values of $x$. In terms of $n$, determine the maximum possible value of $K$.
Let $ABC$ be an acute-angled, nonisosceles triangle. Altitudes $AA'$ and $BB' $meet at point $H$, and the medians of triangle $AHB$ meet at point $M$. Line $CM$ bisects segment $A'B'$. Find angle $C$.
(D. Krekov)
The sequence of positive integers $a_1, a_2, a_3, ...$ satisfies $a_{n+1} = a^2_{n} + 2018$ for $n \ge 1$.
Prove that there exists at most one $n$ for which $a_n$ is the cube of an integer.
A sequence of integers $a_0,\ a_1,\dots a_n \dots $ is defined by the following rules: $a_0=0,\ a_1=1,\ a_{n+1} > a_n$ for each $n\in \mathbb{N}$, and $a_{n+1}$ is the minimum number such that no three numbers among $a_0,\ a_1,\dots a_{n+1}$ form an arithmetical progression. Prove that $a_{2^n}=3^n$ for each $n \in \mathbb{N}.$
Prove the following inequality:
\[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1}
x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in
\mathbb{N}.$
Find the prime number $p$ such that $71p + 1$ is a perfect square.