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

Find all positive integers $n \geq 3$ for which there exists a set $S$ which consists of rational numbers such that the following two conditions hold: 1) any rational number can be represented as the sum of at most $n$ elements of $S$ 2) there exists a rational number, which can not be represented as the sum of at most $n-1$ elements of $S$ (in the sum some elements can repeat) [i]M. Shutro, M. Zorka[/i]
Solve the equation $|x^2 -1|+ |x^2 - 4| = mx$ as a function of the parameter $m$. Which pairs $(x,m)$ of integers satisfy this equation?
In non-isosceles acute ${}{\triangle ABC}$, $AP$, $BQ$, $CR$ is the height of the triangle. $A_1$ is the midpoint of $BC$, $AA_1$ intersects $QR$ at $K$, $QR$ intersects a straight line that crosses ${A}$ and is parallel to $BC$ at point ${D}$, the line connecting the midpoint of $AH$ and ${K}$ intersects $DA_1$ at $A_2$. Similarly define $B_2$, $C_2$. ${}\triangle A_2B_2C_2$ is known to be non-degenerate, and its circumscribed circle is $\omega$. Prove that: there are circles $\odot A'$, $\odot B'$, $\odot C'$ tangent to and INSIDE $\omega$ satisfying: (1) $\odot A'$ is tangent to $AB$ and $AC$, $\odot B'$ is tangent to $BC$ and $BA$, and $\odot C'$ is tangent to $CA$ and $CB$. (2) $A'$, $B'$, $C$' are different and collinear. [i]Created by Sihui Zhang[/i]
Let $ABC$ be a triangle right-angled at $A$ and $S$ be its circumcircle. Let $S_1$ be the circle touching the lines $AB$ and $AC$, and the circle $S$ internally. Further, let $S_2$ be the circle touching the lines $AB$ and $AC$ and the circle $S$ externally. If $r_1, r_2$ be the radii of $S_1, S_2$ prove that $r_1 \cdot r_2 = 4 A[ABC]$.
Let $p{}$ be a fixed prime number. Determine the number of ordered $k$-tuples $(a_1,\ldots,a_k)$ of non-negative integers smaller than $p{}$ for which $p\mid a_1^2+\cdots+a_k^2$ where a) $k=3$ and b) $k$ is an arbitrary odd positive integer.
Let $A = \{1,2,3,4,5,6,7,8\}$, $B = \{9,10,11,12,13,14,15,16\}$ and $C =\{17,18,19,20,21,22,23,24\}$. Find the number of triples $(x, y, z)$ such that $x \in A, y \in B, z \in C $ and $x + y + z = 36$.
Let $m$ and $n$ be positive integers with $m > n \ge 2$. Set $S =\{1,2,...,m\}$, and set $T = \{a_1,a_2,...,a_n\}$ is a subset of $S$ such that every element of $S$ is not divisible by any pair of distinct elements of $T$. Prove that $$\frac{1}{a_1}+\frac{1}{a_2}+ ...+ \frac{1}{a_n} < \frac{m+n}{m}$$
The sequence $ a_1$, $ a_2$, $ a_3$, $ \dots$ satisfies $ a_1 \equal{} 19$, $ a_9 \equal{} 99$, and, for all $ n \ge 3$, $ a_n$ is the arithmetic mean of the first $ n \minus{} 1$ terms. Find $ a_2$. $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 59\qquad \textbf{(C)}\ 79\qquad \textbf{(D)}\ 99\qquad \textbf{(E)}\ 179$
$(YUG 2)$ A park has the shape of a convex pentagon of area $50000\sqrt{3} m^2$. A man standing at an interior point $O$ of the park notices that he stands at a distance of at most $200 m$ from each vertex of the pentagon. Prove that he stands at a distance of at least $100 m$ from each side of the pentagon.
Work base 3. (so each digit is 0,1,2) A good number of size $n$ is a number in which there are no consecutive $1$'s and no consecutive $2$'s. How many good 10-digit numbers are there?
Let $ABC$ be a triangle with all angles $\leq 120^{\circ}$. Let $F$ be the Fermat point of triangle $ABC$, that is, the interior point of $ABC$ such that $\angle AFB = \angle BFC = \angle CFA = 120^\circ$. For each one of the three triangles $BFC$, $CFA$ and $AFB$, draw its Euler line - that is, the line connecting its circumcenter and its centroid. Prove that these three Euler lines pass through one common point. [i]Remark.[/i] The Fermat point $F$ is also known as the [b]first Fermat point[/b] or the [b]first Toricelli point[/b] of triangle $ABC$. [i]Floor van Lamoen[/i]
Let $a$ and $b$ be integers. Find all polynomial with integer coefficients sucht that $P(n)$ divides $P(an+b)$ for infinitely many positive integer $n$
Let $ a_1<a_2<\cdots<a_n $ be positive integers such that for every distinct $1\leq{i,j}\leq{n}$ we have $ a_j-a_i $ divides $ a_i $. Prove that \[ ia_j\leq{ja_i} \qquad \text{ for } 1\leq{i}<j\leq{n} \]
Let $n$ be a positive integer. Find the greatest common divisor of the numbers $\binom{2n}{1},\binom{2n}{3},\binom{2n}{5},...,\binom{2n}{2n-1}$.
For all valid values ​​of $a$ and $b$, solve the equation $$\frac{x^3}{(x-a) (x-b)} +\frac{a^3}{(a-b) (a-x)} + \frac{b^3}{ (b-x) (b-a)}= x^2 + a + b$$
Let $ \overline{MN}$ be a diameter of a circle with diameter $ 1$. Let $ A$ and $ B$ be points on one of the semicircular arcs determined by $ \overline{MN}$ such that $ A$ is the midpoint of the semicircle and $ MB\equal{}\frac35$. Point $ C$ lies on the other semicircular arc. Let $ d$ be the length of the line segment whose endpoints are the intersections of diameter $ \overline{MN}$ with the chords $ \overline{AC}$ and $ \overline{BC}$. The largest possible value of $ d$ can be written in the form $ r\minus{}s\sqrt{t}$, where $ r$, $ s$, and $ t$ are positive integers and $ t$ is not divisible by the square of any prime. Find $ r\plus{}s\plus{}t$.
Each of the football teams Istanbulspor, Yesildirek, Vefa, Karagumruk, and Adalet, played exactly one match against the other four teams. Istanbulspor defeated all teams except Yesildirek; Yesildirek defeated Istanbulspor but lost to all the other teams. Vefa defeated all except Istanbulspor. The winner of the game Karagumruk-Adalet is Karagumruk. In how many ways one can order these five teams such that each team except the last, defeated the next team? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ \text{None of the preceding} $
Two circles $C_1$ and $C_2$, with centres at $D$ and $E$ respectively, touch at $B$. The circle having $DE$ as diameter intersects the circle $C_1$ at $H$ and the circle $C_2$ at $K$. The points $H$ and $K$ both lie on the same side of the line $DE$. $HK$ extended in both directions meets the circle $C_1$ at $L$ and meets the circle $C_2$ at $M$. Prove that (a) $|LH| = |KM|$ (b) the line through $B$ perpendicular to $DE$ bisects $HK$.
A sequence $P=\left \{ a_{n} \right \}$ is called a $ \text{Permutation}$ of natural numbers (positive integers) if for any natural number $m,$ there exists a unique natural number $n$ such that $a_n=m.$ We also define $S_k(P)$ as: $S_k(P)=a_{1}+a_{2}+\cdots +a_{k}$ (the sum of the first $k$ elements of the sequence). Prove that there exists infinitely many distinct $ \text{Permutations}$ of natural numbers like $P_1,P_2, \cdots$ such that$:$ $$\forall k, \forall i<j: S_k(P_i)|S_k(P_j)$$
Determine the range of $w(w + x)(w + y)(w + z)$, where $x, y, z$, and $w$ are real numbers such that \[x + y + z + w = x^7 + y^7 + z^7 + w^7 = 0.\]
Consider the sequence $(x_n)$ given by $$x_1=2,\enspace x_{n+1}=\frac{x_n+1+\sqrt{x_n^2+2x_n+5}}2,\enspace n\ge2.$$Prove that the sequence $y_n=\sum_{k=1}^n\frac1{x_k^2-1},\enspace n\ge1$ is convergent and find its limit.
The negation of the proposition "For all pairs of real numbers $a$, $b$, if $a=0$, then $ab=0$" is: There are real numbers $a,b$ such that $\text{(A)} \ a\ne0,ab\ne 0 ~~\text{(B)} \ a\ne 0, ab=0 ~~ \text{(C)} \ a=0,ab\ne 0$ $\text{(D)} \ ab\ne0,a\ne0 ~~\text{(E)} \ ab=0,a\ne0$
Let $D$ be a point inside of equilateral $\triangle ABC$, and $E$ be a point outside of equilateral $\triangle ABC$ such that $m(\widehat{BAD})=m(\widehat{ABD})=m(\widehat{CAE})=m(\widehat{ACE})=5^\circ$. What is $m(\widehat{EDC})$ ? $ \textbf{(A)}\ 45^\circ \qquad\textbf{(B)}\ 40^\circ \qquad\textbf{(C)}\ 35^\circ \qquad\textbf{(D)}\ 30^\circ \qquad\textbf{(E)}\ 25^\circ $
What is the remainder when $201820182018... $ [$2018$ times] is divided by $15$?
Isabella assigns a distinct integer from $1$ to $6$ to each row and column of a $3\times 3$ grid. In each entry, she writes either the sum or the product of the values assigned to the corresponding row and column. Find the maximum possible value of the sum of all entries in the grid.