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

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]
Determine all integers $n \ge 3$ whose decimal expansion has less than $20$ digits, such that every quadratic non-residue modulo $n$ is a primitive root modulo $n$. [i]An integer $a$ is a quadratic non-residue modulo $n$, if there is no integer $b$ such that $a - b^2$ is divisible by $n$. An integer $a$ is a primitive root modulo $n$, if for every integer $b$ relatively prime to n there is a positive integer $k$ such that $a^k - b$ is divisible by $n$.[/i]
How many ordered triples $(a, b, c)$ of integers $1 \le a, b, c \le 31$ are there such that the remainder of $ab+bc+ca$ divided by $31$ equals $8$?
Rachel the unicorn lives on the numberline at the number $0$. One day, Rachel decides she’d like to travel the world and visit the numbers $1, 2, 3, \ldots, 31$. She starts off at the number $0$, with a list of the numbers she wants to visit: $1, 2, 3, \ldots , 31$. Rachel then picks one of the numbers on her list uniformly at random, crosses it off the list, and travels to that number in a straight line path. She repeats this process until she has crossed off and visited all thirty-one of the numbers from her original list. At the end of her trip, she returns to her home at $0$. What is the expected length of Rachel’s round trip?
If $C$ is a set of $n$ points in the plane that has the following property: For each point $P$ of $C$, there are four points of $C$, each one distinct from $P$ , which are the vertices of a square. Find the smallest possible value of $n$.
$ABCD$ is inscribed in unit circle $\Gamma$. Let $\Omega_1$, $\Omega_2$ be the circumcircles of $\vartriangle ABD$, $\vartriangle CBD$ respectively. Circles $\Omega_1$, $\Omega_2$ are tangent to segment $BD$ at $M$,$N$ respectively. Line A$M$ intersects $\Gamma$, $\Omega_1$ again at points $X_1$,$X_2$ respectively (different from $A$, $M$). Let $\omega_1$ be the circle passing through $X_1$, $X_2$ and tangent to $\Omega_1$. Line $CN$ intersects $\Gamma$, $\Omega_2$ again at points $Y_1$, $Y_2$ respectively (different from $C$, $N$). Let $\omega_2$ be the circle passing through $Y_1$, $Y_2$ and tangent to $\Omega_2$. Circles $\Omega_1$,$\Omega_2$, $\omega_1$, $\omega_2$ have radii $R_1$, $R_2$, $r_1$, $r_2$ respectively. Prove that $$r_1+r_2-R_1-R_2=1.$$ [img]https://cdn.artofproblemsolving.com/attachments/1/5/70471f2419fadc4b2183f5fe74f0c7a2e69ed4.png[/img] [url=https://www.geogebra.org/m/vxx8ghww]geogebra file[/url]
Given reals $x_1 \ge x_2 \ge ... \ge x_{2003} \ge 0$, show that $$x_1^n - x_2^n + x_2^n - ... - x_{2002}^n + x_{2003}^n \ge (x_1 - x_2 + x_3 - x_4 + ... - x_{2002} + x_{2003})^n$$ for any positive integer $n$.
Find all polynomials $P(x,y)$ with real coefficients such that for all real numbers $x,y$ and $z$: $$P(x,2yz)+P(y,2zx)+P(z,2xy)=P(x+y+z,xy+yz+zx).$$ [i]Proposed by Sina Saleh[/i]
Let $p_{1}, p_{2}, \cdots, p_{n}$ be distinct primes greater than $3$. Show that \[2^{p_{1}p_{2}\cdots p_{n}}+1\] has at least $4^{n}$ divisors.
In the country of [i]Sugarland[/i], there are $13$ students in the IMO team selection camp. $6$ team selection tests were taken and the results have came out. Assume that no students have the same score on the same test.To select the IMO team, the national committee of math Olympiad have decided to choose a permutation of these $6$ tests and starting from the first test, the person with the highest score between the remaining students will become a member of the team.The committee is having a session to choose the permutation. Is it possible that all $13$ students have a chance of being a team member? [i]Proposed by Morteza Saghafian[/i]
Consider a triangle $ABC$ and two congruent triangles $A_1B_1C_1$ and $A_2B_2C_2$ which are respectively similar to $ABC$ and inscribed in it: $A_i,B_i,C_i$ are located on the sides of $ABC$ in such a way that the points $A_i$ are on the side opposite to $A$, the points $B_i$ are on the side opposite to $B$, and the points $C_i$ are on the side opposite to $C$ (and the angle at A are equal to angles at $A_i$ etc.). The circumcircles of $A_1B_1C_1$ and $A_2B_2C_2$ intersect at points $P$ and $Q$. Prove that the line $PQ$ passes through the orthocenter of $ABC$.
Find positive integers $x, y, z$ such that $x > z > 1999 \cdot 2000 \cdot 2001 > y$ and $2000x^{2}+y^{2}= 2001z^{2}.$
Find all functions $f$ that is defined on all reals but $\tfrac13$ and $- \tfrac13$ and satisfies \[ f \left(\frac{x+1}{1-3x} \right) + f(x) = x \] for all $x \in \mathbb{R} \setminus \{ \pm \tfrac13 \}$.
Can the number obtained by writing the numbers from 1 to $n$ in order ($n > 1$) be the same when read left-to-right and right-to-left? [i]N. Agakhanov[/i]
Let $n \geqslant 100$ be an integer. Ivan writes the numbers $n, n+1, \ldots, 2 n$ each on different cards. He then shuffles these $n+1$ cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.
If integers $m,n,k$ satisfy $m^2+n^2+1=kmn$, what values can $k$ have?
Complex number $z=1-\sin\theta+\text{i}\cos\theta\left(\frac{\pi}{2}<\theta<\pi\right)$, find the range value of $\arg{\overline{z}}$.
On a trip to the beach, Anh traveled 50 miles on the highway and 10 miles on a coastal access road. He drove three times as fast on the highway as on the coastal road. If Anh spent 30 minutes driving on the coastal road, how many minutes did his entire trip take? $\textbf{(A) }50\qquad\textbf{(B) }70\qquad\textbf{(C) }80\qquad\textbf{(D) }90\qquad \textbf{(E) }100$
Let $(x_n)_{n\ge2}$ be a sequence of real numbers such that $x_2>0$ and $x_{n+1}=-1+\sqrt[n]{1+nx_n}$ for $n\ge2$. Find (a) $\lim_{n\to\infty}x_n$, (b) $\lim_{n\to\infty}nx_n$.
There are $100$ points on the plane, all pairwise distances between which are different. Is there always a polyline with vertices at these points, passing through each point once, in which the link lengths increase monotonously?
Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$ [i]Andrew Carratu[/i]
What is the value of ${ \sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+5\sqrt{1+\cdots }}}}}} $?
We consider the infinite chessboard covering the whole plane. In every field of the chessboard there is a nonnegative real number. Every number is the arithmetic mean of the numbers in the four adjacent fields of the chessboard. Prove that the numbers occurring in the fields of the chessboard are all equal.
For how many distinct ordered triples $(a,b,c)$ of boolean variables does the expression $a \lor (b \land c)$ evaluate to true?
Three players $A, B$ and $C$ take turns taking stones from a pile of $N$ stones. They play in the order $A$, $B$, $C$, $A$, $B$, $C$, $....$, $A$ starts the game and the one who takes the last stone loses. Players $A$ and $C$ They form a team against $B$, they agree on a strategy joint. $B$ can take $1, 2, 3, 4$ or $5$ stones on each move, while that $A$ and $C$ can each draw $1, 2$ or $3$ stones in each turn. Determine for which values of $N$ have winning strategies $A$ and $C$ , and for what values the winning strategy is $B$'s.