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

1969 AMC 12/AHSME, 15
Tags: geometry
In a circle with center at $O$ and radius $r$, chord $AB$ is drawn with length equal to $r$ (units). From $O$ a perpendicular to $AB$ meets $AB$ at $M$. From $M$ a perpendicular to $OA$ meets $OA$ at $D$. In terms of $r$ the area of triangle $MDA$, in appropriate square units, is: $\textbf{(A) }\dfrac{3r^2}{16}\qquad \textbf{(B) }\dfrac{\pi r^2}{16}\qquad \textbf{(C) }\dfrac{\pi r^2\sqrt2}{8}\qquad \textbf{(D) }\dfrac{r^2\sqrt3}{32}\qquad \textbf{(E) }\dfrac{r^2\sqrt6}{48}$

2006 China Team Selection Test, 1
Tags: combinatorics , inequalities
Let $A$ be a non-empty subset of the set of all positive integers $N^*$. If any sufficient big positive integer can be expressed as the sum of $2$ elements in $A$(The two integers do not have to be different), then we call that $A$ is a divalent radical. For $x \geq 1$, let $A(x)$ be the set of all elements in $A$ that do not exceed $x$, prove that there exist a divalent radical $A$ and a constant number $C$ so that for every $x \geq 1$, there is always $\left| A(x) \right| \leq C \sqrt{x}$.

Denmark (Mohr) - geometry, 1991.5
Tags: geometry , combinatorial geometry , combinatorics , circles , point
Show that no matter how $15$ points are plotted within a circle of radius $2$ (circle border included), there will be a circle with radius $1$ (circle border including) which contains at least three of the $15$ points.

2013 ISI Entrance Examination, 7
Tags: number theory , quadratic , relatively prime
Find all natural numbers $N$ for which $N(N-101)$ is a perfect square.

1949-56 Chisinau City MO, 47
Tags: algebra , geometry
Determine the type of triangle if the lengths of its sides $a, b, c$ satisfy the relation $$a^4 + b^4 + c^4 = a^2b^2 + b^2c^2 + c^2a^2$$

2023-24 IOQM India, 28
Tags:
On each side of an equilateral triangle with side length $n$ units, where $n$ is an integer, $1 \leq n \leq 100$, consider $n-1$ points that divide the side into $n$ equal segments. Through these points, draw lines parallel to the sides of the triangle, obtaining a net of equilateral triangles of side length one unit. On each of the vertices of these small triangles, place a coin head up. Two coins are said to be adjacent if the distance between them is 1 unit. A move consists of flipping over any three mutually adjacent coins. Find the number of values of $n$ for which it is possible to turn all coins tail up after a finite number of moves.

1981 IMO Shortlist, 13
Tags: algebra , polynomial
Let $P$ be a polynomial of degree $n$ satisfying \[P(k) = \binom{n+1}{k}^{-1} \qquad \text{ for } k = 0, 1, . . ., n.\] Determine $P(n + 1).$

1990 Bulgaria National Olympiad, Problem 3
Tags: function , polynomial , number theory
Let $n=p_1p_2\cdots p_s$, where $p_1,\ldots,p_s$ are distinct odd prime numbers. (a) Prove that the expression $$F_n(x)=\prod\left(x^{\frac n{p_{i_1}\cdots p_{i_k}}}-1\right)^{(-1)^k},$$where the product goes over all subsets $\{p_{i_1},\ldots,p_{i_k}\}$ or $\{p_1,\ldots,p_s\}$ (including itself and the empty set), can be written as a polynomial in $x$ with integer coefficients. (b) Prove that if $p$ is a prime divisor of $F_n(2)$, then either $p\mid n$ or $n\mid p-1$.

2000 Putnam, 5
Tags: induction
Let $S_0$ be a finite set of positive integers. We define finite sets $S_1, S_2, \cdots$ of positive integers as follows: the integer $a$ in $S_{n+1}$ if and only if exactly one of $a-1$ or $a$ is in $S_n$. Show that there exist infinitely many integers $N$ for which $S_N = S_0 \cup \{ N + a: a \in S_0 \}$.

2023 Bulgaria EGMO TST, 2
Tags: function , greatest common divisor , number theory
Determine all integers $k$ for which there exists a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}$ such that $f(2023) = 2024$ and $f(ab) = f(a) + f(b) + kf(\gcd(a,b))$ for all positive integers $a$ and $b$.

2010 Today's Calculation Of Integral, 596
Tags: trigonometry , calculus computations , calculus , integration
Find the minimum value of $\int_0^{\frac{\pi}{2}} |a\sin 2x-\cos ^ 2 x|dx\ (a>0).$ 2009 Shimane University entrance exam/Medicine

2003 Abels Math Contest (Norwegian MO), 1a
Tags: algebra , system of equations
Let $x$ and $y$ are real numbers such that $$\begin{cases} x + y = 2 \\ x^3 + y^3 = 3\end{cases} $$ What is $x^2+y^2$?

2011 Postal Coaching, 5
Tags: number theory , modular arithmetic
Let $(a_n )_{n\ge 1}$ be a sequence of integers that satisfies \[a_n = a_{n-1} -\text{min}(a_{n-2} , a_{n-3} )\] for all $n \ge 4$. Prove that for every positive integer $k$, there is an $n$ such that $a_n$ is divisible by $3^k$ .

2011 Mathcenter Contest + Longlist, 8 sl12
Tags: algebra , inequalities
Let $a,b,c\in\mathbb{R^+}$. Prove that $$\frac{a^{11}}{b^5c^5}+\frac{b^{11}}{ c^5a^5}+\frac{c^{11}}{a^5b^5}\ge a+b+c$$ [i](Real Matrik)[/i]

2005 Hungary-Israel Binational, 2
Tags: algebra , function
Let $F_{n}$ be the $n-$ th Fibonacci number (where $F_{1}= F_{2}= 1$). Consider the functions $f_{n}(x)=\parallel . . . \parallel |x|-F_{n}|-F_{n-1}|-...-F_{2}|-F_{1}|, g_{n}(x)=| . . . \parallel x-1|-1|-...-1|$ ($F_{1}+...+F_{n}$ one’s). Show that $f_{n}(x) = g_{n}(x)$ for every real number $x.$

2015 Bundeswettbewerb Mathematik Germany, 3
Tags: coloring , combinatorics , counting
Each of the positive integers $1,2,\dots,n$ is colored in one of the colors red, blue or yellow regarding the following rules: (1) A Number $x$ and the smallest number larger than $x$ colored in the same color as $x$ always have different parities. (2) If all colors are used in a coloring, then there is exactly one color, such that the smallest number in that color is even. Find the number of possible colorings.

2020 LMT Fall, B4
Tags: number theory
Find the greatest prime factor of $20!+20!+21!$.

2015 Puerto Rico Team Selection Test, 3
Tags: number theory , divisible , trinomial , quadratic
Let $f$ be a quadratic polynomial with integer coefficients. Also $f (k)$ is divisible by $5$ for every integer $k$. Show that coefficients of the polynomial $f$ are all divisible by $5$.

1977 AMC 12/AHSME, 13
Tags: ratio , geometric sequence
If $a_1,a_2,a_3,\dots$ is a sequence of positive numbers such that $a_{n+2}=a_na_{n+1}$ for all positive integers $n$, then the sequence $a_1,a_2,a_3,\dots$ is a geometric progression $\textbf{(A) }\text{for all positive values of }a_1\text{ and }a_2\qquad$ $\textbf{(B) }\text{if and only if }a_1=a_2\qquad$ $\textbf{(C) }\text{if and only if }a_1=1\qquad$ $\textbf{(D) }\text{if and only if }a_2=1\qquad $ $\textbf{(E) }\text{if and only if }a_1=a_2=1$

2005 Oral Moscow Geometry Olympiad, 2
Tags: geometry , collinear , diameter
On a circle with diameter $AB$, lie points $C$ and $D$. $XY$ is the diameter passing through the midpoint $K$ of the chord $CD$. Point $M$ is the projection of point $X$ onto line $AC$, and point $N$ is the projection of point $Y$ on line $BD$. Prove that points $M, N$ and $K$ are collinear. (A. Zaslavsky)

2023 USEMO, 6
Tags: algebra
Let $n \ge 2$ be a fixed integer. [list=a] [*]Determine the largest positive integer $m$ (in terms of $n$) such that there exist complex numbers $r_1$, $\dots$, $r_n$, not all zero, for which \[ \prod_{k=1}^n (r_k+1) = \prod_{k=1}^n (r_k^2+1) = \dots = \prod_{k=1}^n (r_k^m+1) = 1. \] [*]For this value of $m$, find all possible values of \[ \prod\limits_{k=1}^n (r_k^{m+1}+1). \] [/list] [i]Kaixin Wang[/i]

2022 Cyprus JBMO TST, 1
Tags: perfect square , number theory
Find all integer values of $x$ for which the value of the expression \[x^2+6x+33\] is a perfect square.

2023 Auckland Mathematical Olympiad, 1
Tags: algebra , number theory
A single section at a stadium can hold either $7$ adults or $11$ children. When $N$ sections are completely lled, an equal number of adults and children will be seated in them. What is the least possible value of $N$?

PEN F Problems, 8
Tags: function , polynomial , induction , analytic geometry , rational number , algebra
Find all polynomials $W$ with real coefficients possessing the following property: if $x+y$ is a rational number, then $W(x)+W(y)$ is rational.

1999 IMO Shortlist, 2
Tags: combinatorics , counting , rectangle , geometry
If a $5 \times n$ rectangle can be tiled using $n$ pieces like those shown in the diagram, prove that $n$ is even. Show that there are more than $2 \cdot 3^{k-1}$ ways to file a fixed $5 \times 2k$ rectangle $(k \geq 3)$ with $2k$ pieces. (symmetric constructions are supposed to be different.)