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: 252

Determine the lowest positive integer n such that following statement is true: If polynomial with integer coefficients gets value 2 for n different integers, then it can't take value 4 for any integer.
What is the largest possible value of $|...| |a_1 - a_2| - a_3| - ... - a_{1990}|$, where $a_1, a_2, ... , a_{1990}$ is a permutation of $1, 2, 3, ... , 1990$?
We are placing $n$ integers whose sum is $94$ over a circle such that each number is equal to the absolute value of the difference of (clockwise) next two numbers. What is the largest $n$ that makes such placing possible? $ \textbf{(A)}\ 188 \qquad\textbf{(B)}\ 186 \qquad\textbf{(C)}\ 141 \qquad\textbf{(D)}\ 100 \qquad\textbf{(E)}\ 47 $
If $x,y$ are real, then the $\textit{absolute value}$ of the complex number $z=x+yi$ is \[|z|=\sqrt{x^2+y^2}.\] Find the number of polynomials $f(t)=A_0+A_1t+A_2t^2+A_3t^3+t^4$ such that $A_0,\ldots,A_3$ are integers and all roots of $f$ in the complex plane have absolute value $\leq 1$.
For a positive integer $p$, define the positive integer $n$ to be $p$-safe if $n$ differs in absolute value by more than $2$ from all multiples of $p$. For example, the set of $10$-safe numbers is $\{3, 4, 5, 6, 7, 13, 14, 15, 16, 17,23, \ldots \}$. Find the number of positive integers less than or equal to $10,000$ which are simultaneously $7$-safe, $11$-safe, and $13$-safe.·
Let $x=-2016$. What is the value of $\left| \ \bigl \lvert { \ \lvert x\rvert -x }\bigr\rvert -|x|{\frac{}{}}^{}_{}\right|-x$? $\textbf{(A)}\ -2016\qquad\textbf{(B)}\ 0\qquad\textbf{(C)}\ 2016\qquad\textbf{(D)}\ 4032\qquad\textbf{(E)}\ 6048$
Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$. [i]Victor Wang.[/i]
Let be a sequence of continuous functions $ \left( f_n \right)_{n\ge 1} :[0,1]\longrightarrow\mathbb{R} $ satisfying the following properties: $ \text{a) } $ for any natural $ n $ and $ x\in [1/n,1] ,$ it follows $ \left| f_n(x) \right|\leqslant 1/n. $ $ \text{b) } $ for any natural $ n, $ it follows $ \int_0^1 f_n^2(t)dt\leqslant 1. $ Then, $\lim_{n\to 0} \int_0^1\left| f_n(t) \right| dt=0 $ [i]Cristinel Mortici[/i]
When three different numbers from the set $ \{-3,-2,-1, 4, 5\} $ are multiplied, the largest possible product is $ \text{(A)}\ 10\qquad\text{(B)}\ 20\qquad\text{(C)}\ 30\qquad\text{(D)}\ 40\qquad\text{(E)}\ 60 $
Which of the following equations does NOT have a solution? $\textbf{ (A) }\:(x+7)^2=0$ $\textbf{(B) }\:|-3x|+5=0$ $\textbf{ (C) }\:\sqrt{-x}-2=0$ $\textbf{ (D) }\:\sqrt{x}-8=0$ $\textbf{ (E) }\:|-3x|-4=0 $
Consider the equation $ x^4 \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} 2007$, where $ a,b,c$ are real numbers. Determine the largest value of $ b$ for which this equation has exactly three distinct solutions, all of which are integers.
Answer the following questions: (1) Let $f(x)$ be a function such that $f''(x)$ is continuous and $f'(a)=f'(b)=0$ for some $a<b$. Prove that $f(b)-f(a)=\int_a^b \left(\frac{a+b}{2}-x\right)f''(x)dx$. (2) Consider the running a car on straight road. After a car which is at standstill at a traffic light started at time 0, it stopped again at the next traffic light apart a distance $L$ at time $T$. During the period, prove that there is an instant for which the absolute value of the acceleration of the car is more than or equal to $\frac{4L}{T^2}.$
Let $a, b, c$ be integers, not all zero and each of absolute value less than one million. Prove that \[\left\vert a+b\sqrt{2}+c\sqrt{3}\right\vert > \frac{1}{10^{21}}.\]
Suppose that $x$, $y$, $z$ are real numbers satisfying \[x+y+z=12,\qquad\text{and}\qquad x^2+y^2+z^2=54.\] Prove that:[list](a) Each of the numbers $xy$, $yz$, $zx$ is at least $9$, but at most $25$. (b) One of the numbers $x$, $y$, $z$ is at most $3$, and another one is at least $5$.[/list]
Let $A\subset \{x|0\le x<1\}$ with the following properties: 1. $A$ has at least 4 members. 2. For all pairwise different $a,b,c,d\in A$, $ab+cd\in A$ holds. Prove: $A$ has infinetly many members.
The absolute value of the sum of the elements of a real orthogonal matrix is at most the order of the matrix.
Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$. [i]Victor Wang.[/i]
A set $S$ of four distinct points is given in the plane. It is known that for any point $X\in S$ the remaining points can be denoted by $Y,Z$ and $W$ so that $|XY|=|XZ|+|XW|$ Prove that all four points lie on a line.
Which expression is equal to $\left | a-2-\sqrt{(a-1)^2} \right|$ for $a<0$? $\textbf{(A) } 3-2a \qquad \textbf{(B) } 1-a \qquad \textbf{(C) } 1 \qquad \textbf{(D) } a+1 \qquad \textbf{(E) } 3$
Number $ 0$ is written on the board. Two players alternate writing signs and numbers to the right, where the first player always writes either $ \plus{}$ or $ \minus{}$ sign, while the second player writes one of the numbers $ 1, 2, ... , 1993$,writing each of these numbers exactly once. The game ends after $ 1993$ moves. Then the second player wins the score equal to the absolute value of the expression obtained thereby on the board. What largest score can he always win?
How many complex numbers $z$ such that $\left| z \right| < 30$ satisfy the equation \[ e^z = \frac{z - 1}{z + 1} \, ? \]
Let $a, b, c$ be integers and let $p$ be an odd prime with \[p \not\vert a \;\; \text{and}\;\; p \not\vert b^{2}-4ac.\] Show that \[\sum_{k=1}^{p}\left( \frac{ak^{2}+bk+c}{p}\right) =-\left( \frac{a}{p}\right).\]
Determine the lowest positive integer n such that following statement is true: If polynomial with integer coefficients gets value 2 for n different integers, then it can't take value 4 for any integer.
Suppose $a$, $b$, and $c$ are nonzero real numbers, and $a+b+c=0$. What are the possible value(s) for $\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}+\frac{abc}{|abc|}$? $\textbf{(A) }0\qquad\textbf{(B) }1\text{ and }-1\qquad\textbf{(C) }2\text{ and }-2\qquad\textbf{(D) }0,2,\text{ and }-2\qquad\textbf{(E) }0,1,\text{ and }-1$
From a $n\times (n-1)$ rectangle divided into unit squares, we cut the [i]corner[/i], which consists of the first row and the first column. (that is, the corner has $2n-2$ unit squares). For the following, when we say [i]corner[/i] we reffer to the above definition, along with rotations and symmetry. Consider an infinite lattice of unit squares. We will color the squares with $k$ colors, such that for any corner, the squares in that corner are coloured differently (that means that there are no squares coloured with the same colour). Find out the minimum of $k$. [i]Proposed by S. Berlov[/i]