Found problems: 876
2009 IMC, 5
Let $n$ be a positive integer. An $n-\emph{simplex}$ in $\mathbb{R}^n$ is given by $n+1$ points $P_0, P_1,\cdots , P_n$, called its vertices, which do not all belong to the same hyperplane. For every $n$-simplex $\mathcal{S}$ we denote by $v(\mathcal{S})$ the volume of $\mathcal{S}$, and we write $C(\mathcal{S})$ for the center of the unique sphere containing all the vertices of $\mathcal{S}$.
Suppose that $P$ is a point inside an $n$-simplex $\mathcal{S}$. Let $\mathcal{S}_i$ be the $n$-simplex obtained from $\mathcal{S}$ by replacing its $i^{\text{th}}$ vertex by $P$. Prove that :
\[ \sum_{j=0}^{n}v(\mathcal{S}_j)C(\mathcal{S}_j)=v(\mathcal{S})C(\mathcal{S}) \]
1966 Putnam, A4
Prove that after deleting the perfect squares from the list of positive integers the number we find in the $n^{th}$ position is equal to $n+\{\sqrt{n}\},$ where $\{\sqrt{n}\}$ denotes the integer closest to $\sqrt{n}.$
2021 Romania National Olympiad, 4
Let be $f:\left[0,1\right]\rightarrow\left[0,1\right]$ a continuous and bijective function,such that :
$f\left(0\right)=0$.Then the following inequality holds:
$\left(\alpha+2\right)\cdotp\int_{0}^{1}x^{\alpha}\left(f\left(x\right)+f^{-1}\left(x\right)\right)\leq2,\forall\alpha\geq0 $
2018 Miklós Schweitzer, 7
Describe all functions $f: \{ 0,1\}^n \to \{ 0,1\}$ which satisfy the equation
\begin{align*}
& f(f(a_{11},a_{12},\dotsc ,a_{1n}),f(a_{21},a_{22},\dotsc ,a_{2n}),\dotsc ,f(a_{n1},a_{n2},\dotsc ,a_{nn}))\\
& = f(f(a_{11},a_{21},\dotsc ,a_{n1}),f(a_{12},a_{22},\dotsc ,a_{n2}),\dotsc ,f(a_{1n},a_{2n},\dotsc ,a_{nn}))\end{align*}
for arbitrary $a_{ij}\in \{ 0,1\}$ where $i,j\in \{1,2,\dotsc ,n\}.$
2002 Miklós Schweitzer, 7
Let the complex function $F(z)$ be regular on the punctuated disk $\{ 0<|z| < R\}$. By a [i]level curve[/i] we mean a component of the level set of $\mathrm{Re}F(z)$, that is, a maximal connected set on which $\mathrm{Re}F(z)$ is constant. Denote by $A(r)$ the union of those level curves that are entirely contained in the punctuated disk $\{ 0<|z|<r\}$. Prove that if the number of components of $A(r)$ has an upper bound independent of $r$ then $F(z)$ can only have a pole type singularity at $0$.
2004 Miklós Schweitzer, 6
Is is true that if the perfect set $F\subseteq [0,1]$ is of zero Lebesgue measure then those functions in $C^1[0,1]$ which are one-to-one on $F$ form a dense subset of $C^1[0,1]$?
(We use the metric
$$d(f,g)=\sup_{x\in[0,1]} |f(x)-g(x)| + \sup_{x\in[0,1]} |f'(x)-g'(x)|$$
to define the topology in the space $C^1[0,1]$ of continuously differentiable real functions on $[0,1]$.)
2018 Korea USCM, 7
Suppose a $3\times 3$ matrix $A$ satisfies $\mathbf{v}^t A \mathbf{v} > 0$ for any vector $\mathbf{v} \in\mathbb{R}^3 -\{0\}$. (Note that $A$ may not be a symmetric matrix.)
(1) Prove that $\det(A)>0$.
(2) Consider diagonal matrix $D=\text{diag}(-1,1,1)$. Prove that there's exactly one negative real among eigenvalues of $AD$.
1976 Putnam, 1
$P$ is an interior point of the angle whose sides are the rays $OA$ and $OB.$ Locate $X$ on $OA$ and $Y$ on $OB$ so that the line segment $\overline{XY}$ contains $P$ and so that the product $(PX)(PY)$ is a minimum.
2010 Miklós Schweitzer, 11
For problem 11 , i couldn’t find the correct translation , so i just posted the hungarian version . If anyone could translate it ,i would be very thankful .
[tip=see hungarian]Az $X$ ́es$ Y$ valo ́s ́ert ́eku ̋ v ́eletlen v ́altoz ́ok maxim ́alkorrel ́acio ́ja az $f(X)$ ́es $g(Y )$ v ́altoz ́ok korrela ́cio ́j ́anak szupr ́emuma az olyan $f$ ́es $g$ Borel m ́erheto ̋, $\mathbb{R} \to \mathbb{R}$ fu ̈ggv ́enyeken, amelyekre $f(X)$ ́es $g(Y)$ v ́eges sz ́ora ́su ́. Legyen U a $[0,2\pi]$ interval- lumon egyenletes eloszl ́asu ́ val ́osz ́ınu ̋s ́egi v ́altozo ́, valamint n ́es m pozit ́ıv eg ́eszek. Sz ́am ́ıtsuk ki $\sin(nU)$ ́es $\sin(mU)$ maxim ́alkorrela ́ci ́oja ́t. [/tip]
Edit:
[hide=Translation thanks to @tintarn] The maximal correlation of two random variables $X$ and $Y$ is defined to be the supremum of the correlations of $f(X)$ and $g(Y)$ where $f,g:\mathbb{R} \to \mathbb{R}$ are measurable functions such that $f(X)$ and $g(Y)$ is (almost surely?) finite.
Let $U$ be the uniformly distributed random variable on $[0,2\pi]$ and let $m,n$ be positive integers. Compute the maximal correlation of $\sin(nU)$ and $\sin(mU)$.
(Remark: It seems that to make sense we should require that $E[f(X)]$ and $E[g(Y)]$ as well as $E[f(X)^2]$ and $E[g(Y)^2]$ are finite.
In fact, we may then w.l.o.g. assume that $E[f(X)]=E[g(Y)]=0$ and $E[f(Y)^2]=E[g(Y)^2]=1$.)[/hide]
2018 Korea USCM, 2
Suppose a $n\times n$ real matrix $A$ satisfies $\text{tr}(A)=2018$, $\text{rank}(A)=1$. Prove that $A^2=2018 A$.
1954 Miklós Schweitzer, 10
[b]10.[/b] Given a triangle $ABC$, construct outwards over the sides $AB, BC, CA$ similiar isosceles triangles $ABC_{1}, BCA_{1}$ and $CAB_{1}$. Prove that the straight lines $AA_{1}. BB_{1}$ and $CC_{1}$ are concurrent. Is this statemente true in elliptic and hyperbolic geometry, too? [b](G. 19)[/b]
1956 Miklós Schweitzer, 5
[b]5.[/b] On a circle consider $n$ points among which there acts a repulsive force inversely proportional to the square of their distance. Prove that the point system is in stable equilibrium if and only if the points form a regular $n$-gon; in other words, considering the sum of the reciprocal distances of the $\binom{n}{2}$ pairs of points which can be chosen from among the $n$ given points, this sum is minimal if and only if the points lie at the vertices of a regular $n$-gon. [b](G. 2)[/b]
1960 Miklós Schweitzer, 1
[b]1.[/b] Consider in the plane a set $H$ of pairwise disjoint circles of radius 1 such that, for infinitely many positive integers $n$, the circle $k_n$ with centre at the origin and of radius $n$ contains at least $cn^2$ elements of the set $H$. Prove that there exists a straight line which intersects infinitely many of the circles of $H$. Show further that if we require only that the circles $k_n$ contain o(n²) elements of $H$, the proposition will be false. [b](G. 5)[/b]
1960 Miklós Schweitzer, 4
[b]4.[/b] Let $\left (H_{\alpha} \right ) $ be a system of sets of integers having the property that for any $\alpha _1 \neq \alpha _2 , H_{\alpha _1}\cap H_{\alpha _2}$ is a finite set and $H_{{\alpha} _1} \neq H_{{\alpha} _2}$. Prove that there exists a system $\left (H_{\alpha} \right )$ of this kind whose cardinality is that of the continuum. Prove further that if none of the intersections of two sets $H_\alpha$ contains more than $K$ elements, then the system $\left (H_{\alpha} \right ) $ is countable ($K$ is an arbitrary fixed integer). [b](St. 4)[/b]
2000 Putnam, 2
Prove that there exist infinitely many integers $n$ such that $n$, $n+1$, $n+2$ are each the sum of the squares of two integers. [Example: $0=0^2+0^2$, $1=0^2+1^2$, $2=1^2+1^2$.]
1956 Miklós Schweitzer, 8
[b]8.[/b] Let $(a_n)_{n=1}^{\infty}$ be a sequence of positive numbers and suppose that $\sum_{n=1}^{\infty} a_n^2$ is divergent. Let further $0<\epsilon<\frac{1}{2}$. Show that there exists a sequence $(b_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}b_n^2$ is convergent and
$\sum_{n=1}^{N}a_n b_n >(\sum_{n=1}^{N}a_n^2)^{\frac{1}{2}-\epsilon}$
for every positive integer $N$. [b](S. 8)[/b]
2019 IMC, 10
$2019$ points are chosen at random, independently, and distributed uniformly in the unit disc $\{(x,y)\in\mathbb R^2: x^2+y^2\le 1\}$. Let $C$ be the convex hull of the chosen points. Which probability is larger: that $C$ is a polygon with three vertices, or a polygon with four vertices?
[i]Proposed by Fedor Petrov, St. Petersburg State University[/i]
2012 IMC, 3
Given an integer $n>1$, let $S_n$ be the group of permutations of the numbers $1,\;2,\;3,\;\ldots,\;n$. Two players, A and B, play the following game. Taking turns, they select elements (one element at a time) from the group $S_n$. It is forbidden to select an element that has already been selected. The game ends when the selected elements generate the whole group $S_n$. The player who made the last move loses the game. The first move is made by A. Which player has a winning strategy?
[i]Proposed by Fedor Petrov, St. Petersburg State University.[/i]
1971 Putnam, B5
Show that the graphs in the $x-y$ plane of all solutions of the system of differential equations $$x''+y'+6x=0, y''-x'+6y=0 ('=d/dt)$$ which satisfy $x'(0)=y'(0)=0$ are hypocycloids, and find the radius of the fixed circle and the two possible values of the radius of the rolling circle for each such solution. (A hypocycloid is the path described by a fixed point on the circumference of a circle which rolls on the inside of a given fixed circle.)
2004 Putnam, A2
For $i=1,2,$ let $T_i$ be a triangle with side length $a_i,b_i,c_i,$ and area $A_i.$ Suppose that $a_1\le a_2, b_1\le b_2, c_1\le c_2,$ and that $T_2$ is an acute triangle. Does it follow that $A_1\le A_2$?
1979 Putnam, B5
In the plane, let $C$ be a closed convex set that contains $(0,0)$ but no other point with integer coordinates. Suppose that $A(C)$, the area of $C$, is equally distributed among the four quadrants. Prove that $A(C) \leq 4.$
2008 IMC, 4
Let $ \mathbb{Z}[x]$ be the ring of polynomials with integer coefficients, and let $ f(x), g(x) \in\mathbb{Z}[x]$ be nonconstant polynomials such that $ g(x)$ divides $ f(x)$ in $ \mathbb{Z}[x]$. Prove that if the polynomial $ f(x)\minus{}2008$ has at least 81 distinct integer roots, then the degree of $ g(x)$ is greater than 5.
ICMC 6, 4
Let $\mathcal{G}$ be a simple graph with $n$ vertices and $m$ edges such that no two cycles share an edge. Prove that $2m < 3n$.
[i]Note[/i]: A [i]simple graph[/i] is a graph with at most one edge between any two vertices and no edges from any vertex to itself. A [i]cycle[/i] is a sequence of distinct vertices $v_1, \dots, v_n$ such that there is an edge between any two consecutive vertices, and between $v_n$ and $v_1$.
[i]Proposed by Ethan Tan[/i]
2001 Putnam, 5
Let $a$ and $b$ be real numbers in the interval $\left(0,\tfrac{1}{2}\right)$, and let $g$ be a continuous real-valued function such that $g(g(x))=ag(x)+bx$ for all real $x$. Prove that $g(x)=cx$ for some constant $c$.
2020 Brazil Undergrad MO, Problem 5
Let $N$ a positive integer.
In a spaceship there are $2 \cdot N$ people, and each two of them are friends or foes (both relationships are symmetric). Two aliens play a game as follows:
1) The first alien chooses any person as she wishes.
2) Thenceforth, alternately, each alien chooses one person not chosen before such that the person chosen on each turn be a friend of the person chosen on the previous turn.
3) The alien that can't play in her turn loses.
Prove that second player has a winning strategy [i]if, and only if[/i], the $2 \cdot N$ people can be divided in $N$ pairs in such a way that two people in the same pair are friends.