Found problems: 623
Prove that these two statements are equivalent for an $n$ dimensional vector space $V$:
[b]$\cdot$[/b] For the linear transformation $T:V\longrightarrow V$ there exists a base for $V$ such that the representation of $T$ in that base is an upper triangular matrix.
[b]$\cdot$[/b] There exist subspaces $\{0\}\subsetneq V_1 \subsetneq ...\subsetneq V_{n-1}\subsetneq V$ such that for all $i$, $T(V_i)\subseteq V_i$.
Two equal-sized regular $n$-gons intersect to form a $2n$-gon $C$. Prove that the sum of the sides of $C$ which form part of one $n$-gon equals half the perimeter of $C$.
[i]Alternative formulation:[/i]
Let two equal regular $n$-gons $S$ and $T$ be located in the plane such that their intersection $S\cap T$ is a $2n$-gon (with $n\ge 3$). The sides of the polygon $S$ are coloured in red and the sides of $T$ in blue.
Prove that the sum of the lengths of the blue sides of the polygon $S\cap T$ is equal to the sum of the lengths of its red sides.
On a coordinate plane are placed four counters, each of whose centers has integer coordinates. One can displace any counter by the vector joining the centers of two of the other counters. Prove that any two preselected counters can be made to coincide by a finite sequence of moves.
[i]Р. Sadykov[/i]
Let $ S$ be any point on the circumscribed circle of $ PQR.$ Then the feet of the perpendiculars from S to the three sides of the triangle lie on the same straight line. Denote this line by $ l(S, PQR).$ Suppose that the hexagon $ ABCDEF$ is inscribed in a circle. Show that the four lines $ l(A,BDF),$ $ l(B,ACE),$ $ l(D,ABF),$ and $ l(E,ABC)$ intersect at one point if and only if $ CDEF$ is a rectangle.
Let $ a,\ b$ be real numbers satisfying $ \int_0^1 (ax\plus{}b)^2dx\equal{}1$.
Determine the values of $ a,\ b$ for which $ \int_0^1 3x(ax\plus{}b)\ dx$ is maximized.
In the space given three segments $A_1A_2, B_1B_2$ and $C_1C_2$, do not lie in one plane and intersect at a point $P$. Let $O_{ijk}$ be center of sphere that passes through the points $A_i, B_j, C_k$ and $P$. Prove that $O_{111}O_{222}, O_{112}O_{221}, O_{121}O_{212}$ and$O_{211}O_{122}$ intersect at one point. (P.Kozhevnikov)
There are $4$ distinct codes used in an intelligence station, one of them applied in each week. No two codes used in two adjacent weeks are the same code. Knowing that code $A$ is used in the first week, find the probability that code $A$ is used in the seventh week.
A set of five different positive integers is called [i]virtual[/i] if the greatest common divisor of any three of its elements is greater than $1$, but the greatest common divisor of any four of its elements is equal to $1$. Prove that, in any virtual set, the product of its elements has at least $2020$ distinct positive divisors.
[i]Proposed by Víctor Almendra[/i]
Let $P$ be a polynomial with each root is real and each coefficient is either $1$ or $-1$. The degree of $P$ can be at most ?
$ \textbf{(A)}\ 5
\qquad\textbf{(B)}\ 4
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 2
\qquad\textbf{(E)}\ \text{None}
$
For a prime $ p$ an a positive integer $ n$, denote by $ \nu_p(n)$ the exponent of $ p$ in the prime factorization of $ n!$. Given a positive integer $ d$ and a finite set $ \{p_1,p_2,\ldots, p_k\}$ of primes, show that there are infinitely many positive integers $ n$ such that $ \nu_{p_i}(n) \equiv 0 \pmod d$, for all $ 1\leq i \leq k$.
[b]1.[/b] Let $a_{1}, a_{2}, \dots , a_{n}$ and $b_{1}, b_{2}, \dots , b_{m}$ be $n+m$ unit vectors in the $r$-dimensional Euclidean space $E_{r} (n,m \leq r)$; let $a_{1}, a_{2}, \dots , a_{n}$ as well as $b_{1}, b_{2}, \dots , b_{m}$ be mutually orthogonal. For any vector $x \in E_{r}$, consider
$Tx= \sum_{i=1}^{n}\sum_{k=1}^{m}(x,a_{i})(a_{i},b_{k})b_{k}$
($(a,b)$ denotes the scalar product of $a$ and $b$). Show that the sequence $(T^{k}x)^{\infty}_{ k =0}$, where $T^{0} x= x$ and $T^{k} x = T(T^{k-1}x)$, is convergent and give a geometrical characterization of how the limit depends on $x$. [b](S. 14)[/b]
Let $H$ be a complex Hilbert space. Let $T:H\to H$ be a bounded linear operator such that $|(Tx,x)|\le\lVert x\rVert^2$ for each $x\in H$. Assume that $\mu\in\mathbb C$, $|\mu|=1$, is an eigenvalue with the corresponding eigenspace $E=\{\phi\in H:T\phi=\mu\phi\}$. Prove that the orthogonal complement $E^\perp=\{x\in H:\forall\phi\in E:(x,\phi)=0\}$ of $E$ is $T$-invariant, i.e., $T(E^\perp)\subseteq E^\perp$.
What is the maximal dimension of a linear subspace $ V$ of the vector space of real $ n \times n$ matrices such that for all $ A$ in $ B$ in $ V$, we have $ \text{trace}\left(AB\right) \equal{} 0$ ?
The [i]cross[/i] of a convex $n$-gon is the quadratic mean of the lengths between the possible pairs of vertices. For example, the cross of a $3 \times 4$ rectangle is $\sqrt{ \dfrac{3^2 + 3^2 + 4^2 + 4^2 + 5^2 + 5^2}{6} } = \dfrac{5}{3} \sqrt{6}$.
Suppose $S$ is a dodecagon ($12$-gon) inscribed in a unit circle. Find the greatest possible cross of $S$.
On a board are drawn the points $A,B,C,D$. Yetti constructs the points $A^\prime,B^\prime,C^\prime,D^\prime$ in the following way: $A^\prime$ is the symmetric of $A$ with respect to $B$, $B^\prime$ is the symmetric of $B$ wrt $C$, $C^\prime$ is the symmetric of $C$ wrt $D$ and $D^\prime$ is the symmetric of $D$ wrt $A$.
Suppose that Armpist erases the points $A,B,C,D$. Can Yetti rebuild them?
$\star \, \, \star \, \, \star$
[b]Note.[/b] [i]Any similarity to real persons is purely accidental.[/i]
Let $n\ge 3$ be an integer. Two players, Ana and Beto, play the following game. Ana tags the vertices of a regular $n$- gon with the numbers from $1$ to $n$, in any order she wants. Every vertex must be tagged with a different number. Then, we place a turkey in each of the $n$ vertices.
These turkeys are trained for the following. If Beto whistles, each turkey moves to the adjacent vertex with greater tag. If Beto claps, each turkey moves to the adjacent vertex with lower tag.
Beto wins if, after some number of whistles and claps, he gets to move all the turkeys to the same vertex. Ana wins if she can tag the vertices so that Beto can't do this. For each $n\ge 3$, determine which player has a winning strategy.
[i]Proposed by Victor and Isaías de la Fuente[/i]
A particle moves on a circle with center $O$, starting from rest at a point $P$ and coming to rest again at a point $Q$, without coming to rest at any intermediate point. Prove that the acceleration vector of the particle does not vanish at any point between $P$ and $ Q$ and that, at some point $R$ between $P$ and $Q$, the acceleration vector points in along the radius $RO.$
There are ten coins a line, which are indistinguishable. It is known that two of them are false and have consecutive positions on the line. For each set of positions, you may ask how many false coins it contains. Is it possible to identify the false coins by making only two of those questions, without knowing the answer to the first question before making the second?
Let $v \in \mathbb{R}^2$ a vector of length 1 and $A$ a $2 \times 2$ matrix with real entries such that:
(i) The vectors $A v, A^2 v$ y $A^3 v$ are also of length 1.
(ii) The vector $A^2 v$ isn't equal to $\pm v$ nor to $\pm A v$.
Prove that $A^t A=I_2$.
Let $A$ be an $n\times n$ matrix of real numbers for some $n\ge 1.$ For each positive integer $k,$ let $A^{[k]}$ be the matrix obtained by raising each entry to the $k$th power. Show that if $A^k=A^{[k]}$ for $k=1,2,\cdots,n+1,$ then $A^k=A^{[k]}$ for all $k\ge 1.$
On the plane are given unit vectors $\overrightarrow{a_1},\overrightarrow{a_2},\overrightarrow{a_3}$. Show that one can choose numbers $c_1,c_2,c_3 \in \{-1,1\}$ such that the length of the vector $c_1\overrightarrow{a_1}+c_2\overrightarrow{a_2}+c_3\overrightarrow{a_3}$ is at least $2$.
We are given a set $S=\{z_1,z_2,\cdots ,z_{1993}\}$, where $z_1,z_2,\cdots ,z_{1993}$ are nonzero complex numbers (also viewed as nonzero vectors in the plane). Prove that we can divide $S$ into some groups such that the following conditions are satisfied:
(1) Each element in $S$ belongs and only belongs to one group;
(2) For any group $p$, if we use $T(p)$ to denote the sum of all memebers in $p$, then for any memeber $z_i (1\le i \le 1993)$ of $p$, the angle between $z_i$ and $T(p)$ does not exceed $90^{\circ}$;
(3) For any two groups $p$ and $q$, the angle between $T(p)$ and $T(q)$ exceeds $90^{\circ}$ (use the notation introduced in (2)).
A block of mass $m$ on a frictionless inclined plane of angle $\theta$ is connected by a cord over a small frictionless, massless pulley to a second block of mass $M$ hanging vertically, as shown. If $M=1.5m$, and the acceleration of the system is $\frac{g}{3}$, where $g$ is the acceleration of gravity, what is $\theta$, in degrees, rounded to the nearest integer?
[asy]size(12cm);
pen p=linewidth(1), dark_grey=gray(0.25), ll_grey=gray(0.90), light_grey=gray(0.75);
pair B = (-1,-1);
pair C = (-1,-7);
pair A = (-13,-7);
path inclined_plane = A--B--C--cycle;
draw(inclined_plane, p);
real r = 1; // for marking angles
draw(arc(A, r, 0, degrees(B-A))); // mark angle
label("$\theta$", A + r/1.337*(dir(C-A)+dir(B-A)), (0,0), fontsize(16pt)); // label angle as theta
draw((C+(-r/2,0))--(C+(-r/2,r/2))--(C+(0,r/2))); // draw right angle
real h = 1.2; // height of box
real w = 1.9; // width of box
path box = (0,0)--(0,h)--(w,h)--(w,0)--cycle; // the box
// box on slope with label
picture box_on_slope;
filldraw(box_on_slope, box, light_grey, black);
label(box_on_slope, "$m$", (w/2,h/2));
pair V = A + rotate(90) * (h/2 * dir(B-A)); // point with distance l/2 from AB
pair T1 = dir(125); // point of tangency with pulley
pair X1 = intersectionpoint(T1--(T1 - rotate(-90)*(2013*dir(T1))), V--(V+B-A)); // construct midpoint of right side of box
draw(T1--X1); // string
add(shift(X1-(w,h/2))*rotate(degrees(B-A), (w,h/2)) * box_on_slope);
// picture for the hanging box
picture hanging_box;
filldraw(hanging_box, box, light_grey, black);
label(hanging_box, "$M$", (w/2,h/2));
pair T2 = (1,0);
pair X2 = (1,-3);
draw(T2--X2); // string
add(shift(X2-(w/2,h)) * hanging_box);
// Draws the actual pulley
filldraw(unitcircle, grey, p); // outer boundary of pulley wheel
filldraw(scale(0.4)*unitcircle, light_grey, p); // inner boundary of pulley wheel
path pulley_body=arc((0,0),0.3,-40,130)--arc((-1,-1),0.5,130,320)--cycle; // defines "arm" of pulley
filldraw(pulley_body, ll_grey, dark_grey+p); // draws the arm
filldraw(scale(0.18)*unitcircle, ll_grey, dark_grey+p); // inner circle of pulley[/asy][i](Proposed by Ahaan Rungta)[/i]
Denote by $\mathbb{V}$ the real vector space of all real polynomials in one variable, and let $\gamma :\mathbb{V}\to \mathbb{R}$ be a linear map. Suppose that for all $f,g\in \mathbb{V}$ with $\gamma(fg)=0$ we have $\gamma(f)=0$ or $\gamma(g)=0$. Prove that there exist $c,x_0\in \mathbb{R}$ such that
\[ \gamma(f)=cf(x_0)\quad \forall f\in \mathbb{V}\]
Let $ x_1,x_2,..,x_n$ be non-negative numbers whose sum is $ 1$ . Show that there exist numbers $ a_1,a_2,\ldots ,a_n$ chosen from amongst $ 0,1,2,3,4$ such that $ a_1,a_2,\ldots ,a_n$ are different from $ 2,2,\ldots ,2$ and $ 2\leq a_1x_1\plus{}a_2x_2\plus{}\ldots\plus{}a_nx_n\leq 2\plus{}\frac{2}{3^n\minus{}1}$.