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

A merida path of order $2n$ is a lattice path in the first quadrant of $xy$- plane joining $(0,0)$ to $(2n,0)$ using three kinds of steps $U=(1,1)$, $D= (1,-1)$ and $L= (2,0)$, i.e. $U$ joins $x,y)$ to $(x+1,y+1)$ etc... An ascent in a merida path is a maximal string of consecutive steps of the form $U$. If $S(n,k)$ denotes the number of merdia paths of order $2n$ with exactly $k$ ascents, compute $S(n,1)$ and $S(n,n-1)$.
In an election between $\text{A}$ and $\text{B}$, during the counting of the votes, neither candidate was more than $2$ votes ahead, and the vote ended in a tie, $6$ votes to $6$ votes. Two votes for the same candidate are indistinguishable. In how many orders could the votes have been counted? One possibility is $\text{AABBABBABABA}$.
The volleyball championship with $16$ teams was held in one round (each team played with each exactly one times, there are no draws in volleyball). It turned out that some two teams won the same number of matches. Prove there are the three teams that beat each other in a round robin (i.e. A beat B, B beat C, and C beat A).
The vertices of a triangle are lattice points (they have integer coordinates). There are no other lattice points on the boundary of the triangle, but there is exactly one lattice point inside the triangle. Show that it must be the centroid.
Show that $\vert 12^m -5^n\vert \ge 7$ for all $m, n \in \mathbb{N}$.
For which $n\in\{3900, 3901,\cdots, 3909\}$ can the set $\{1, 2, . . . , n\}$ be partitioned into (disjoint) triples in such a way that in each triple one of the numbers equals the sum of the other two?
In $\triangle ABC, \angle A = 100^\circ, \angle B = 50^\circ, \angle C = 30^\circ, \overline{AH}$ is an altitude, and $\overline{BM}$ is a median. Then $\angle MHC =$ [asy] draw((0,0)--(16,0)--(6,6)--cycle); draw((6,6)--(6,0)--(11,3)--(0,0)); dot((6,6)); dot((0,0)); dot((11,3)); dot((6,0)); dot((16,0)); label("A", (6,6), N); label("B", (0,0), W); label("C", (16,0), E); label("H", (6,0), S); label("M", (11,3), NE);[/asy] $\text{(A)} \ 15^\circ \qquad \text{(B)} \ 22.5^\circ \qquad \text{(C)} \ 30^\circ \qquad \text{(D)} \ 40^\circ \qquad \text{(E)} \ 45^\circ$
Let $F_n$ be the set of all bijective functions $f:\left\{1,2,\ldots,n\right\}\rightarrow\left\{1,2,\ldots,n\right\}$ that satisfy the conditions: 1. $f(k)\leq k+1$ for all $k\in\left\{1,2,\ldots,n\right\}$ 2. $f(k)\neq k$ for all $k\in\left\{2,3,\ldots,n\right\}$ Find the probability that $f(1)\neq1$ for $f$ randomly chosen from $F_n$.
The set of integers is coloured in $100$ colours in such a way that all the colours are used and the following is true. For any choice of intervals $[a, b]$ and $[c,d]$ of equal length and with integral endpoints, if a and c as well as $b$ and $d$, respectively, have the same colour, then the whole intervals $[a, b]$ and $[c,d]$ are identically coloured in that, for any integer $x$, $0 \le x \le b - a$, the numbers $a + x$ and $c + x$ are of the same colour. Prove that $-1982$ and $1982$ are of different colours
For reals $1\leq a\leq b \leq c \leq d \leq e \leq f$ prove inequality $(af + be + cd)(af + bd + ce) \leq (a + b^2 + c^3 )(d + e^2 + f^3 )$.
In a triangle $ ABC$, take point $ D$ on $ BC$ such that $ DB \equal{} 14, DA \equal{} 13, DC \equal{} 4$, and the circumcircle of $ ADB$ is congruent to the circumcircle of $ ADC$. What is the area of triangle $ ABC$?
We call a coloring of an $8\times 8$ board in three colors good if in any corner of five cells contains cells of all three colors. (A five-square corner is a shape made from a $3 \times 3$ square by cutting square $ 2\times 2$.) Prove that the number of good colorings is not less than than $68$.
In triangle $ABC$, point $I$ is the center of the inscribed circle. $AT$ is a segment tangent to the circle circumscribed around the triangle $BIC$ . On the ray $AB$ beyond the point$ B$ and on the ray $AC$ beyond the point $C$, we draw the segments $BD$ and $CE$, respectively, such that $BD = CE = AT$. Let the point $F$ be such that $ABFC$ is a parallelogram. Prove that points $D, E$ and $F$ lie on the same line. (Dmitry Prokopenko)
Let $ABC$ be a triangle with $I$ as incenter.The incircle touches $BC$ at $D$.Let $D'$ be the antipode of $D$ on the incircle.Make a tangent at $D'$ to incircle.Let it meet $(ABC)$ at $X,Y$ respectively.Let the other tangent from $X$ meet the other tangent from $Y$ at $Z$.Prove that $(ZBD)$ meets $IB$ at the midpoint of $IB$
Let $p$ be an odd prime and $S = \{1,2,3,\dots, p\}$ Assume that $U: S \rightarrow S$ is a bijection and $B$ is an integer such that $$B\cdot U(U(a)) - a \: \text{ is a multiple of} \: p \: \text{for all} \: a \in S$$ Show that $B^{\frac{p-1}{2}} -1$ is a multiple of $p$.
Farmer Pythagoras has a field in the shape of a right triangle. The right triangle's legs have lengths 3 and 4 units. In the corner where those sides meet at a right angle, he leaves a small unplanted square $S$ so that from the air it looks like the right angle symbol. The rest of the field is planted. The shortest distance from $S$ to the hypotenuse is 2 units. What fraction of the field is planted? [asy] draw((0,0)--(4,0)--(0,3)--(0,0)); draw((0,0)--(0.3,0)--(0.3,0.3)--(0,0.3)--(0,0)); fill(origin--(0.3,0)--(0.3,0.3)--(0,0.3)--cycle, gray); label("$4$", (2,0), N); label("$3$", (0,1.5), E); label("$2$", (.8,1), E); label("$S$", (0,0), NE); draw((0.3,0.3)--(1.4,1.9), dashed); [/asy] $\textbf{(A) } \frac{25}{27} \qquad \textbf{(B) } \frac{26}{27} \qquad \textbf{(C) } \frac{73}{75} \qquad \textbf{(D) } \frac{145}{147} \qquad \textbf{(E) } \frac{74}{75} $
For what minimal natural $a$ the polynomial $ax^2 + bx + c$ with the integer $c$ and $b$ has two different positive roots both less than one.
[b]p1.[/b] David runs at $3$ times the speed of Alice. If Alice runs $2$ miles in $30$ minutes, determine how many minutes it takes for David to run a mile. [b]p2.[/b] Al has $2019$ red jelly beans. Bob has $2018$ green jelly beans. Carl has $x$ blue jelly beans. The minimum number of jelly beans that must be drawn in order to guarantee $2$ jelly beans of each color is $4041$. Compute $x$. [b]p3.[/b] Find the $7$-digit palindrome which is divisible by $7$ and whose first three digits are all $2$. [b]p4.[/b] Determine the number of ways to put $5$ indistinguishable balls in $6$ distinguishable boxes. [b]p5.[/b] A certain reduced fraction $\frac{a}{b}$ (with $a,b > 1$) has the property that when $2$ is subtracted from the numerator and added to the denominator, the resulting fraction has $\frac16$ of its original value. Find this fraction. [b]p6.[/b] Find the smallest positive integer $n$ such that $|\tau(n +1)-\tau(n)| = 7$. Here, $\tau(n)$ denotes the number of divisors of $n$. [b]p7.[/b] Let $\vartriangle ABC$ be the triangle such that $AB = 3$, $AC = 6$ and $\angle BAC = 120^o$. Let $D$ be the point on $BC$ such that $AD$ bisect $\angle BAC$. Compute the length of $AD$. [b]p8.[/b] $26$ points are evenly spaced around a circle and are labeled $A$ through $Z$ in alphabetical order. Triangle $\vartriangle LMT$ is drawn. Three more points, each distinct from $L, M$, and $T$ , are chosen to form a second triangle. Compute the probability that the two triangles do not overlap. [b]p9.[/b] Given the three equations $a +b +c = 0$ $a^2 +b^2 +c^2 = 2$ $a^3 +b^3 +c^3 = 19$ find $abc$. [b]p10.[/b] Circle $\omega$ is inscribed in convex quadrilateral $ABCD$ and tangent to $AB$ and $CD$ at $P$ and $Q$, respectively. Given that $AP = 175$, $BP = 147$,$CQ = 75$, and $AB \parallel CD$, find the length of $DQ$. [b]p11. [/b]Let $p$ be a prime and m be a positive integer such that $157p = m^4 +2m^3 +m^2 +3$. Find the ordered pair $(p,m)$. [b]p12.[/b] Find the number of possible functions $f : \{-2,-1, 0, 1, 2\} \to \{-2,-1, 0, 1, 2\}$ that satisfy the following conditions. (1) $f (x) \ne f (y)$ when $x \ne y$ (2) There exists some $x$ such that $f (x)^2 = x^2$ [b]p13.[/b] Let $p$ be a prime number such that there exists positive integer $n$ such that $41pn -42p^2 = n^3$. Find the sum of all possible values of $p$. [b]p14.[/b] An equilateral triangle with side length $ 1$ is rotated $60$ degrees around its center. Compute the area of the region swept out by the interior of the triangle. [b]p15.[/b] Let $\sigma (n)$ denote the number of positive integer divisors of $n$. Find the sum of all $n$ that satisfy the equation $\sigma (n) =\frac{n}{3}$. [b]p16[/b]. Let $C$ be the set of points $\{a,b,c\} \in Z$ for $0 \le a,b,c \le 10$. Alice starts at $(0,0,0)$. Every second she randomly moves to one of the other points in $C$ that is on one of the lines parallel to the $x, y$, and $z$ axes through the point she is currently at, each point with equal probability. Determine the expected number of seconds it will take her to reach $(10,10,10)$. [b]p17.[/b] Find the maximum possible value of $$abc \left( \frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)^3$$ where $a,b,c$ are real such that $a +b +c = 0$. [b]p18.[/b] Circle $\omega$ with radius $6$ is inscribed within quadrilateral $ABCD$. $\omega$ is tangent to $AB$, $BC$, $CD$, and $DA$ at $E, F, G$, and $H$ respectively. If $AE = 3$, $BF = 4$ and $CG = 5$, find the length of $DH$. [b]p19.[/b] Find the maximum integer $p$ less than $1000$ for which there exists a positive integer $q$ such that the cubic equation $$x^3 - px^2 + q x -(p^2 -4q +4) = 0$$ has three roots which are all positive integers. [b]p20.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle ABC = 60^o$,$\angle ACB = 20^o$. Let $P$ be the point such that $CP$ bisects $\angle ACB$ and $\angle PAC = 30^o$. Find $\angle PBC$. PS. You had better use hide for answers.
Viktor and Natalia bought $2020$ buckets of ice-cream and want to organize a degustation schedule with $2020$ rounds such that: - In every round, both of them try $1$ ice-cream, and those $2$ ice-creams tried in a single round are different from each other. - At the end of the $2020$ rounds, both of them have tried each ice-cream exactly once. We will call a degustation schedule fair if the number of ice-creams that were tried by Viktor before Natalia is equal to the number of ice creams tried by Natalia before Viktor. Prove that the number of fair schedules is strictly larger than $2020!(2^{1010} + (1010!)^2)$. [i]Proposed by Viktor Simjanoski, Macedonia [/i]
Find all functions $f : \mathbb N \to \mathbb N$ such that: i) $f^{2000}(m)=f(m)$ for all $m \in \mathbb N$, ii) $f(mn)=\dfrac{f(m)f(n)}{f(\gcd(m,n))}$, for all $m,n\in \mathbb N$, and iii) $f(m)=1$ if and only if $m=1$.
Let $f(x) = x-\tfrac1{x}$, and defi ne $f^1(x) = f(x)$ and $f^n(x) = f(f^{n-1}(x))$ for $n\ge2$. For each $n$, there is a minimal degree $d_n$ such that there exist polynomials $p$ and $q$ with $f^n(x) = \tfrac{p(x)}{q(x)}$ and the degree of $q$ is equal to $d_n$. Find $d_n$.
Let $ ABC$ be a triangle in which $ AB \equal{} AC$ and let $ I$ be its in-centre. Suppose $ BC \equal{} AB \plus{} AI$. Find $ \angle{BAC}$
Consider a circle $ \Gamma(O,R)$ and a point $ P$ found in the interior of this circle. Consider a chord $ AB$ of $ \Gamma$ that passes through $ P$. Suppose that the tangents to $ \Gamma$ at the points $ A$ and $ B$ intersect at $ Q$. Let $ M\in QA$ and $ N\in QB$ s.t. $ PM\perp QA$ and $ PN\perp QB$. Prove that the value of $ \frac {1}{PN} \plus{} \frac {1}{PM}$ doesn't depend of choosing the chord $ AB$.
Let $C_1$ be any point on side $AB$ of a triangle $ABC$, and draw $C_1C$. Let $A_1$ be the intersection of $BC$ extended and the line through $A$ parallel to $CC_1$, similarly let $B_1$ be the intersection of $AC$ extended and the line through $B$ parallel to $CC_1$. Prove that $$\frac{1}{AA_1}+\frac{1}{BB_1}=\frac{1}{CC_1}.$$
The Bank of Oslo issues two types of coin: aluminum (denoted A) and bronze (denoted B). Marianne has $n$ aluminum coins and $n$ bronze coins arranged in a row in some arbitrary initial order. A chain is any subsequence of consecutive coins of the same type. Given a fixed positive integer $k \leq 2n$, Gilberty repeatedly performs the following operation: he identifies the longest chain containing the $k^{th}$ coin from the left and moves all coins in that chain to the left end of the row. For example, if $n=4$ and $k=4$, the process starting from the ordering $AABBBABA$ would be $AABBBABA \to BBBAAABA \to AAABBBBA \to BBBBAAAA \to ...$ Find all pairs $(n,k)$ with $1 \leq k \leq 2n$ such that for every initial ordering, at some moment during the process, the leftmost $n$ coins will all be of the same type.