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 a certain big city, all the streets go in one of two perpendicular directions. During a drive in the city, a car does not pass through any place twice, and returns to the parking place along a street from which it started. If it has made 100 left turns, how many right turns must it have made? [i](5 points)[/i]
Find all real solutions: $$\begin{cases}a^3=2024bc \\ b^3=2024cd \\ c^3=2024da \\ d^3=2024ab \end{cases}$$
If $ a,b,c,d,e$ are positive numbers bounded by $ p$ and $ q$, i.e, if they lie in $ [p,q], 0 < p$, prove that \[ (a \plus{} b \plus{} c \plus{} d \plus{} e)\left(\frac {1}{a} \plus{} \frac {1}{b} \plus{} \frac {1}{c} \plus{} \frac {1}{d} \plus{} \frac {1}{e}\right) \le 25 \plus{} 6\left(\sqrt {\frac {p}{q}} \minus{} \sqrt {\frac {q}{p}}\right)^2\] and determine when there is equality.
Find the value of the following expression: $2 + 33 + 6 + 35 + 10 + 37 + \ldots + 1194 + 629 + 1198 + 631$
In triangle $ABC$, let $I_a$ $,I_b$, $I_c$ be the centers of the excircles tangent to sides $BC$, $CA$, $AB$, respectively. Let $P$ and $Q$ be the tangency points of the excircle of center $I_a$ with lines $AB$ and $AC$. Line $PQ$ intersects $I_aB$ and $I_aC$ at $D$ and $E$. Let $A_1$ be the intersection of $DC$ and $BE$. In an analogous way we define points $B_1$ and $C_1$. Prove that $AA_1$, $BB_1$ , $CC_1$ are concurrent.
Prove that the inequality $$ \frac{1}{3} \leq \frac{\tan 3\alpha}{\tan \alpha} \leq 3 $$ is not true for any value of $ \alpha $.
Find all the prime numbers $p$ and $q$ such that $ p^2+q=37q^2+p $. Clarification: $1$ is not a prime number.
Prove that for every nonnegative integer $ k$ there is a product $$(k + 1)(k + 2)...(k + 1980)$$ divisible by $ 1980^{197}$.
There are three cities each of which has exactly the same number of citizens, say $n$. Every citizen in each city has exactly a total of $(n+1)$ friends in the other two cities. Show that there exist three people, one from each city, such that they are friends. We assume that friendship is mutual (that is, a symmetric relation).
Let $\displaystyle \mathcal K$ be a finite field such that the polynomial $\displaystyle X^2-5$ is irreducible over $\displaystyle \mathcal K$. Prove that: (a) $1+1 \neq 0$; (b) for all $\displaystyle a \in \mathcal K$, the polynomial $\displaystyle X^5+a$ is reducible over $\displaystyle \mathcal K$. [i]Marian Andronache[/i] [Edit $1^\circ$] I wanted to post it in "Superior Algebra - Groups, Fields, Rings, Ideals", but I accidentally put it here :blush: Can any mod move it? I'd be very grateful. [Edit $2^\circ$] OK, thanks.
Let $n,k$ be positive integers such that $n$ is not divisible by $3$ and $k\ge n$. Prove that there is an integer $m$ divisible by $n$ whose sum of digits in base $10$ equals $k$.
Given that the expression $\frac{20^{21}}{20^{20}} +\frac{20^{20}}{20^{21}}$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers, find $m +n$. [i]Proposed by Ada Tsui[/i]
(1) Find the smallest positive integer $a$ such that $221|3^a -2^a$, (2) Let $A=\{n\in N^*: 211|1+2^n+3^n+4^n\}$. Are there infinitely many numbers $n$ such that both $n$ and $n+1$ belong to set $A$?
A subset $S$ of the natural numbers is called [i]dense [/i] for every $7$ consecutive natural numbers, at least $5$ of them are in $S$. Show that there exists a dense subset for which the equation $a^2+b^2=c^2$ has no solution for $a,b,c \in S$.
Find the sum of all positive integers $n$ with the following properties: [list] [*] $n$ is not divisible by any primes larger than $10$. [*] For some positive integer $k$, the positive divisors of $n$ are \[1=d_1<d_2<d_3\cdots<d_{2k}=n.\] [*] The divisors of $n$ have the property that \[d_1+d_2+\cdots+d_k=3k.\] [/list] [i]2021 CCA Math Bonanza Team Round #7[/i]
Suppose that $P$ is a polynomial with integer coefficients such that $P(1) = 2$, $P(2) = 3$ and $P(3) = 2016$. If $N$ is the smallest possible positive value of $P(2016)$, find the remainder when $N$ is divided by $2016$.
Let $\Gamma_1, \Gamma_2$ be circles that touch at a point $A$, and $\Gamma_2$ is inside $\Gamma_1$. Let $B$ be on $\Gamma_2$, and let $AB$ intersect $\Gamma_1$ on $C$. Let $D$ be on $\Gamma_1$ and $P$ be on the line $CD$ (may be outside of the segment $CD$). $BP$ intersects $\Gamma_2$ at $Q$. Prove that $A,D,P,Q$ lie on a circle.
A book is published in three volumes, the pages being numbered from $1$ onwards. The page numbers are continued from the first volume to the second volume to the third. The number of pages in the second volume is $50$ more than that in the first volume, and the number pages in the third volume is one and a half times that in the second. The sum of the page numbers on the first pages of the three volumes is $1709$. If $n$ is the last page number, what is the largest prime factor of $n$?
Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that \[ f(2x + y + f(x + y)) + f(xy) = y f(x) \] for all real numbers $x$ and $y$.
Let $b\geq 2$ be an integer, and let $s_b(n)$ denote the sum of the digits of $n$ when it is written in base $b$. Show that there are infinitely many positive integers that cannot be represented in the form $n+s_b(n)$, where $n$ is a positive integer.
Let $a,b,c\ge0$. Show that $(a^2+2bc)^{2012}+(b^2+2ca)^{2012}+(c^2+2ab)^{2012}\le (a^2+b^2+c^2)^{2012}+2(ab+bc+ca)^{2012}$. [i]Calvin Deng.[/i]
Let $A_1,A_2,\ldots,A_{2017}$ be the vertices of a regular polygon with $2017$ sides.Prove that there exists a point $P$ in the plane of the polygon such that the vector $$\sum_{k=1}^{2017}k\frac{\overrightarrow{PA}_k}{\left\lVert\overrightarrow{PA}_k\right\rVert^5}$$ is the zero vector. (The notation $\left\lVert\overrightarrow{XY}\right\rVert$ represents the length of the vector $\overrightarrow{XY}$.)
Prove that the expression \[\frac{\gcd(m, n)}{n}{n \choose m}\] is an integer for all pairs of positive integers $(m, n)$ with $n \ge m \ge 1$.
Some points in the plane are either colored red or blue. The distance between two points of the opposite color is at most 1. Prove that there exists a circle with diameter $\sqrt{2}$ such that no two points outside of this circle have same color. It is enough to prove this claim for a finite number of colored points.
a) Prove that for every $\epsilon>0$ there is a positive integer $n$ and real numbers $\lambda_{1},\dots,\lambda_{n}$ such that $$\max_{x\in [-1,1]}|x-\sum_{k=1}^{n}\lambda_{k}x^{2k+1}|<\epsilon.$$ b) Prove that for every odd continuous function $f$ on $[-1,1]$ and for every $\epsilon>0$ there is a positive integer $n$ and real numbers $\mu_{1},\dots,\mu_{n}$ such that $$\max_{x\in [-1,1]}|f(x)-\sum_{k=1}^{n}\mu_{k}x^{2k+1}|<\epsilon.$$