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

Ten women sit in $ 10$ seats in a line. All of the $ 10$ get up and then reseat themselves using all $ 10$ seats, each sitting in the seat she was in before or a seat next to the one she occupied before. In how many ways can the women be reseated? $ \textbf{(A)}\ 89\qquad \textbf{(B)}\ 90\qquad \textbf{(C)}\ 120\qquad \textbf{(D)}\ 2^{10}\qquad \textbf{(E)}\ 2^2 3^8$
The altitudes of a tetrahedron $ABCD$ are extended externally to points $A'$, $B'$, $C'$, and $D'$, where $AA' = k/h_a$, $BB' = k/h_b$, $CC' = k/h_c$, and $DD' = k/h_d$. Here, $k$ is a constant and $h_a$ denotes the length of the altitude of $ABCD$ from vertex $A$, etc. Prove that the centroid of tetrahedron $A'B'C'D'$ coincides with the centroid of $ABCD$.
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
On side $AB$ of a scalene triangle $ABC$ there are points $M$, $N$ such that $AN=AC$ and $BM=BC$. The line parallel to $BC$ through $M$ and the line parallel to $AC$ through $N$ intersect at $S$. Prove that $\measuredangle{CSM} = \measuredangle{CSN}$.
Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose the Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let $s$ denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of $s$? $\textbf{(A) } 9 \qquad\textbf{(B) } 11 \qquad\textbf{(C) } 12 \qquad\textbf{(D) } 13 \qquad\textbf{(E) } 15 $
Prove that the following inequality holds for all positive $\{a_i\}$: $$\frac{1}{a_1} + \frac{2}{a_1+a_2} + ... +\frac{ n}{a_1+...+a_n} < 4\left(\frac{1}{a_1} + ... + \frac{1}{a_n}\right)$$
Given an acute $\vartriangle ABC$ with orthocenter $H$. Let $M_a$ be the midpoint of $BC. M_aH$ intersects the circumcircle of $\vartriangle ABC$ at $X_a$ and $AX_a$ intersects $BC$ at $Y_a$. Define $Y_b, Y_c$ in a similar way. Prove that $Y_a, Y_b,Y_c$ are collinear. [img]https://2.bp.blogspot.com/-yjISBHtRa0s/XnSKTrhhczI/AAAAAAAALds/e_rvs9glp60L1DastlvT0pRFyP7GnJnCwCK4BGAYYCw/s320/imoc2017%2Bg4.png[/img]
The natural numbers $n$ and $z$ are relatively prime and greater than $1$. For $k = 0, 1, 2,..., n - 1$ let $s(k) = 1 + z + z^2 + ...+ z^k.$ Prove that: a) At least one of the numbers $s(k)$ is divisible by $n$. b) If $n$ and $z - 1$ are also coprime, then already one of the numbers $s(k)$ with $k = 0,1, 2,..., n- 2$ is divisible by $n$.
If $f(x)=4^x$ then $f(x+1)-f(x)$ equals: $ \text{(A)}\ 4\qquad\text{(B)}\ f(x)\qquad\text{(C)}\ 2f(x)\qquad\text{(D)}\ 3f(x)\qquad\text{(E)}\ 4f(x) $
A subset of the set $A={1,2,\dots ,n}$ is called [i]connected[/i], if it consists of one number or a certain amount of consecutive numbers. Find the greatest $k$ (defined as a function of $n$) for which there exists $k$ different subsets $A_1,A_2,…,A_k$ of $A$ the intersection of each two of which is a [i]connected[/i] set.
Let $\mathbb{P}$ be the set of all prime numbers. Find all functions $f:\mathbb{P}\rightarrow\mathbb{P}$ such that: $$f(p)^{f(q)}+q^p=f(q)^{f(p)}+p^q$$ holds for all $p,q\in\mathbb{P}$. [i]Proposed by Dorlir Ahmeti, Albania[/i]
A simple graph is called "divisibility", if it's possible to put distinct numbers on its vertices such that there is an edge between two vertices if and only if number of one of its vertices is divisible by another one. A simple graph is called "permutationary", if it's possible to put numbers $1,2,...,n$ on its vertices and there is a permutation $ \pi $ such that there is an edge between vertices $i,j$ if and only if $i>j$ and $\pi(i)< \pi(j)$ (it's not directed!) Prove that a simple graph is permutationary if and only if its complement and itself are divisibility. [i]Proposed by Morteza Saghafian[/i] .
Circles $W_1,W_2$ intersect at $P,K$. $XY$ is common tangent of two circles which is nearer to $P$ and $X$ is on $W_1$ and $Y$ is on $W_2$. $XP$ intersects $W_2$ for the second time in $C$ and $YP$ intersects $W_1$ in $B$. Let $A$ be intersection point of $BX$ and $CY$. Prove that if $Q$ is the second intersection point of circumcircles of $ABC$ and $AXY$ \[\angle QXA=\angle QKP\]
Let $\vartriangle ABC$ be an acute triangle with $AB < AC$. Let $H$ be its orthocentre and $M$ be the midpoint of arc $BAC$ on the circumcircle. It is given that $B$, $H$, $M$ are collinear, the length of the altitude from $M$ to $AB$ is $1$, and the length of the altitude from $M$ to $BC$ is $6$. Determine all possible areas for $\vartriangle ABC$ .
Find all pairs of real numbers $(x,y)$ satisfying the system of equations: \begin{align*}\frac{1}{x} + \frac{1}{2y} &= (x^2+3y^2)(3x^2+y^2)\\ \frac{1}{x} - \frac{1}{2y} &= 2(y^4-x^4)\end{align*}
Find all real solutions of the equation $$x^2+y^2+z^2+t^2=xy+yz+zt+t-\frac25.$$
Let $a$ and $b$ be natural numbers. We consider the set $M$ of the points of the plane with an integer $x$-coordinate from $1$ to $a$ and integer $y$-coordinate from $1$ to $b$. For two points $P = (x, y)$ and $Q = (\tilde x, \tilde y)$ in M we write $P\le Q$ if $x\le \tilde x$ and $y \le \tilde y$, we say $P$ is [i]less [/i] than $Q$ when $P\le Q$ and $P \ne Q$. A subset $S$ of $M$ is now called [i]cute [/i] if for every point $P \in S$ it also contains all smaller points. From an arbitrary subset $S$ of $M$ we can now create new subsets in four ways to construct: (a) the complement $K (S) = \overline{S}$, (b) the subset $\min (S)$ of its minima, i.e. those points for which there is no smaller in $S$ occurs, (c) the cute set $P (S)$ of all those points in M that are less than or equal to some point are from $S$, (d) you do all these things one after the other and get a set $Z (S) = P (\min (K (S)))$. Let $S$ be cute. Prove that $$\underset{a+b\,\, times\,\, Z}{Z(Z(...(Z(S))...))=S}$$
A serie of positive integers $a_{1}$,$a_{2}$,. . . ,$a_{n}$ is $auto-delimited$ if for every index $i$ that holds $1\leq i\leq n$, there exist at least $a_{i}$ terms of the serie such that they are all less or equal to $i$. Find the maximum value of the sum $a_{1}+a_{2}+\cdot \cdot \cdot+a_{n}$, where $a_{1}$,$a_{2}$,. . . ,$a_{n}$ is an $auto-delimited$ serie.
The area of a circle inscribed in an equilateral triangle is $ 48\pi$. The perimeter of this triangle is: $ \textbf{(A)}\ 72\sqrt{3} \qquad \textbf{(B)}\ 48\sqrt{3}\qquad \textbf{(C)}\ 36\qquad \textbf{(D)}\ 24\qquad \textbf{(E)}\ 72$
Let $n\ge 2$ be an even integer and $a,b$ real numbers such that $b^n=3a+1$. Show that the polynomial $P(X)=(X^2+X+1)^n-X^n-a$ is divisible by $Q(X)=X^3+X^2+X+b$ if and only if $b=1$.
$f(n)$ is the least number that there exist a $f(n)-$mino that contains every $n-$mino. Prove that $10000\leq f(1384)\leq960000$. Find some bound for $f(n)$
Let $\text{s}_b(k)$ denote the sum of the digits of $k$ in base $b$. Compute \[\text{s}_{101}(33)+\text{s}_{101}(66)+\text{s}_{101}(99)+\cdots+\text{s}_{101}(3333).\] [i]2021 CCA Math Bonanza Individual Round #10[/i]
The function $f(x) = x^2+ax+b$ has two distinct zeros. If $f(x^2+2x-1)=0$ has four distinct zeros $x_1<x_2<x_3<x_4$ that form an arithmetic sequence, compute the range of $a-b$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 11)[/i]
Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.
a) Several black squares of side $1$ cm are nailed to a white plane with a nail of thickness $0 . 1$ cm so that they form a black polygon. Can it happen that the perimeter of this polygon is $1$ km long? (The nail is not allowed to touch the boundary of any of the squares . ) (b) The same problem as in (a) but with a nail of thickness $0$ (a point ) . (c) Several black squares of side $1$ cm lie on a white plane so that they form a black polygon (possibly having more than one piece and/ or having holes) . Can it happen that the ratio of its perimeter (in centimetres) to its area (in square centimetres) is more than $100000$? (Hungarian Folklore)