Found problems: 85335
II Soros Olympiad 1995 - 96 (Russia), 10.8
Is it possible to fill an $n \times n$ table with the numbers $-1$, $0$ and $1$ so that all $2n$ sums in each column and each row are different?
Solve the problem with
a) $n = 5$;
b) $n = 10$.
2004 Iran MO (3rd Round), 8
$\mathbb{P}$ is a n-gon with sides $l_1 ,...,l_n$ and vertices on a circle. Prove that no n-gon with this sides has area more than $\mathbb{P}$
2024-25 IOQM India, 25
A finite set $M$ of positive integers consists of distinct perfect squares and the number $92$. The average of the numbers in $M$ is $85$. If we remove $92$ from $M$, the average drops to $84$. If $N^2$ is the largest possible square in $M$, what is the value of $N$?
1977 Miklós Schweitzer, 3
Prove that if $ a,x,y$ are $ p$-adic integers different from $ 0$ and $ p | x, pa | xy$, then \[ \frac 1y \frac{(1\plus{}x)^y\minus{}1}{x} \equiv \frac{\log (1\plus{}x)}{x} \;\;\;\; ( \textrm{mod} \; a\ ) \\\\ .\]
[i]L. Redei[/i]
2012 Pre-Preparation Course Examination, 5
Suppose that for the linear transformation $T:V \longrightarrow V$ where $V$ is a vector space, there is no trivial subspace $W\subset V$ such that $T(W)\subseteq W$. Prove that for every polynomial $p(x)$, the transformation $p(T)$ is invertible or zero.
2004 All-Russian Olympiad Regional Round, 8.4
The cells of the $11 \times 111 \times11$ cube contain the numbers $ 1, 2, , . .. . . 1331$, once each number. Two worms are sent from one corner cube to the opposite corner. Each of them can crawl into a cube adjacent to the edge, while the first can crawl if the number in the adjacent cube differs by $8$, the second - if they differ by $ 9$. Is there such an arrangement of numbers that both worms can get to the opposite corner cube?
MathLinks Contest 7th, 5.3
If $ a\geq b\geq c\geq d > 0$ such that $ abcd\equal{}1$, then prove that \[ \frac 1{1\plus{}a} \plus{} \frac 1{1\plus{}b} \plus{} \frac 1{1\plus{}c} \geq \frac {3}{1\plus{}\sqrt[3]{abc}}.\]
2025 Caucasus Mathematical Olympiad, 6
A point $P$ is chosen inside a convex quadrilateral $ABCD$. Could it happen that$$PA = AB, \quad PB = BC, \quad PC = CD \quad \text{and} \quad PD = DA?$$
1993 ITAMO, 5
Prove the following inequality for any positive real numbers a,b,c not exceeding 1
$a^2b+b^2c+c^2a+1\ge a^2+b^2+c^2$
2018 Putnam, A5
Let $f: \mathbb{R} \to \mathbb{R}$ be an infinitely differentiable function satisfying $f(0) = 0$, $f(1) = 1$, and $f(x) \ge 0$ for all $x \in \mathbb{R}$. Show that there exist a positive integer $n$ and a real number $x$ such that $f^{(n)}(x) < 0$.
1994 Miklós Schweitzer, 8
Prove that a Hausdorff space X is countably compact iff for every open cover $\cal {U}$ there is a finite set $A \subset X$ such that $ \bigcup \{U \in {\cal U} : U \cap A \neq \emptyset \} = X$.
2018 Kyiv Mathematical Festival, 3
A circle is divided by $2018$ points into equal parts. Two players delete these points in turns. A player loses, if after his turn it is possible to draw a diameter of the circle such that there are no undeleted points on one side of it. Which player has a winning strategy?
2009 Princeton University Math Competition, 1
Find 100 times the area of a regular dodecagon inscribed in a unit circle. Round your answer to the nearest integer if necessary.
[asy]
defaultpen(linewidth(0.7)); real theta = 17; pen dr = rgb(0.8,0,0), dg = rgb(0,0.6,0), db = rgb(0,0,0.6)+linewidth(1);
draw(unitcircle,dg);
for(int i = 0; i < 12; ++i) {
draw(dir(30*i+theta)--dir(30*(i+1)+theta), db);
dot(dir(30*i+theta),Fill(rgb(0.8,0,0)));
} dot(dir(theta),Fill(dr)); dot((0,0),Fill(dr));
[/asy]
2011 QEDMO 9th, 6
Show that there are infinitely many pairs $(m, n)$ of natural numbers $m, n \ge 2$, for $m^m- 1$ is divisible by $n$ and $n^n- 1$ is divisible by $m$.
2000 Spain Mathematical Olympiad, 3
Two circles $C_1$ and $C_2$ with the respective radii $r_1$ and $r_2$ intersect in $A$ and $B.$ A variable line $r$ through $B$ meets $C_1$ and $C_2$ again at $P_r$ and $Q_r$ respectively. Prove that there exists a point $M,$ depending only on $C_1$ and $C_2,$ such that the perpendicular bisector of each segment $P_rQ_r$ passes through $M.$
1993 IMO Shortlist, 8
Let $c_1, \ldots, c_n \in \mathbb{R}$ with $n \geq 2$ such that \[ 0 \leq \sum^n_{i=1} c_i \leq n. \] Show that we can find integers $k_1, \ldots, k_n$ such that \[ \sum^n_{i=1} k_i = 0 \] and \[ 1-n \leq c_i + n \cdot k_i \leq n \] for every $i = 1, \ldots, n.$
[hide="Another formulation:"]
Let $x_1, \ldots, x_n,$ with $n \geq 2$ be real numbers such that \[ |x_1 + \ldots + x_n| \leq n. \] Show that there exist integers $k_1, \ldots, k_n$ such that \[ |k_1 + \ldots + k_n| = 0. \] and \[ |x_i + 2 \cdot n \cdot k_i| \leq 2 \cdot n -1 \] for every $i = 1, \ldots, n.$ In order to prove this, denote $c_i = \frac{1+x_i}{2}$ for $i = 1, \ldots, n,$ etc.
[/hide]
2024 Assara - South Russian Girl's MO, 5
Prove that $(100!)^{99} > (99!)^{100} > (100!)^{98}$.
[i]K.A.Sukhov[/i]
1989 China Team Selection Test, 4
$\forall n \in \mathbb{N}$, $P(n)$ denotes the number of the partition of $n$ as the sum of positive integers (disregarding the order of the parts), e.g. since $4 = 1+1+1+1 = 1+1+2 = 1+3 = 2+2 = 4$, so $P(4)=5$. "Dispersion" of a partition denotes the number of different parts in that partitation. And denote $q(n)$ is the sum of all the dispersions, e.g. $q(4)=1+2+2+1+1=7$. $n \geq 1$. Prove that
(1) $q(n) = 1 + \sum^{n-1}_{i=1} P(i).$
(2) $1 + \sum^{n-1}_{i=1} P(i) \leq \sqrt{2} \cdot n \cdot P(n)$.
2019 India PRMO, 11
How many distinct triangles $ABC$ are tjere, up to simplilarity, such that the magnitudes of the angles $A, B$ and $C$ in degrees are positive integers and satisfy
$$\cos{A}\cos{B} + \sin{A}\sin{B}\sin{kC} = 1$$
for some positive integer $k$, where $kC$ does not exceet $360^{\circ}$?
2023 Hong Kong Team Selection Test, Problem 1
Mandy needs to wake up early for attending a mathematics contest. She has set an alarm in her smartphone every 15 minutes since 5:30 am. If an alarm is not pressed off by her or her mother (or anything else), it will ring for a while, stop for a while, then will ring again 9 minutes later as the first ring, and so on (e.g. if the first alarm is not pressed off, it will ring again at 5:39 am). Also each alarm will work independently. Now suppose each ring-tone lasts for $x$ minutes, and the smartphone has eventually rung for 50 minutes before Mandy wakes up at 6:30 am (assume no one has pressed off any alarm before that). Find the value of $x$.
2004 Cono Sur Olympiad, 2
Given a circle $C$ and a point $P$ on its exterior, two tangents to the circle are drawn through $P$, with $A$ and $B$ being the points of tangency. We take a point $Q$ on the minor arc $AB$ of $C$. Let $M$ be the intersection of $AQ$ with the line perpendicular to $AQ$ that goes through $P$, and let $N$ be the intersection of $BQ$ with the line perpendicular to $BQ$ that goes through $P$.
Show that, by varying $Q$ on the minor arc $AB$, all of the lines $MN$ pass through the same point.
2012-2013 SDML (High School), 6
Naoki's favorite positive integer $n$ is a two-digit number with distinct digits. It also has the property that when it is divided by $10$, $12$, and $14$, the remainder has a units digit of one. What is the value of $n$?
2013 Czech-Polish-Slovak Match, 1
Let $a$ and $b$ be integers, where $b$ is not a perfect square. Prove that $x^2 + ax + b$ may be the square of an integer only for finite number of integer values of $x$.
(Martin Panák)
1980 Vietnam National Olympiad, 1
Prove that for any tetrahedron in space, it is possible to find two perpendicular planes such that ratio between the projections of the tetrahedron on the two planes lies in the interval $[\frac{1}{\sqrt{2}}, \sqrt{2}].$
2015 Azerbaijan IMO TST, 1
We say that $A$$=${$a_1,a_2,a_3\cdots a_n$} consisting $n>2$ distinct positive integers is $good$ if for every $i=1,2,3\cdots n$ the number ${a_i}^{2015}$ is divisible by the product of all numbers in $A$ except $a_i$. Find all integers $n>2$ such that exists a $good$ set consisting of $n$ positive integers.