This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 85335

2000 Turkey Junior National Olympiad, 1

Let $ABC$ be a triangle with $\angle BAC = 90^\circ$. Construct the square $BDEC$ such as $A$ and the square are at opposite sides of $BC$. Let the angle bisector of $\angle BAC$ cut the sides $[BC]$ and $[DE]$ at $F$ and $G$, respectively. If $|AB|=24$ and $|AC|=10$, calculate the area of quadrilateral $BDGF$.

2016 Belarus Team Selection Test, 1

Let $a,b,c,d,x,y$ denote the lengths of the sides $AB, BC,CD,DA$ and the diagonals $AC,BD$ of a cyclic quadrilateral $ABCD$ respectively. Prove that $$(\frac{1}{a}+\frac{1}{c})^2+(\frac{1}{b}+\frac{1}{d})^2 \geq 8 ( \frac{1}{x^2}+\frac{1}{y^2})$$

2015 Postal Coaching, Problem 3

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

2020 Jozsef Wildt International Math Competition, W29

Tags: inequalities
For $p>1,\frac1p+\frac1q=1$ and $r>1$. If $x_{00},y_{00}>0$, and reals $x_{ij},y_{ij},i=1,2,\ldots,n$, $j=1,2,\ldots,m$, then prove that $$\left(\frac{\left(\displaystyle\sum_{j=1}^m\displaystyle\sum_{i=1}^n(x_{ij}+y_{ij})^r\right)^{1/r}}{(x_{00}+y_{00})^{1/q}}\right)^p\le\left(\frac{\left(\displaystyle\sum_{j=1}^m\displaystyle\sum_{i=1}^nx_{ij}^r\right)^{1/r}}{x_{00}^{1/q}}\right)^p+\left(\frac{\left(\displaystyle\sum_{j=1}^m\displaystyle\sum_{i=1}^ny_{ij}^r\right)^{1/r}}{y_{00}^{1/q}}\right)^p$$ with equality if and only if either $x_{ij}=y_{ij}=0$ for $i=1,\ldots,n,j=1,\ldots,m$ or $x_{ij}=\alpha y_{ij}$ for $i=0,1,\ldots,n,j=0,1,\ldots,m$, and some $\alpha>0$. [i]Proposed by Chang-Jian Zhao[/i]

2015 Harvard-MIT Mathematics Tournament, 4

Compute the number of sequences of integers $(a_1,\ldots,a_{200})$ such that the following conditions hold. [list] [*] $0\leq a_1<a_2<\cdots<a_{200}\leq 202.$ [*] There exists a positive integer $N$ with the following property: for every index $i\in\{1,\ldots,200\}$ there exists an index $j\in\{1,\ldots,200\}$ such that $a_i+a_j-N$ is divisible by $203$. [/list]

2018 Czech-Polish-Slovak Match, 1

Determine all functions $f : \mathbb R \to \mathbb R$ such that for all real numbers $x$ and $y$, $$f(x^2 + xy) = f(x)f(y) + yf(x) + xf(x+y).$$ [i]Proposed by Walther Janous, Austria[/i]

2022 Polish Junior Math Olympiad First Round, 6.

In each square of a $10\times 10$ board, there is an arrow pointing upwards, downwards, left, or right. Prove that it is possible to remove $50$ arrows from the board, such that no two remaining arrows point at each other.

2006 Moldova National Olympiad, 10.4

Find all real values of the real parameter $a$ such that the equation \[ 2x^{2}-6ax+4a^{2}-2a-2+\log_{2}(2x^{2}+2x-6ax+4a^{2})= \] \[ =\log_{2}(x^{2}+2x-3ax+2a^{2}+a+1). \] has a unique solution.

2020 CCA Math Bonanza, L3.1

Tags:
For some positive integer $n$, the sum of all odd positive integers between $n^2-n$ and $n^2+n$ is a number between $9000$ and $10000$, inclusive. Compute $n$. [i]2020 CCA Math Bonanza Lightning Round #3.1[/i]

2013 Princeton University Math Competition, 5

Tags:
Mereduth has many red boxes and many blue boxes. Coloon has placed five green boxes in a row on the ground, and Mereduth wants to arrange some number of her boxes on top of his row. Assume that each box must be placed so that it straddles two lower boxes. Including the one with no boxes, how many arrangements can Mereduth make?

1965 Polish MO Finals, 3

$ n > 2 $ points are chosen on a circle and each of them is connected to every other by a segment. Is it possible to draw all of these segments in one sequence, i.e. so that the end of the first segment is the beginning of the second, the end of the second - the beginning of the third, etc., and so that the end of the last segment is the beginning of the first?

2019 Teodor Topan, 3

Let be a positive real number $ r, $ a natural number $ n, $ and a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ satisfying $ f(rxy)=(f(x)f(y))^n, $ for any real numbers $ x,y. $ [b]a)[/b] Give three distinct examples of what $ f $ could be if $ n=1. $ [b]b)[/b] For a fixed $ n\ge 2, $ find all possibilities of what $ f $ could be. [i]Bogdan Blaga[/i]

1968 Putnam, A3

Tags: combinatorics , set
Let $S$ be a finite set and $P$ the set of all subsets of $S$. Show that one can label the elements of $P$ as $A_i$ such that (1) $A_1 =\emptyset$. (2) For each $n\geq1 $ we either have $A_{n-1}\subset A_{n}$ and $|A_{n} \setminus A_{n-1}|=1$ or $A_{n}\subset A_{n-1}$ and $|A_{n-1} \setminus A_{n}|=1.$

2005 Germany Team Selection Test, 2

Tags: inequalities
If $a$, $b$ ,$c$ are three positive real numbers such that $ab+bc+ca = 1$, prove that \[ \sqrt[3]{ \frac{1}{a} + 6b} + \sqrt[3]{\frac{1}{b} + 6c} + \sqrt[3]{\frac{1}{c} + 6a } \leq \frac{1}{abc}. \]

2017 CIIM, Problem 6

Tags:
Let $G$ be a simple, connected and finite grafo. A hunter and an invisible rabbit play in the graph $G$. The rabbit is initially in a vertex $w_0$. In the $k$-th turn (for $k \geq 0$) the hunter picks freely a vertex $v_k$. If $v_k = w_k$, the rabbit is capture and the game ends. If not, the rabbit moves invisibly by an edge of $w_k$ to $w_{k+1}$ ($w_k$ and $w_{k+1}$ are adjacent and therefore distinct) and the game continues. The hunter knows these rules and the graph $G$. After the $k-$th turn he knows that $w_k \not = v_k$, but he gets no more information. Characterize the graphs $G$ such that the hunter has an strategy that guaranties that he can capture the rabbit in at most $N$ turns for some positive integer $N$. Here $N$ must depend only on $G$ and the strategy should work independently of the initial position and trajectory of the rabbit.

1997 AIME Problems, 1

How many of the integers between 1 and 1000, inclusive, can be expressed as the difference of the squares of two nonnegative integers?

2004 National Olympiad First Round, 15

Tags:
How many $10$-digit positive integers can be written by using four $0$s, five $1$s, and one $2$? $ \textbf{(A)}\ 1260 \qquad\textbf{(B)}\ 1134 \qquad\textbf{(C)}\ 756 \qquad\textbf{(D)}\ 630 \qquad\textbf{(E)}\ \text{None of above} $

LMT Guts Rounds, 2020 F16

Tags:
Compute $$\frac{2019! \cdot 2^{2019}}{(2020^2-2018^2)(2020^2-2016^2)\dots(2020^2-2^2)}.$$ [i]Proposed by Ada Tsui[/i]

1991 Putnam, B2

Define functions $f$ and $g$ as nonconstant, differentiable, real-valued functions on $R$. If $f(x+y)=f(x)f(y)-g(x)g(y)$, $g(x+y)=f(x)g(y)+g(x)f(y)$, and $f'(0)=0$, prove that $\left(f(x)\right)^2+\left(g(x)\right)^2=1$ for all $x$.

1997 Putnam, 4

Let $a_{m,n}$ denote the coefficient of $x^n$ in the expansion $(1+x+x^2)^n$. Prove the inequality for all integers $k\ge 0$ : \[ 0\le \sum_{\ell=0}^{\left\lfloor{\frac{2k}{3}}\right\rfloor} (-1)^{\ell} a_{k-\ell,\ell}\le 1 \]

1994 Mexico National Olympiad, 3

$ABCD$ is a parallelogram. Take $E$ on the line $AB$ so that $BE = BC$ and $B$ lies between $A$ and $E$. Let the line through $C$ perpendicular to $BD$ and the line through $E$ perpendicular to $AB$ meet at $F$. Show that $\angle DAF = \angle BAF$.

1996 Singapore Senior Math Olympiad, 2

Let $180^o < \theta_1 < \theta_2 <...< \theta_n = 360^o$. For $i = 1,2,..., n$, $P_i = (\cos \theta_i^o, \sin \theta_i^o)$ is a point on the circle $C$ with centre $(0,0)$ and radius $1$. Let $P$ be any point on the upper half of $C$. Find the coordinates of $P$ such that the sum of areas $[PP_1P_2] + [PP_2P_3] + ...+ [PP_{n-1}P_n]$ attains its maximum.

2009 Junior Balkan Team Selection Tests - Moldova, 5

Find the lowest odd positive integer with an odd number of divisors and is divisible by $d^2$ and $a+b+c+d+e+f$, where $a, b, c, d, e, f$ are consecutive prime numbers.

JOM 2023, 1

Does there exist a positive integer, $x$, such that $(x+2)^{2023}-x^{2023}$ has exactly $2023^{2023}$ factors? [i]Proposed by Wong Jer Ren[/i]

1998 IMC, 1

$V$ is a real vector space and $ f, f_{i}: V \rightarrow \mathbb{R} $ are linear for $i = 1, 2, ... , k.$ Also $f $ is zero at all points for which all of $ f_{i }$ are zero. Show that $ f $ is a linear combination of the $f_{i}$.