Found problems: 85335
Let $n \geq 2$ and $A, B \in \mathcal{M}_n(\mathbb{C})$ such that there exists an idempotent matrix $C \in \mathcal{M}_n(\mathbb{C})$ for which $C^*=AB-BA.$ Prove that $(AB-BA)^2=0.$
Note: $X^*$ is the [url = https://en.wikipedia.org/wiki/Adjugate_matrix]adjugate[/url] matrix of $X$ (not the conjugate transpose)
The hexagonal pattern constructed below has two smaller hexagons per side and has a total of $30$ edges. A similar figure is constructed with $20$ smaller hexagons per side. Compute the number of edges in this larger figure.
[Insert Diagram]
[i]Proposed by Ezra Erives[/i]
Prove that there are infinite pairs of non-congruent triangles that have the same angles and two of their equal sides. Develop an algorithm or rule to obtain these pairs of triangles and indicate at least one pair that satisfies the asserted.
The incircle of $ABC$ touches $AB$ at $M$. $N$ is any point on the segment $BC$. Show that the incircles of $AMN, BMN, ACN$ have a common tangent.
In the triangle $ABC, \angle BAC$ is acute, the angle bisector of $\angle BAC$ meets $BC$ at $D, K$ is the foot of the perpendicular from $B$ to $AC$, and $\angle ADB = 45^o$. Point $P$ lies between $K$ and $C$ such that $\angle KDP = 30^o$. Point $Q$ lies on the ray $DP$ such that $DQ = DK$. The perpendicular at $P$ to $AC$ meets $KD$ at $L$. Prove that $PL^2 = DQ \cdot PQ$.
There are 2016 points near a line such that the distance from each point to the line is less than 1 cm, and the distance between any two points is always greater than 2 cm. Prove that there exist two points whose distance is at least 17 meters.
Let $Q$ be a square with side length $6$. Find the smallest integer $n$ such that in $Q$ there exists a set $S$ of $n$ points with the property that any square with side $1$ completely contained in $Q$ contains in its interior at least one point from $S$.
$S$ is a circle with $AB$ a diameter and $t$ is the tangent line to $S$ at $B$. Consider the two points $C$ and $D$ on $t$ such that $B$ is between $C$ and $D$. Suppose $E$ and $F$ are the intersections of $S$ with $AC$ and $AD$ and $G$ and $H$ are the intersections of $S$ with $CF$ and $DE$. Show that $AH=AG$.
Given a positive integer number $k$, define the function $f$ on the set of all positive integer numbers to itself by
\[f(n)=\begin{cases}1, &\text{if }n\le k+1\\ f(f(n-1))+f(n-f(n-1)), &\text{if }n>k+1\end{cases}\]
Show that the preimage of every positive integer number under $f$ is a finite non-empty set of consecutive positive integers.
What is the minimal value of $\sqrt{2x+1}+\sqrt{3y+1}+\sqrt{4z+1}$, if $x$, $y$ and $z$ are nonnegative real numbers such that $x+y+z=4$
There are $n$ rectangles drawn on the rectangular sheet of paper with the sides of the rectangles parallel to the sheet sides. The rectangles do not have pairwise common interior points. Prove that after cutting out the rectangles the sheet will split into not more than $n+1$ part.
A trio of lousy salespeople charge increasing prices on tomatoes as you buy more. The first charges you $x^1_1$ dollars for the $x_1$[i]th [/i]tomato you buy from him, the second charges $x^2_2$ dollars for the $x_2$[i]th[/i] tomato, and the third charges $x^3_3$ dollars for the $x_3$[i]th [/i]tomato. If you want to buy $100$ tomatoes for as cheap as possible, how many should you buy from the first salesperson?
Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if
$\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and
$\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar.
Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.
Prove that for every $n$ nonzero integer , there are infinite triples of nonzero integers $a, b$ and $c$ that satisfy the conditions:
1. $a + b + c = n$
2. $ax^2 + bx + c = 0$ has rational roots.
Let $ABC$ be a scalene triangle and $P$ be an interior point such that $\angle PBA=\angle PCA$. The lines $PB$ and $PC$ intersect the internal and external bisectors of $\angle BAC$ at $Q$ and $R$, respectively. Let $S$ be the point such that $CS$ is parallel to $AQ$ and $BS$ is parallel to $AR$. Prove that $Q$, $R$ and $S$ are colinear.
What is the least positive integer $x$ for which the expression $x^2 + 3x + 9$ has $3$ distinct prime divisors?
Each positive integer number $n \ ge 1$ is assigned the number $p_n$ which is the product of all its non-zero digits. For example, $p_6 = 6$, $p_ {32} = 6$, $p_ {203} = 6$. Let $S = p_1 + p_2 + p_3 + \dots + p_ {999}$. Find the largest prime that divides $S $.
The circumference with the radius $100$ cm is drawn on the cross-lined paper with the side of the squares $1$ cm. It neither comes through the vertices of the squares, nor touches the lines. How many squares can it pass through?
Does there exist a piecewise linear, continuous, surjective mapping $f: [0,1]\to [0,1]$ such that $f(0)=f(1)=0$, and for all positive integer $n$,
$$2.0001^{(n-10)} <P_n(f)<2.9999^{(n+10)}$$holds, where $P_n(f)$ is the number of points $x$ such that $\underbrace{f(\dotsc f}_n(x)\dotsc )=x$?
In each 1x1 square of a nxn board we write $n^2$ numbers with sum S.A move is choosing a 2x2 square and adding 1 to three numbers(from three different 1x1 squares).We say that a number n is good if we can make all the numbers on the board equal by applying a successive number of moves and it not depends of S.
a)Show that 6 is not good
b)Show that 4 and 1024 are good
Two straight lines are drawn on a plane, intersecting at an angle of $40^o$. A circle with center at point $O$ touches these lines. Let's consider a line, different from the given ones, tangent to the same circle and intersecting the given lines at points $B$ and $C$. What can the angle $\angle BOC$ be equal to?
For any $a$, $b$, $c > 0$ and for any $n \in \mathbb{N}^*$, prove the inequality$$(a - b)\left(\frac{a}{b}\right)^n+(b - c)\left(\frac{b}{c}\right)^n+(c - a)\left(\frac{c}{a}\right)^n\geq (a - b)\frac{a}{b}+(b - c)\frac{b}{c}+(c - a)\frac{c}{a}$$
Connecting the vertices of a regular $ n$-gon we obtain a closed (not necessarily convex) $ n$-gon. Show that if $ n$ is even, then there are two parallel segments among the connecting segments and if $ n$ is odd then there cannot be exactly two parallel segments.
How many sequences of real numbers $a_1,a_2,\ldots a_9$ satisfy \[|a_1-1|=|a_2-a_1|=\cdots=|a_9-a_8|=|1-a_9|=1?\]
[i]Proposed by Evan Chang [/i]
Calculate $ \begin{pmatrix}1&0&0& \ldots &0\\\binom{1}{0} &\binom{1}{1} &0& \ldots & 0 \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ \binom{n}{0} &\binom{n}{1} & \binom{n}{2} & \ldots & \binom{n}{n}\end{pmatrix}^{-1} . $