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

Positive integer $n$ cannot be divided by $2$ and $3$, there are no nonnegative integers $a$ and $b$ such that $|2^a-3^b|=n$. Find the minimum value of $n$.
What is $2021+20+21+2+0+2+1$? [i]Proposed by Nathan Xiong[/i]
$AB$ is a chord of length $6$ in a circle of radius $5$ and centre $O$. A square is inscribed in the sector $OAB$ with two vertices on the circumference and two sides parallel to $ AB$. Find the area of the square.
Let $a, b, c$ be positive real numbers such that $a + b + c = 1$. Show that $$\frac{1 - a^2}{a + bc} + \frac{1 - b^2}{b + ca} + \frac{1 - c^2}{c + ab} \ge 6$$
Find all triples of real numbers $(a, b, c)$ that satisfy the system of equations $$\begin{cases} b^2 = 4a(\sqrt{c} - 1) \\ c^2 = 4b (\sqrt{a} - 1) \\ a^2 = 4c(\sqrt{b} - 1) \end{cases}$$
Positive integers are written into squares of a infinite chessboard such that a number $n$ is written $n$ times. If the absolute differences of numbers written into any two squares having a common side is not greater than $k$, what is the least possible value of $k$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{None of the preceding} $
If $ 8\cdot2^x \equal{} 5^{y \plus{} 8}$, then when $ y \equal{} \minus{} 8,x \equal{}$ $ \textbf{(A)}\ \minus{} 4 \qquad\textbf{(B)}\ \minus{} 3 \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 8$
In an acute triangle $ABC$, let $D$, $E$, $F$ be the feet of the perpendiculars from the points $A$, $B$, $C$ to the lines $BC$, $CA$, $AB$, respectively, and let $P$, $Q$, $R$ be the feet of the perpendiculars from the points $A$, $B$, $C$ to the lines $EF$, $FD$, $DE$, respectively. Prove that $p\left(ABC\right)p\left(PQR\right) \ge \left(p\left(DEF\right)\right)^{2}$, where $p\left(T\right)$ denotes the perimeter of triangle $T$ . [i]Proposed by Hojoo Lee, Korea[/i]
Prove that for all natural $n$ there exists a polynomial $P(x)$ divisible by $(x-1)^n$ such that its degree is not greater than $2^n$ and each of its coefficients is equal to $1$, $0$ or $-1$. (D. Fomin, Leningrad)
A mass $m$ is resting at equilibrium suspended from a vertical spring of natural length $L$ and spring constant $k$ inside a box as shown: [asy] //The Spring import graph; size(10cm); guide coil(path g, real width=0.1, real margin = 1*width) { real L = arclength(g); real r = width / 2; pair startpoint = arcpoint(g, margin); real[][] isectiontimes = intersections(g, circle(c=startpoint,r=r)); real initialcirclecentertime = (isectiontimes.length == 1 ? isectiontimes[0][0] : isectiontimes[1][0]); pair startdir = dir(startpoint - point(g,initialcirclecentertime)); real startangle = atan2(startdir.y, startdir.x); real startarctime = arclength(subpath(g, 0, initialcirclecentertime)); write(startarctime); pair endpoint = arcpoint(g, L - margin); real finalcirclecentertime = intersections(g, circle(c=endpoint,r=r))[0][0]; pair enddir = dir(endpoint - point(g,finalcirclecentertime)); real endangle = atan2(enddir.y, enddir.x); real endarctime = arclength(subpath(g, 0, finalcirclecentertime)); write(endarctime); real coillength = 2r; real lengthalongcoils = L - 2*margin; int numcoils = ceil(lengthalongcoils / coillength); real anglesubtended = 2pi * numcoils - startangle + endangle; real angleat(real arctime) { return (arctime - startarctime) * (anglesubtended / (endarctime - startarctime)) + startangle; } pair f(real t) { return arcpoint(g,t) + r * expi(angleat(t)); } return subpath(g, 0, arctime(g, margin)) & graph(f, startarctime, endarctime, n=max(length(g), 20*numcoils+2), operator..) & subpath(g, arctime(g, L-margin), length(g)); } draw(coil((0,0.25)--(0,1))); //Outer Box draw((-1,1)--(1,1),linewidth(2)); draw((-1,1)--(-1,-1.2),linewidth(2)); draw((-1,-1.2)--(1,-1.2),linewidth(2)); draw((1,1)--(1,-1.2),linewidth(2)); //Inner Box draw((-0.2,0.25)--(0.2,0.25),linewidth(2)); path arc1=arc((-0.2,0.15),(-0.2,0.25),(-0.3,0.15)); path arc2=arc((0.2,0.15),(0.3,0.15),(0.2,0.25)); draw(arc1,linewidth(2)); draw(arc2,linewidth(2)); draw((-0.3,0.15)--(-0.3,-0.3),linewidth(2)); draw((0.3,0.15)--(0.3,-0.3),linewidth(2)); path arc3=arc((-0.2,-0.3),(-0.3,-0.3),(-0.2,-0.4)); draw(arc3,linewidth(2)); path arc4=arc((0.2,-0.3),(0.2,-0.4),(0.3,-0.3)); draw((-0.2,-0.4)--(0.2,-0.4),linewidth(2)); draw(arc4,linewidth(2)); [/asy] The box begins accelerating upward with acceleration $a$. How much closer does the equilibrium position of the mass move to the bottom of the box? (a) $(a/g)L$ (b) $(g/a)L$ (c) $m(g + a)/k$ (d) $m(g - a)/k$ (e) $ma/k$
Let $ S$ be the set of all real numbers strictly greater than −1. Find all functions $ f: S \to S$ satisfying the two conditions: (a) $ f(x \plus{} f(y) \plus{} xf(y)) \equal{} y \plus{} f(x) \plus{} yf(x)$ for all $ x, y$ in $ S$; (b) $ \frac {f(x)}{x}$ is strictly increasing on each of the two intervals $ \minus{} 1 < x < 0$ and $ 0 < x$.
A polygon is [b]gridded[/b] if the internal angles of the polygon are either $90$ or $270$, it has integer side lengths and its sides don't intersect with each other. Prove that for all $n \ge 8$, it exist a gridded polygon with area $2n$ and perimeter $2n$.
The positive real numbers $a,b,c,$ satisfy: $$\frac{a}{2b+1} + \frac{2b}{3c+1} + \frac{3c}{a+1} = 1$$ $$\frac{1}{a+1} + \frac{1}{2b+1} + \frac{1}{3c+1} = 2$$ What is the value of $\frac{1}{a} + \frac{1}{b} + \frac{1}{c}$
Three friends have a total of $6$ identical pencils, and each one has at least one pencil. In how many ways can this happen? $\textbf{(A)}\ 1\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ 12$
Let $ n, m$ be positive integers of different parity, and $ n > m$. Find all integers $ x$ such that $ \frac {x^{2^n} \minus{} 1}{x^{2^m} \minus{} 1}$ is a perfect square.
Let $f(x)$ be a continuous function such that $f(2x^2-1)=2xf(x)$ for all $x$. Show that $f(x)=0$ for $-1\le x \le 1$.
Find all positive integers $x$ and $y$ such that $x+y^2+z^3 = xyz$, where $z$ is the greatest common divisor of $x$ and $y$
Does there exist a strictly increasing sequence $\{a_n\}_{n=1}^\infty$ of natural numbers with the following property: for $\forall$ $c\in \mathbb{Z}$ the sequence $c+a_1,c+a_2,...,c+a_n...$ has finite number of primes? Explain your answer.
Let $ABC$ be a triangle with circumcentre $O$ and incentre $I$ such that $O$ is different from $I$. Let $AK, BL, CM$ be the altitudes of $ABC$, let $U, V , W$ be the mid-points of $AK, BL, CM$ respectively. Let $D, E, F$ be the points at which the in-circle of $ABC$ respectively touches the sides $BC, CA, AB$. Prove that the lines $UD, VE, WF$ and $OI$ are concurrent.
[u]Round 9[/u] [b]p25.[/b] Define a hilly number to be a number with distinct digits such that when its digits are read from left to right, they strictly increase, then strictly decrease. For example, $483$ and $1230$ are both hilly numbers, but $123$ and $1212$ are not. How many $5$-digit hilly numbers are there? [b]p26.[/b] Triangle ABC has $AB = 4$ and $AC = 6$. Let the intersection of the angle bisector of $\angle BAC$ and $\overline{BC}$ be $D$ and the foot of the perpendicular from C to the angle bisector of $\angle BAC$ be $E$. What is the value of $AD/AE$? [b]p27.[/b] Given that $(7+ 4\sqrt3)^x+ (7-4\sqrt3)^x = 10$, find all possible values of $(7+ 4\sqrt3)^x-(7-4\sqrt3)^x$. [u]Round 10[/u] Note: In this set, the answers for each problem rely on answers to the other problems. [b]p28.[/b] Let X be the answer to question $29$. If $5A + 5B = 5X - 8$ and $A^2 + AB - 2B^2 = 0$, find the sum of all possible values of $A$. [b]p29.[/b] Let $W$ be the answer to question $28$. In isosceles trapezoid $ABCD$ with $\overline{AB} \parallel \overline{CD}$, line segments $ \overline{AC}$ and $ \overline{BD}$ split each other in the ratio $2 : 1$. Given that the length of $BC$ is $W$, what is the greatest possible length of $\overline{AB}$ for which there is only one trapezoid $ABCD$ satisfying the given conditions? [b]p30.[/b] Let $W$ be the answer to question $28$ and $X$ be the answer to question $29$. For what value of $Z$ is $ |Z - X| + |Z - W| - |W + X - Z|$ at a minimum? [u]Round 11[/u] [b]p31.[/b] Peijin wants to draw the horizon of Yellowstone Park, but he forgot what it looked like. He remembers that the horizon was a string of $10$ segments, each one either increasing with slope $1$, remaining flat, or decreasing with slope $1$. Given that the horizon never dipped more than $1$ unit below or rose more than $1$ unit above the starting point and that it returned to the starting elevation, how many possible pictures can Peijin draw? [b]p32.[/b] DNA sequences are long strings of $A, T, C$, and $G$, called base pairs. (e.g. AATGCA is a DNA sequence of 6 base pairs). A DNA sequence is called stunningly nondescript if it contains each of A, T, C, G, in some order, in 4 consecutive base pairs somewhere in the sequence. Find the number of stunningly nondescript DNA sequences of 6 base pairs (the example above is to be included in this count). [b]p33.[/b] Given variables s, t that satisfy $(3 + 2s + 3t)^2 + (7 - 2t)^2 + (5 - 2s - t)^2 = 83$, find the minimum possible value of $(-5 + 2s + 3t) ^2 + (3 - 2t)^2 + (2 - 2s - t)^2$. [u]Round 12[/u] [b]p34.[/b] Let $f(n)$ be the number of powers of 2 with n digits. For how many values of n from $1$ to $2013$ inclusive does $f(n) = 3$? If your answer is N and the actual answer is $C$, then the score you will receive on this problem is $max\{15 - \frac{|N-C|}{26039} , 0\}$, rounded to the nearest integer. [b]p35.[/b] How many total characters are there in the source files for the LMT $2013$ problems? If your answer is $N$ and the actual answer is $C$, then the score you receive on this problem is $max\{15 - \frac{|N - C|}{1337}, 0\}$, rounded to the nearest integer. [b]p36.[/b] Write down two distinct integers between $0$ and $300$, inclusive. Let $S$ be the collection of everyone’s guesses. Let x be the smallest nonnegative difference between one of your guesses and another guess in $S$ (possibly your other guess). Your team will be awarded $min(15, x)$ points. PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134546p28406927]here [/url] and 6-8 [url=https://artofproblemsolving.com/community/c3h3136014p28427163]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find the number of unordered pairs $\{ A,B \}$ of subsets of an n-element set $X$ that satisfies the following: (a) $A \not= B$ (b) $A \cup B = X$
Let $n>2$ be an even integer. In the squares of a board of $n \times n$, pieces must be placed so that in each column the number of chips is even and different from zero, and in each row the number of chips is odd. Determine the fewest number of checkers to place on the board to satisfy this rule. To show a configuration with that number of tokens and explain why with fewer tokens the rule.
The planet Caramelo is a cube with a $1$ km edge. This planet is going to be wrapped with foam anti-gluttons in order to prevent the presence of greedy ships less than $500$ meters from the planet. What the minimum volume of foam that must surround the planet?
There are given points with integer coordinate $(m,n)$ such that $1\leq m,n\leq 4$. Two players, Ana and Ben, are playing a game: First Ana color one of the coordinates with red one, then she pass the turn to Ben who color one of the remaining coordinates with yellow one, then this process they repeate again one after other. The game win the first player who can create a rectangle with same color of vertices and the length of sides are positive integer numbers, otherwise the game is a tie. Does there exist a strategy for any of the player to win the game?