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

In the Cartesian plane, let $C$ be a unit circle with center at origin $O$. For any point $Q$ in the plane distinct from $O$, define $Q'$ to be the intersection of the ray $OQ$ and the circle $C$. Prove that for any $P\in C$ and any $k\in\mathbb{N}$ there exists a lattice point $Q(x,y)$ with $|x|=k$ or $|y|=k$ such that $PQ'<\frac{1}{2k}$.
10.7 Find all pairs $(a,b)$ of natural numbers s.t. $a^n+b^n$ is a perfect $n+1$th power for all $n\in\mathbb{N}$. ([i]V. Senderov[/i])
[u]Set 1[/u] [b]p1.[/b] Assume the speed of sound is $343$ m/s. Anastasia and Bananastasia are standing in a field in front of you. When they both yell at the same time, you hear Anastasia’s yell $5$ seconds before Bananastasia’s yell. If Bananastasia yells first, and then Anastasia yells when she hears Bananastasia yell, you hear Anastasia’s yell $5$ seconds after Bananastasia’s yell. What is the distance between Anastasia and Bananastasia in meters? [b]p2.[/b] Michelle picks a five digit number with distinct digits. She then reverses the digits of her number and adds that to her original number. What is the largest possible sum she can get? [b]p3.[/b] Twain is trying to crack a $4$-digit number combination lock. They know that the second digit must be even, the third must be odd, and the fourth must be different from the previous three. If it takes Twain $10$ seconds to enter a combination, how many hours would it take them to try every possible combination that satisfies these rules? PS. You should use hide for answers.
[color=darkred]A row of a matrix belonging to $\mathcal{M}_n(\mathbb{C})$ is said to be [i]permutable[/i] if no matter how we would permute the entries of that row, the value of the determinant doesn't change. Prove that if a matrix has two [i]permutable[/i] rows, then its determinant is equal to $0$ .[/color]
Let $AB$ be a chord on a circle $O$, $M$ be the midpoint of the smaller arc $AB$. From a point $C$ outside the circle $O$ draws two tangents to the circle $O$ at the points $S$ and $T$. Suppose $MS$ intersects with $AB$ at the point $E$, $MT$ intersects with $AB$ at the point $F$. From $E,F$ draw a line perpendicular to $AB$ that intersects with $OS,OT$ at the points $X,Y$, respectively. Draw another line from $C$ which intersects with the circle $O$ at the points $P$ and $Q$. Let $R$ be the intersection point of $MP$ and $AB$. Finally, let $Z$ be the circumcenter of triangle $PQR$. Prove that $X$,$Y$ and $Z$ are collinear.
One convex quadrilateral is inside another. Can it turn out that the sum of the lengths of the diagonals of the outer quadrilateral is less than the sum of the lengths of the diagonals of the inner?
Let $I$ be the incenter of a triangle $ABC$ with $\angle BAC=60^\circ$. A line through $I$ parallel to $AC$ intersects $AB$ at $F$. Let $P$ be the point on the side $BC$ such that $3BP=BC$. Prove that $\angle BFP=\frac12\angle ABC$.
Find the integer that is closest to $ 1000 \sum_{n=3}^{10000}\frac{1}{n^{2}-4}.$
In a triangle $ABC, O$ is the circumcenter and $I$ the incenter. The excircle $\omega_a$ touches rays $AB,AC$ and side $BC$ at $K,M,N$, respectively. Prove that if the midpoint $P$ of $KM$ lies on the circumcircle of $\triangle ABC$, then points $O,N, I$ lie on a line.
Given a set $S$, of integers, an [i]optimal partition[/i] of S into sets T, U is a partition which minimizes the value $|t - u|$, where $t$ and $u$ are the sum of the elements of $T$ and U respectively. Let $P$ be a set of distinct positive integers such that the sum of the elements of $P$ is $2k$ for a positive integer $k$, and no subset of $P$ sums to $k$. Either show that there exists such a $P$ with at least $2020$ different optimal partitions, or show that such a $P$ does not exist.
A gambler plays the following coin-tossing game. He can bet an arbitrary positive amount of money. Then a fair coin is tossed, and the gambler wins or loses the amount he bet depending on the outcome. Our gambler, who starts playing with $ x$ forints, where $ 0<x<2C$, uses the following strategy: if at a given time his capital is $ y<C$, he risks all of it; and if he has $ y>C$, he only bets $ 2C\minus{}y$. If he has exactly $ 2C$ forints, he stops playing. Let $ f(x)$ be the probability that he reaches $ 2C$ (before going bankrupt). Determine the value of $ f(x)$.
Suppose that k and x are positive integers such that $$\frac{k}{2}=\left( \sqrt{1 +\frac{\sqrt3}{2}}\right)^x+\left( \sqrt{1 -\frac{\sqrt3}{2}}\right)^x.$$ Find the sum of all possible values of $k$
Let $X{}$ be a set of integers which can be partitioned into $N{}$ disjoint increasing arithmetic progressions (infinite in both directions), and cannot be partitioned into a smaller number of such progressions. Is such partition into $N{}$ progressions unique for every such $X{}$ if a) $N = 2{}$ and b) $N = 3$? [i]Viktor Kleptsyn[/i]
An isosceles trapezium is called [i]right[/i] if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called [i]strict[/i] if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. [i]Proposed by Bojan Basic[/i]
Let $ f(n)$ denote the maximum possible number of right triangles determined by $ n$ coplanar points. Show that \[ \lim_{n\rightarrow \infty} \frac{f(n)}{n^2}\equal{}\infty \;\textrm{and}\ \lim_{n\rightarrow \infty}\frac{f(n)}{n^3}\equal{}0 .\] [i]P. Erdos[/i]
a) In a convex $13$-gon all diagonals are drawn, dividing it into smaller polygons. What is the greatest number of sides can these polygons have? b) In a convex $1950$-gon all diagonals are drawn, dividing it into smaller polygons. What is the greatest number of sides can these polygons have?
Two triangles $ACE, BDF$ are given which intersect at six points: $G, H, I, J, K, L$ as in the picture. It is known that in each of the quadrilaterals \[ABIK ,BCJL ,CDKG ,DELH ,EFGI\] it is possible to inscribe a circle. Is it possible for the quadrilateral $FAHJ$ is also circumscribed around a circle?
Suppose $n$ is odd and each square of an $n \times n$ grid is arbitrarily filled with either by $1$ or by $-1$. Let $r_j$ and $c_k$ denote the product of all numbers in $j$-th row and $k$-th column respectively, $1 \le j, k \le n$. Prove that $$\sum_{j=1}^{n} r_j+ \sum_{k=1}^{n} c_k\ne 0$$
Find all pairs $(p,n)$ so that $p$ is a prime number, $n$ is a positive integer and \[p^3-2p^2+p+1=3^n \] holds.
In a triangle $ABC$ a circle $k$ is inscribed, which is tangent to $BC$,$CA$,$AB$ in points $D,E,F$ respectively. Let point $P$ be inner for $k$. If the lines $DP$,$EP$,$FP$ intersect $k$ in points $D',E',F'$ respectively, then prove that $AD'$, $BE'$, and $CF'$ are concurrent.
In \(\triangle ABC, AB = AC = 10\) and \(BC = 12\). Point \(D\) lies strictly between \(A\) and \(B\) on \(\overline{AB}\) and point \(E\) lies strictly between \(A\) and \(C\) on \(\overline{AC}\) so that \(AD = DE = EC\). Then \(AD\) can be expressed in the form \(\tfrac{p}{q}\), where \(p\) and \(q\) are relatively prime positive integers. Find \(p + q\).
Let $S = \{1, 2, 3, ..., 100\}$ and $P$ is the collection of all subset $T$ of $S$ that have $49$ elements, or in other words: $$P = \{T \subset S : |T| = 49\}.$$ Every element of $P$ is labelled by the element of $S$ randomly (the labels may be the same). Show that there exist subset $M$ of $S$ that has $50$ members such that for every $x \in M$, the label of $M -\{x\}$ is not equal to $x$
Let $S(x)$ denote the sum of the decimal digits of $x$. Do there exist natural numbers $a,b,c$ such that \[ S(a+b)<5, \quad S(b+c)<5, \quad S(c+a)<5, \quad S(a+b+c)> 50? \]
Consider the sequence \[ 1, \minus{} 2,3, \minus{} 4,5, \minus{} 6,\ldots,\] whose $ n$th term is $ ( \minus{} 1)^{n \plus{} 1}\cdot n$. What is the average of the first $ 200$ terms of the sequence? $ \textbf{(A)}\minus{}\!1\qquad \textbf{(B)}\minus{}\!0.5\qquad \textbf{(C)}\ 0\qquad \textbf{(D)}\ 0.5\qquad \textbf{(E)}\ 1$
Let $AA_1$ and $BB_1$ be heights in acute triangle intersects at $H$. Let $A_1A_2$ and $B_1B_2$ be heights in triangles $HBA_1$ and $HB_1A$, respe. Prove that $A_2B_2$ and $AB$ are parralel.