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

2019 Balkan MO Shortlist, G8

Given an acute triangle $ABC$, $(c)$ its circumcircle with center $O$ and $H$ the orthocenter of the triangle $ABC$. The line $AO$ intersects $(c)$ at the point $D$. Let $D_1, D_2$ and $H_2, H_3$ be the symmetrical points of the points $D$ and $H$ with respect to the lines $AB, AC$ respectively. Let $(c_1)$ be the circumcircle of the triangle $AD_1D_2$. Suppose that the line $AH$ intersects again $(c_1)$ at the point $U$, the line $H_2H_3$ intersects the segment $D_1D_2$ at the point $K_1$ and the line $DH_3$ intersects the segment $UD_2$ at the point $L_1$. Prove that one of the intersection points of the circumcircles of the triangles $D_1K_1H_2$ and $UDL_1$ lies on the line $K_1L_1$.

1938 Moscow Mathematical Olympiad, 040

What is the largest number of parts into which $n$ planes can divide space? We assume that the set of planes is non-degenerate in the sense that any three planes intersect in one point and no four planes have a common point (and for n=2 it is necessary to require that the planes are not parallel).

2012 Princeton University Math Competition, Team Round

[hide=instructions]Time limit: 20 minutes. Fill in the crossword above with answers to the problems below. Notice that there are three directions instead of two. You are probably used to "down" and "across," but this crossword has "1," $e^{4\pi i/3}$, and $e^{5\pi i/3}$. You can think of these labels as complex numbers pointing in the direction to fill in the spaces. In other words "1" means "across", $e^{4\pi i/3}$ means "down and to the left," and $e^{5\pi i/3}$ means "down and to the right." To fill in the answer to, for example, $12$ across, start at the hexagon labeled $12$, and write the digits, proceeding to the right along the gray line. (Note: $12$ across has space for exactly $5$ digits.) Each hexagon is worth one point, and must be filled by something from the set $\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$. Note that $\pi$ is not in the set, and neither is $i$, nor $\sqrt2$, nor $\heartsuit$,etc. None of the answers will begin with a $0$. "Concatenate $a$ and $b$" means to write the digits of $a$, followed by the digits of $b$. For example, concatenating $10$ and $3$ gives $103$. (It's not the same as concatenating $3$ and $10$.) Calculators are allowed! THIS SHEET IS PROVIDED FOR YOUR REFERENCE ONLY. DO NOT TURN IN THIS SHEET. TURN IN THE OFFICIAL ANSWER SHEET PROVIDED TO THE TEAM. OTHERWISE YOU WILL GET A SCORE OF ZERO! ZERO! ZERO! AND WHILE SOMETIMES "!" MEANS FACTORIAL, IN THIS CASE IT DOES NOT. Good luck, and have fun![/hide] [img]https://cdn.artofproblemsolving.com/attachments/b/f/f7445136e40bf4889a328da640f0935b2b8b82.png[/img] [u][b][i]Across[/i][/b][/u] (1) [b]A 3.[/b] (3 digits) Suppose you draw $5$ vertices of a convex pentagon (but not the sides!). Let $N$ be the number of ways you can draw at least $0$ straight line segments between the vertices so that no two line segments intersect in the interior of the pentagon. What is $N - 64$? (Note what the question is asking for! You have been warned!) [b]A 5.[/b] (3 digits) Among integers $\{1, 2,..., 10^{2012}\}$, let $n$ be the number of numbers for which the sum of the digits is divisible by $5$. What are the first three digits (from the left) of $n$? [b]A 6.[/b] (3 digits) Bob is punished by his math teacher and has to write all perfect squares, one after another. His teacher's blackboard has space for exactly $2012$ digits. He can stop when he cannot fit the next perfect square on the board. (At the end, there might be some space left on the board - he does not write only part of the next perfect square.) If $n^2$ is the largest perfect square he writes, what is $n$? [b]A 8. [/b](3 digits) How many positive integers $n$ are there such that $n \le 2012$, and the greatest common divisor of $n$ and $2012$ is a prime number? [b]A 9.[/b] (4 digits) I have a random number machine generator that is very good at generating integers between $1$ and $256$, inclusive, with equal probability. However, right now, I want to produce a random number between $1$ and $n$, inclusive, so I do the following: $\bullet$ I use my machine to generate a number between $1$ and $256$. Call this $a$. $\bullet$ I take a and divide it by $n$ to get remainder $r$. If $r \ne 0$, then I record $r$ as the randomly generated number. If $r = 0$, then I record $n$ instead. Note that this process does not necessarily produce all numbers with equal probability, but that is okay. I apply this process twice to generate two numbers randomly between $1$ and $10$. Let $p$ be the probability that the two numbers are equal. What is $p \cdot 2^{16}$? [b]A 12.[/b] (5 digits) You and your friend play the following dangerous game. You two start off at some point $(x, y)$ on the plane, where $x$ and $y$ are nonnegative integers. When it is player $A$'s turn, A tells his opponent $B$ to move to another point on the plane. Then $A$ waits for a while. If $B$ is not eaten by a tiger, then $A$ moves to that point as well. From a point $(x, y)$ there are three places $A$ can tell $B$ to walk to: leftwards to $(x - 1, y)$, downwards to $(x, y-1)$, and simultaneously downwards and leftwards to $(x-1, y-1)$. However, you cannot move to a point with a negative coordinate. Now, what was this about being eaten by a tiger? There is a tiger at the origin, which will eat the first person that goes there! Needless to say, you lose if you are eaten. Consider all possible starting points $(x, y)$ with $0 \le x \le 346$ and $0 \le y \le 346$, and $x$ and $y$ are not both zero. Also suppose that you two play strategically, and you go first (i.e., by telling your friend where to go). For how many of the starting points do you win? [b][u][i]Down and to the left [/i][/u][/b] $e^{4\pi i/3}$ [b]DL 2.[/b] (2 digits) ABCDE is a pentagon with $AB = BC = CD = \sqrt2$, $\angle ABC = \angle BCD = 120$ degrees, and $\angle BAE = \angle CDE = 105$ degrees. Find the area of triangle $\vartriangle BDE$. Your answer in its simplest form can be written as $\frac{a+\sqrt{b}}{c}$ , where where $a, b, c$ are integers and $b$ is square-free. Find $abc$. [b]DL 3.[/b] (3 digits) Suppose $x$ and $y$ are integers which satisfy $$\frac{4x^2}{y^2} + \frac{25y^2}{x^2} = \frac{10055}{x^2} +\frac{4022}{y^2} +\frac{2012}{x^2y^2}- 20. $$ What is the maximum possible value of $xy -1$? [b]DL 5.[/b] (3 digits) Find the area of the set of all points in the plane such that there exists a square centered around the point and having the following properties: $\bullet$ The square has side length $7\sqrt2$. $\bullet$ The boundary of the square intersects the graph of $xy = 0$ at at least $3$ points. [b]DL 8.[/b] (3 digits) Princeton Tiger has a mom that likes yelling out math problems. One day, the following exchange between Princeton and his mom occurred: $\bullet$ Mom: Tell me the number of zeros at the end of $2012!$ $\bullet$ PT: Huh? $2012$ ends in $2$, so there aren't any zeros. $\bullet$ Mom: No, the exclamation point at the end was not to signify me yelling. I was not asking about $2012$, I was asking about $2012!$. What is the correct answer? [b]DL 9.[/b] (4 digits) Define the following: $\bullet$ $A = \sum^{\infty}_{n=1}\frac{1}{n^6}$ $\bullet$ $B = \sum^{\infty}_{n=1}\frac{1}{n^6+1}$ $\bullet$ $C = \sum^{\infty}_{n=1}\frac{1}{(n+1)^6}$ $\bullet$ $D = \sum^{\infty}_{n=1}\frac{1}{(2n-1)^6}$ $\bullet$ $E = \sum^{\infty}_{n=1}\frac{1}{(2n+1)^6}$ Consider the ratios $\frac{B}{A}, \frac{C}{A}, \frac{D}{A} , \frac{E}{A}$. Exactly one of the four is a rational number. Let that number be $r/s$, where $r$ and $s$ are nonnegative integers and $gcd \,(r, s) = 1$. Concatenate $r, s$. (It might be helpful to know that $A = \frac{\pi^6}{945}$ .) [b]DL 10.[/b] (3 digits) You have a sheet of paper, which you lay on the xy plane so that its vertices are at $(-1, 0)$, $(1, 0)$, $(1, 100)$, $(-1, 100)$. You remove a section of the bottom of the paper by cutting along the function $y = f(x)$, where $f$ satisfies $f(1) = f(-1) = 0$. (In other words, you keep the bottom two vertices.) You do this again with another sheet of paper. Then you roll both of them into identical cylinders, and you realize that you can attach them to form an $L$-shaped elbow tube. We can write $f\left( \frac13 \right)+f\left( \frac16 \right) = \frac{a+\sqrt{b}}{\pi c}$ , where $a, b, c$ are integers and $b$ is square-free. $Find a+b+c$. [b]DL 11.[/b] (3 digits) Let $$\Xi (x) = 2012(x - 2)^2 + 278(x - 2)\sqrt{2012 + e^{x^2-4x+4}} + 1392 + (x^2 - 4x + 4)e^{x^2-4x+4}$$ find the area of the region in the $xy$-plane satisfying: $$\{x \ge 0 \,\,\, and x \le 4 \,\,\, and \,\,\, y \ge 0 \,\,\, and \,\,\, y \le \sqrt{\Xi(x)}\}$$ [b]DL 13.[/b] (3 digits) Three cones have bases on the same plane, externally tangent to each other. The cones all face the same direction. Two of the cones have radii of $2$, and the other cone has a radius of $3$. The two cones with radii $2$ have height $4$, and the other cone has height $6$. Let $V$ be the volume of the tetrahedron with three of its vertices as the three vertices of the cones and the fourth vertex as the center of the base of the cone with height $6$. Find $V^2$. [b][u][i]Down and to the right[/i][/u][/b] $e^{5\pi i/3}$ [b]DR 1.[/b] (2 digits) For some reason, people in math problems like to paint houses. Alice can paint a house in one hour. Bob can paint a house in six hours. If they work together, it takes them seven hours to paint a house. You might be thinking "What? That's not right!" but I did not make a mistake. When Alice and Bob work together, they get distracted very easily and simultaneously send text messages to each other. When they are texting, they are not getting any work done. When they are not texting, they are painting at their normal speeds (as if they were working alone). Carl, the owner of the house decides to check up on their work. He randomly picks a time during the seven hours. The probability that they are texting during that time can be written as $r/s$, where r and s are integers and $gcd \,(r, s) = 1$. What is $r + s$? [b]DR 4.[/b] (3 digits) Let $a_1 = 2 +\sqrt2$ and $b_1 =\sqrt2$, and for $n \ge 1$, $a_{n+1} = |a_n - b_n|$ and $b_{n+1} = a_n + b_n$. The minimum value of $\frac{a^2_n+a_nb_n-6b^2_n}{6b^2_n-a^2_n}$ can be written in the form $a\sqrt{b} - c$, where $a, b, c$ are integers and $b$ is square-free. Concatenate $c, b, a$ (in that order!). [b]DR 7.[/b] (3 digits) How many solutions are there to $a^{503} + b^{1006} = c^{2012}$, where $a, b, c$ are integers and $|a|$,$|b|$, $|c|$ are all less than $2012$? PS. You should use hide for answers.

2018 AMC 8, 22

Tags: geometry
Point $E$ is the midpoint of side $\overline{CD}$ in square $ABCD,$ and $\overline{BE}$ meets diagonal $\overline{AC}$ at $F.$ The area of quadrilateral $AFED$ is $45.$ What is the area of $ABCD?$ [asy] size(5cm); draw((0,0)--(6,0)--(6,6)--(0,6)--cycle); draw((0,6)--(6,0)); draw((3,0)--(6,6)); label("$A$",(0,6),NW); label("$B$",(6,6),NE); label("$C$",(6,0),SE); label("$D$",(0,0),SW); label("$E$",(3,0),S); label("$F$",(4,2),E); [/asy] $\textbf{(A) } 100 \qquad \textbf{(B) } 108 \qquad \textbf{(C) } 120 \qquad \textbf{(D) } 135 \qquad \textbf{(E) } 144$

1988 National High School Mathematics League, 1

Tags:
Define sequence $(a_n):a_1=1,a_2=2,a_{n+2}=\begin{cases} 5a_{n+1}-3a_n,\text{if }a_n\cdot a_{n+1}\text{ is even}\\ a_{n+1}-a_n,\text{if }a_n\cdot a_{n+1}\text{ is odd} \end{cases}$ Prove that for all $n\in\mathbb{Z}_+$, $a_n\neq0$.

1972 USAMO, 4

Let $ R$ denote a non-negative rational number. Determine a fixed set of integers $ a,b,c,d,e,f$, such that for [i]every[/i] choice of $ R$, \[ \left| \frac{aR^2\plus{}bR\plus{}c}{dR^2\plus{}eR\plus{}f}\minus{}\sqrt[3]{2}\right| < \left|R\minus{}\sqrt[3]{2}\right|.\]

2010 Spain Mathematical Olympiad, 1

Let $a,b,c$ be three positive real numbers. Show that \[ \frac {a+b+3c}{3a+3b+2c}+\frac {a+3b+c}{3a+2b+3c}+\frac {3a+b+c}{2a+3b+3c} \ge \frac {15}{8}\]

2015 HMNT, 1-9

Since guts has 36 questions, they will be combined into posts. 1.[b][5][/b] Farmer Yang has a $2015$ × $2015$ square grid of corn plants. One day, the plant in the very center of the grid becomes diseased. Every day, every plant adjacent to a diseased plant becomes diseased. After how many days will all of Yang's corn plants be diseased? 2. [b][5][/b] The three sides of a right triangle form a geometric sequence. Determine the ratio of the length of the hypotenuse to the length of the shorter leg. 3. [b][5][/b] A parallelogram has $2$ sides of length $20$ and $15$. Given that its area is a positive integer, find the minimum possible area of the parallelogram. 4. [b][6][/b] Eric is taking a biology class. His problem sets are worth $100$ points in total, his three midterms are worth $100$ points each, and his final is worth $300$ points. If he gets a perfect score on his problem sets and scores $60\%$,$70\%$, and $80\%$ on his midterms respectively, what is the minimum possible percentage he can get on his final to ensure a passing grade? (Eric passes if and only if his overall percentage is at least $70\%$). 5. [b][6][/b] James writes down three integers. Alex picks some two of those integers, takes the average of them, and adds the result to the third integer. If the possible final results Alex could get are $42$, $13$, and $37$, what are the three integers James originally chose? 6. [b][6][/b] Let $AB$ be a segment of length $2$ with midpoint $M$. Consider the circle with center $O$ and radius $r$ that is externally tangent to the circles with diameters $AM$ and $BM$ and internally tangent to the circle with diameter $AB$. Determine the value of $r$. 7. [b][7][/b] Let n be the smallest positive integer with exactly $2015$ positive factors. What is the sum of the (not necessarily distinct) prime factors of n? For example, the sum of the prime factors of $72$ is $2 + 2 + 2 + 3 + 3 = 14$. 8. [b][7][/b] For how many pairs of nonzero integers $(c, d)$ with $-2015 \le c,d \le 2015$ do the equations $cx = d$ and $dx = c$ both have an integer solution? 9. [b][7][/b] Find the smallest positive integer n such that there exists a complex number z, with positive real and imaginary part, satisfying $z^n = (\overline{z})^n$.

1996 India Regional Mathematical Olympiad, 4

Tags: geometry
Suppose $N$ is an $n$ digit positive integer such that (a) all its digits are distinct; (b) the sum of any three consecutive digits is divisible by $5$. Prove that $n \leq 6$. Further, show that starting with any digit, one can find a six digit number with these properties.

2011 ISI B.Stat Entrance Exam, 4

Let $f$ be a twice differentiable function on the open interval $(-1,1)$ such that $f(0)=1$. Suppose $f$ also satisfies $f(x) \ge 0, f'(x) \le 0$ and $f''(x) \le f(x)$, for all $x\ge 0$. Show that $f'(0) \ge -\sqrt2$.

2019 IMO Shortlist, A7

Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying \[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\] for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set \[X_v=\{x\in\mathbb Z:f(x)=v\}\] is finite and nonempty. (a) Prove that there exists such a function $f$ for which there is an $f$-rare integer. (b) Prove that no such function $f$ can have more than one $f$-rare integer. [i]Netherlands[/i]

2003 Czech And Slovak Olympiad III A, 1

Solve the following system in the set of real numbers: $x^2 -xy+y^2 = 7$, $x^2y+xy^2 = -2$.

2016 Junior Balkan Team Selection Tests - Romania, 4

In each 1x1 square of a nxn board we write $n^2$ numbers with sum S.A move is choosing a 2x2 square and adding 1 to three numbers(from three different 1x1 squares).We say that a number n is good if we can make all the numbers on the board equal by applying a successive number of moves and it not depends of S. a)Show that 6 is not good b)Show that 4 and 1024 are good

2019 Korea National Olympiad, 6

In acute triangle $ABC$, $AB>AC$. Let $I$ the incenter, $\Omega$ the circumcircle of triangle $ABC$, and $D$ the foot of perpendicular from $A$ to $BC$. $AI$ intersects $\Omega$ at point $M(\neq A)$, and the line which passes $M$ and perpendicular to $AM$ intersects $AD$ at point $E$. Now let $F$ the foot of perpendicular from $I$ to $AD$. Prove that $ID\cdot AM=IE\cdot AF$.

1985 Czech And Slovak Olympiad IIIA, 1

A regular $1985$-gon is given in the plane. Let's pass a straight line through each side of it. Determine the number of parts into which these lines divide the plane.

2009 Peru IMO TST, 2

300 bureaucrats are split into three comissions of 100 people. Each two bureaucrats are either familiar to each other or non familiar to each other. Prove that there exists two bureaucrats from two distinct commissions such that the third commission contains either 17 bureaucrats familiar to both of them, or 17 bureaucrats familiar to none of them. _________________________________________ This problem is taken from Russian Olympiad 2007-2008 district round 9.8 $ Tipe$

2014 Online Math Open Problems, 1

Tags:
In English class, you have discovered a mysterious phenomenon -- if you spend $n$ hours on an essay, your score on the essay will be $100\left( 1-4^{-n} \right)$ points if $2n$ is an integer, and $0$ otherwise. For example, if you spend $30$ minutes on an essay you will get a score of $50$, but if you spend $35$ minutes on the essay you somehow do not earn any points. It is 4AM, your English class starts at 8:05AM the same day, and you have four essays due at the start of class. If you can only work on one essay at a time, what is the maximum possible average of your essay scores? [i]Proposed by Evan Chen[/i]

2024 Korea Junior Math Olympiad, 1

Find the number of distinct positive integer pairs $(x, y, z)$ that $$\frac{1}{x+1}+\frac{1}{y+2}+\frac{1}{z+3}=\frac{11}{12}$$

2001 Bundeswettbewerb Mathematik, 1

10 vertices of a regular 100-gon are coloured red and ten other (distinct) vertices are coloured blue. Prove that there is at least one connection edge (segment) of two red which is as long as the connection edge of two blue points. [hide="Hint"]Possible approaches are pigeon hole principle, proof by contradiction, consider turns (bijective congruent mappings) which maps red in blue points. [/hide]

1981 Bulgaria National Olympiad, Problem 3

A quadrilateral pyramid is cut by a plane parallel to the base. Suppose that a sphere $S$ is circumscribed and a sphere $\Sigma$ inscribed in the obtained solid, and moreover that the line through the centers of these two spheres is perpendicular to the base of the pyramid. Show that the pyramid is regular.

2018 ELMO Problems, 2

Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]

2012 USA Team Selection Test, 2

In cyclic quadrilateral $ABCD$, diagonals $AC$ and $BD$ intersect at $P$. Let $E$ and $F$ be the respective feet of the perpendiculars from $P$ to lines $AB$ and $CD$. Segments $BF$ and $CE$ meet at $Q$. Prove that lines $PQ$ and $EF$ are perpendicular to each other.

Brazil L2 Finals (OBM) - geometry, 2010.6

The three sides and the area of a triangle are integers. What is the smallest value of the area of this triangle?

2019 China Western Mathematical Olympiad, 2

Let $O,H$ be the circumcenter and orthocenter of acute triangle $ABC$ with $AB\neq AC$, respectively. Let $M$ be the midpoint of $BC$ and $K$ be the intersection of $AM$ and the circumcircle of $\triangle BHC$, such that $M$ lies between $A$ and $K$. Let $N$ be the intersection of $HK$ and $BC$. Show that if $\angle BAM=\angle CAN$, then $AN\perp OH$.

2021 CMIMC, 3

There is a tiger (which is treated as a point) in the plane that is trying to escape. It starts at the origin at time $t = 0$, and moves continuously at some speed $k$. At every positive integer time $t$, you can place one closed unit disk anywhere in the plane, so long as the disk does not intersect the tiger's current position. The tiger is not allowed to move into any previously placed disks (i.e. the disks block the tiger from moving). Note that when you place the disks, you can "see" the tiger (i.e. know where the tiger currently is). Your goal is to prevent the tiger from escaping to infinity. In other words, you must show there is some radius $R(k)$ such that, using your algorithm, it is impossible for a tiger with speed $k$ to reach a distance larger than $R(k)$ from the origin (where it started). Find an algorithm for placing disks such that there exists some finite real $R(k)$ such that the tiger will never be a distance more than $R(k)$ away from the origin. An algorithm that can trap a tiger of speed $k$ will be awarded: 1 pt for $k<0.05$ 10 pts for $k=0.05$ 20 pts for $k=0.2$ 30 pts for $k=0.3$ 50 pts for $k=1$ 70 pts for $k=2$ 80 pts for $k=2.3$ 85 pts for $k=2.6$ 90 pts for $k=2.9$ 100 pts for $k=3.9$