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

1998 Estonia National Olympiad, 2

Let $C$ and $D$ be two distinct points on a semicircle of diameter $AB$. Let $E$ be the intersection of $AC$ and $BD$, $F$ be the intersection of $AD$ and $BC$ and $X, Y$, and $Z$ are the midpoints of $AB, CD$, and $EF$, respectively. Prove that the points $X, Y,$ and $Z$ are collinear.

1959 AMC 12/AHSME, 45

Tags: logarithm , algebra
If $\left(\log_3 x\right)\left(\log_x 2x\right)\left( \log_{2x} y\right)=\log_{x}x^2$, then $y$ equals: $ \textbf{(A)}\ \frac92\qquad\textbf{(B)}\ 9\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 81 $

2013 India IMO Training Camp, 1

Let $n \ge 2$ be an integer. There are $n$ beads numbered $1, 2, \ldots, n$. Two necklaces made out of some of these beads are considered the same if we can get one by rotating the other (with no flipping allowed). For example, with $n \ge 5$, the necklace with four beads $1, 5, 3, 2$ in the clockwise order is same as the one with $5, 3, 2, 1$ in the clockwise order, but is different from the one with $1, 2, 3, 5$ in the clockwise order. We denote by $D_0(n)$ (respectively $D_1(n)$) the number of ways in which we can use all the beads to make an even number (resp. an odd number) of necklaces each of length at least $3$. Prove that $n - 1$ divides $D_1(n) - D_0(n)$.

2015 South East Mathematical Olympiad, 5

Tags: algebra
Suppose that $a,b$ are real numbers, function $f(x) = ax+b$ satisfies $\mid f(x) \mid \leq 1$ for any $x \in [0,1]$. Find the range of values of $S= (a+1)(b+1).$

2007 Germany Team Selection Test, 1

We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by \[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right), \] where $\lfloor x\rfloor$ denotes the integer part of $x$. [b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often. [b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often. [i]Proposed by Johan Meyer, South Africa[/i]

2008 Flanders Math Olympiad, 4

Tags: circles , area , square , geometry
A square with sides $1$ and four circles of radius $1$ considered each having a vertex of have the square as the center. Find area of the shaded part (see figure). [img]https://cdn.artofproblemsolving.com/attachments/b/6/6e28d94094d69bac13c2702853ac2c906a80a1.png[/img]

2011 Peru MO (ONEM), 1

We say that a positive integer is [i]irregular [/i] if said number is not a multiple of none of its digits. For example, $203$ is irregular because $ 203$ is not a multiple of $2$, it is not multiple of $0$ and is not a multiple of $3$. Consider a set consisting of $n$ consecutive positive integers. If all the numbers in that set are irregular, determine the largest possible value of $n$.

2019 Romania National Olympiad, 1

a) Prove that for $x,y \ge 1$, holds $$x+y - \frac{1}{x}- \frac{1}{y} \ge 2\sqrt{xy} -\frac{2}{\sqrt{xy}}$$ b) Prove that for $a,b,c,d \ge 1$ with $abcd=16$ , holds $$a+b+c+d-\frac{1}{a}-\frac{1}{b}-\frac{1}{c}-\frac{1}{d}\ge 6$$

1980 Kurschak Competition, 2

Let $n > 1$ be an odd integer. Prove that a necessary and sufficient condition for the existence of positive integers $x$ and $y$ satisfying $$\frac{4}{n}=\frac{1}{x}+\frac{1}{y}$$ is that $n$ has a prime divisor of the form $4k - 1$.

2022 Macedonian Mathematical Olympiad, Problem 3

The sequence $(a_n)_{n \ge 1}^\infty$ is given by: $a_1=2$ and $a_{n+1}=a_n^2+a_n$ for all $n \ge 1$. For an integer $m \ge 2$, $L(m)$ denotes the greatest prime divisor of $m$. Prove that there exists some $k$, for which $L(a_k) > 1000^{1000}$. [i]Proposed by Nikola Velov[/i]

2022 CMIMC, 2.7 1.3

For a family gathering, $8$ people order one dish each. The family sits around a circular table. Find the number of ways to place the dishes so that each person’s dish is either to the left, right, or directly in front of them. [i]Proposed by Nicole Sim[/i]

2019 Math Prize for Girls Problems, 13

Tags:
Each side of a unit square (side length 1) is also one side of an equilateral triangle that lies in the square. Compute the area of the intersection of (the interiors of) all four triangles.

2013 ELMO Problems, 4

Triangle $ABC$ is inscribed in circle $\omega$. A circle with chord $BC$ intersects segments $AB$ and $AC$ again at $S$ and $R$, respectively. Segments $BR$ and $CS$ meet at $L$, and rays $LR$ and $LS$ intersect $\omega$ at $D$ and $E$, respectively. The internal angle bisector of $\angle BDE$ meets line $ER$ at $K$. Prove that if $BE = BR$, then $\angle ELK = \tfrac{1}{2} \angle BCD$. [i]Proposed by Evan Chen[/i]

2020 AMC 12/AHSME, 12

Tags: geometry
Let $\overline{AB}$ be a diameter in a circle of radius $5\sqrt2.$ Let $\overline{CD}$ be a chord in the circle that intersects $\overline{AB}$ at a point $E$ such that $BE=2\sqrt5$ and $\angle AEC = 45^{\circ}.$ What is $CE^2+DE^2?$ $\textbf{(A)}\ 96 \qquad\textbf{(B)}\ 98 \qquad\textbf{(C)}\ 44\sqrt5 \qquad\textbf{(D)}\ 70\sqrt2 \qquad\textbf{(E)}\ 100$

2017 Macedonia JBMO TST, 5

Find all the positive integers $n$ so that $n$ has the same number of digits as its number of different prime factors and the sum of these different prime factors is equal to the sum of exponents of all these primes in factorization of $n$.

2002 Estonia National Olympiad, 5

Juku built a robot that moves along the border of a regular octagon, passing each side in exactly $1$ minute. The robot starts in some vertex $A$ and upon reaching each vertex can either continue in the same direction, or turn around and continue in the opposite direction. In how many different ways can the robot move so that after $n$ minutes it will be in the vertex $B$ opposite to $A$?

2024 Thailand Mathematical Olympiad, 9

Prove that for all positive integers $n$, there exists a sequence of positive integers $a_1,a_2,\dots,a_n$ and $d_1,d_2,\dots,d_n$ satisfying all of the following three conditions. [list] [*] $\binom{2a_i}{a_i}$ is divisible by $d_i$ for all $i=1,2,\dots,n$ [*] $d_{i+1}=d_i+1$ for all $i=1,2,\dots, n-1$ [*] $d_i\neq m^k$ for all $i=1,2,\dots, n$ and positive integers $m$ and $k$ such that $k\geq 2$ [/list]

2015 India IMO Training Camp, 2

Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$. [i]Proposed by Belgium[/i]

2022 Saudi Arabia JBMO TST, 1

Find all pairs of positive prime numbers $(p, q)$ such that $$p^5 + p^3 + 2 = q^2 - q.$$

2004 Federal Competition For Advanced Students, P2, 2

Show that every set $ \{p_1,p_2,\dots,p_k\}$ of prime numbers fulfils the following: The sum of all unit fractions (that are fractions of the type $ \frac{1}{n}$), whose denominators are exactly the $ k$ given prime factors (but in arbitrary powers with exponents unequal zero), is an unit fraction again. How big is this sum if $ \frac{1}{2004}$ is among this summands? Show that for every set $ \{p_1,p_2,\dots,p_k\}$ containing $ k$ prime numbers ($ k>2$) is the sum smaller than $ \frac{1}{N}$ with $ N=2\cdot 3^{k-2}(k-2)!$

2021 Korea Junior Math Olympiad, 5

Determine all functions $f \colon \mathbb{R} \to \mathbb{R}$ satisfying $$f(f(x+y)-f(x-y))=y^2f(x)$$ for all $x, y \in \mathbb{R}$.

2017 ASDAN Math Tournament, 18

Tags:
Find the sum of all integers $0\le a \le124$ so that $a^3-2$ is a multiple of $125$.

2005 Oral Moscow Geometry Olympiad, 4

Given a hexagon $ABCDEF$, in which $AB = BC, CD = DE, EF = FA$, and angles $A$ and $C$ are right. Prove that lines $FD$ and $BE$ are perpendicular. (B. Kukushkin)

2004 Austrian-Polish Competition, 10

For each polynomial $Q(x)$ let $M(Q)$ be the set of non-negative integers $x$ with $0 < Q(x) < 2004.$ We consider polynomials $P_n(x)$ of the form \[P_n(x) = x^n + a_1 \cdot x^{n-1} + \ldots + a_{n-1} \cdot x + 1\] with coefficients $a_i \in \{ \pm1\}$ for $i = 1, 2, \ldots, n-1.$ For each $n = 3^k, k > 0$ determine: a.) $m_n$ which represents the maximum of elements in $M(P_n)$ for all such polynomials $P_n(x)$ b.) all polynomials $P_n(x)$ for which $|M(P_n)| = m_n.$

2012 All-Russian Olympiad, 2

Does there exist natural numbers $a,b,c$ all greater than $10^{10}$ such that their product is divisible by each of these numbers increased by $2012$?