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

Suppose that $n$ is a positive integer number. Consider a regular polygon with $2n$ sides such that one of its largest diagonals is parallel to the $x$-axis. Find the smallest integer $d$ such that there is a polynomial $P$ of degree $d$ whose graph intersects all sides of the polygon on points other than vertices. Proposed by Mohammad Ahmadi
Prove that for all polynomials $P \in \mathbb{R}[x]$ and positive integers $n$, $P(x)-x$ divides $P^n(x)-x$ as polynomials.
Let $F$ be the set of all polynomials $\Gamma$ such that all the coefficients of $\Gamma (x)$ are integers and $\Gamma (x) = 1$ has integer roots. Given a positive intger $k$, find the smallest integer $m(k) > 1$ such that there exist $\Gamma \in F$ for which $\Gamma (x) = m(k)$ has exactly $k$ distinct integer roots.
For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.
Let $ \mathbb{Z}$ be the ring of rational integers. Construct an integral domain $ I$ satisfying the following conditions: a)$ \mathbb{Z} \varsubsetneqq I$; b) no element of $ I \minus{} \mathbb{Z}$ (only in $ I$) is algebraic over $ \mathbb{Z}$ (that is, not a root of a polynomial with coefficients in $ \mathbb{Z}$); c) $ I$ only has trivial endomorphisms. [i]E. Fried[/i]
Determine all the integers $a$ and $b$, such that $\sqrt{2010 + 2 \sqrt{2009}}$ be a solution of the equation $x^2 + ax + b = 0$. Prove that for such $a$ and $b$ the number$\sqrt{2010 - 2 \sqrt{2009}}$ is not a solution to the given equation.
Let $ f, g$ and $ a$ be polynomials with real coefficients, $ f$ and $ g$ in one variable and $ a$ in two variables. Suppose \[ f(x) \minus{} f(y) \equal{} a(x, y)(g(x) \minus{} g(y)) \forall x,y \in \mathbb{R}\] Prove that there exists a polynomial $ h$ with $ f(x) \equal{} h(g(x)) \text{ } \forall x \in \mathbb{R}.$
Compute the value of the expression \[ 2009^4 \minus{} 4 \times 2007^4 \plus{} 6 \times 2005^4 \minus{} 4 \times 2003^4 \plus{} 2001^4 \, .\]
Let $P(x) = x^3 + ax^2 + bx + 1$ be a polynomial with real coefficients and three real roots $\rho_1$, $\rho_2$, $\rho_3$ such that $|\rho_1| < |\rho_2| < |\rho_3|$. Let $A$ be the point where the graph of $P(x)$ intersects $yy'$ and the point $B(\rho_1, 0)$, $C(\rho_2, 0)$, $D(\rho_3, 0)$. If the circumcircle of $\vartriangle ABD$ intersects $yy'$ for a second time at $E$, find the minimum value of the length of the segment $EC$ and the polynomials for which this is attained. [i]Brazitikos Silouanos, Greece[/i]
Let $\, P(z) \,$ be a polynomial with complex coefficients which is of degree $\, 1992 \,$ and has distinct zeros. Prove that there exist complex numbers $\, a_1, a_2, \ldots, a_{1992} \,$ such that $\, P(z) \,$ divides the polynomial \[ \left( \cdots \left( (z-a_1)^2 - a_2 \right)^2 \cdots - a_{1991} \right)^2 - a_{1992}. \]
[b]p1.[/b] Let $a$ be an integer. How many fractions $\frac{a}{100}$ are greater than $\frac17$ and less than $\frac13$ ?. [b]p2.[/b] Justin Bieber invited Justin Timberlake and Justin Shan to eat sushi. There were $5$ different kinds of fish, $3$ different rice colors, and $11$ different sauces. Justin Shan insisted on a spicy sauce. If the probability of a sushi combination that pleased Justin Shan is $6/11$, then how many non-spicy sauces were there? [b]p3.[/b] A palindrome is any number that reads the same forward and backward (for example, $99$ and $50505$ are palindromes but $2020$ is not). Find the sum of all three-digit palindromes whose tens digit is $5$. [b]p4.[/b] Isaac is given an online quiz for his chemistry class in which he gets multiple tries. The quiz has $64$ multiple choice questions with $4$ choices each. For each of his previous attempts, the computer displays Isaac's answer to that question and whether it was correct or not. Given that Isaac is too lazy to actually read the questions, the maximum number of times he needs to attempt the quiz to guarantee a $100\%$ can be expressed as $2^{2^k}$. Find $k$. [b]p5.[/b] Consider a three-way Venn Diagram composed of three circles of radius $1$. The area of the entire Venn Diagram is of the form $\frac{a}{b}\pi +\sqrt{c}$ for positive integers $a$, $b$, $c$ where $a$, $b$ are relatively prime. Find $a+b+c$. (Each of the circles passes through the center of the other two circles) [b]p6.[/b] The sum of two four-digit numbers is $11044$. None of the digits are repeated and none of the digits are $0$s. Eight of the digits from $1-9$ are represented in these two numbers. Which one is not? [b]p7.[/b] Al wants to buy cookies. He can buy cookies in packs of $13$, $15$, or $17$. What is the maximum number of cookies he can not buy if he must buy a whole number of packs of each size? [b]p8.[/b] Let $\vartriangle ABC$ be a right triangle with base $AB = 2$ and hypotenuse $AC = 4$ and let $AD$ be a median of $\vartriangle ABC$. Now, let $BE$ be an altitude in $\vartriangle ABD$ and let $DF$ be an altitude in $\vartriangle ADC$. The quantity $(BE)^2 - (DF)^2$ can be expressed as a common fraction $\frac{a}{b}$ in lowest terms. Find $a + b$. [b]p9.[/b] Let $P(x)$ be a monic cubic polynomial with roots $r$, $s$, $t$, where $t$ is real. Suppose that $r + s + 2t = 8$, $2rs + rt + st = 12$ and $rst = 9$. Find $|P(2)|$. [b]p10.[/b] Let S be the set $\{1, 2,..., 21\}$. How many $11$-element subsets $T$ of $S$ are there such that there does not exist two distinct elements of $T$ such that one divides the other? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
[b]p1.[/b] Evaluate $1^2 - 2^2 + 3^2 - 4^2 + ...+ 19^2 - 20^2 + 21^2$. [b]p2.[/b] Kevin is playing in a table-tennis championship against Vincent. Kevin wins the championship if he wins two matches against Vincent, while Vincent must win three matches to win the championship. Given that both players have a $50\%$ chance of winning each match and there are no ties, the probability that Vincent loses the championship can be written in the form $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p3.[/b] For how many positive integers $n$ less than $2000$ is $n^{3n}$ a perfect fourth power? [b]p4.[/b] Given that a coin of radius $\sqrt{3}$ cm is tossed randomly onto a plane tiled by regular hexagons of side length $14$ cm, the chance that it lands strictly inside of a hexagon can be written in the form $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p5.[/b] Given that $A,C,E,I, P,$ and $M$ are distinct nonzero digits such that $$EPIC + EMCC + AMC = PEACE,$$ what is the least possible value of $PEACE$? [b]p6.[/b] A palindrome is a number that reads the same forwards and backwards. Call a number palindrome-ish if it is not a palindrome but we can make it a palindrome by changing one digit (we cannot change the first digit to zero). For instance, $4009$ is palindrome-ish because we can change the $4$ to a $9$. How many palindrome-ish four-digit numbers are there? [b]p7.[/b] Given that the heights of triangle $ABC$ have lengths $\frac{15}{7}$ , $5$, and $3$, what is the square of the area of $ABC$? [b]p8.[/b] Suppose that cubic polynomial $P(x)$ has leading coecient $1$ and three distinct real roots in the interval $[-20, 2]$. Given that the equation $P\left(x + \frac{1}{x} \right) = 0$ has exactly two distinct real solutions, the range of values that $P(3)$ can take is the open interval $(a, b)$. Compute $b - a$. [b]p9.[/b] Vincent the Bug has $17$ students in his class lined up in a row. Every day, starting on January $1$, $2021$, he performs the same series of swaps between adjacent students. One example of a series of swaps is: swap the $4$th and the $5$th students, then swap the $2$nd and the $3$rd, then the $3$rd and the $4$th. He repeats this series of swaps every day until the students are in the same arrangement as on January $1$. What is the greatest number of days this process could take? [b]p10.[/b] The summation $$\sum^{18}_{i=1}\frac{1}{i}$$ can be written in the form $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Compute the number of divisors of $b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all real numbers $ a,b,c,d$ such that \[ \left\{\begin{array}{cc}a \plus{} b \plus{} c \plus{} d \equal{} 20, \\ ab \plus{} ac \plus{} ad \plus{} bc \plus{} bd \plus{} cd \equal{} 150. \end{array} \right.\]
Let $ x_1,x_2,x_3$ be the roots of: $ x^3\minus{}6x^2\plus{}ax\plus{}a\equal{}0$. Find all real numbers $ a$ for which $ (x_1\minus{}1)^3\plus{}(x_2\minus{}1)^3\plus{}(x_3\minus{}1)^3\equal{}0$. Also, for each such $ a$, determine the corresponding values of $ x_1,x_2,$ and $ x_3$.
Let $m_{1},m_{2},...,m_{n}$ be mutually distinct integers. Prove that there exists a $f(x)\in\mathbb{Z}[x]$ of degree $n$ satisfying the following two conditions: a)$f(m_{i})=-1\forall i=1,2,...,n$. b)$f(x)$ is irreducible.
Let $n$ be a positive integer and let $k_0,k_1, \dots,k_{2n}$ be nonzero integers such that $k_0+k_1 +\dots+k_{2n}\neq 0$. Is it always possible to a permutation $(a_0,a_1,\dots,a_{2n})$ of $(k_0,k_1,\dots,k_{2n})$ so that the equation \begin{align*} a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_0=0 \end{align*} has not integer roots?
Let $ y_0$ be chosen randomly from $ \{0, 50\}$, let $ y_1$ be chosen randomly from $ \{40, 60, 80\}$, let $ y_2$ be chosen randomly from $ \{10, 40, 70, 80\}$, and let $ y_3$ be chosen randomly from $ \{10, 30, 40, 70, 90\}$. (In each choice, the possible outcomes are equally likely to occur.) Let $ P$ be the unique polynomial of degree less than or equal to $ 3$ such that $ P(0) \equal{} y_0$, $ P(1) \equal{} y_1$, $ P(2) \equal{} y_2$, and $ P(3) \equal{} y_3$. What is the expected value of $ P(4)$?
Let $ f(x)\equal{}a_{2n}x^{2n}\plus{}a_{2n\minus{}1}x^{2n\minus{}1}\plus{}\cdots\plus{}a_1x\plus{}a_0$, with $ a_i\equal{}a_{2n\minus{}1}$ for all $ i\equal{}1,2,\ldots,n$ and $ a_{2n}\ne0$. Prove that there exists a polynomial $ g(x)$ of degree $ n$ such that $ g\left(x\plus{}\frac1x\right)x^n\equal{}f(x)$.
The sequences $a_n$, $b_n$ and $c_n$ are defined recursively in the following way: $a_0 = 1/6$, $b_0 = 1/2$, $c_0 = 1/3,$ $$a_{n+1}= \frac{(a_n + b_n)(a_n + c_n)}{(a_n - b_n)(a_n - c_n)},\,\, b_{n+1}= \frac{(b_n + a_n)(b_n + c_n)}{(b_n - a_n)(b_n - c_n)},\,\, c_{n+1}= \frac{(c_n + a_n)(c_n + b_n)}{(c_n - a_n)(c_n - b_n)}$$ For each natural number $N$, the following polynomials are defined: $A_n(x) =a_o+a_1 x+ ...+ a_{2N}x^{2N}$ $B_n(x) =b_o+a_1 x+ ...+ a_{2N}x^{2N}$ $C_n(x) =a_o+a_1 x+ ...+ a_{2N}x^{2N}$ Assume the sequences are well defined. Show that there is no real $c$ such that $A_N(c) = B_N(c) = C_N(c) = 0$.
Let $ n>m>1$ be odd integers, let $ f(x)\equal{}x^n\plus{}x^m\plus{}x\plus{}1$. Prove that $ f(x)$ can't be expressed as the product of two polynomials having integer coefficients and positive degrees.
Find all reals $\lambda$ for which there is a nonzero polynomial $P$ with real coefficients such that $$\frac{P(1)+P(3)+P(5)+\ldots+P(2n-1)}n=\lambda P(n)$$for all positive integers $n$, and find all such polynomials for $\lambda=2$.
Consider polynomials $P$ of degree $2015$, all of whose coefficients are in the set $\{0,1,\dots,2010\}$. Call such a polynomial [i]good[/i] if for every integer $m$, one of the numbers $P(m)-20$, $P(m)-15$, $P(m)-1234$ is divisible by $2011$, and there exist integers $m_{20}, m_{15}, m_{1234}$ such that $P(m_{20})-20, P(m_{15})-15, P(m_{1234})-1234$ are all multiples of $2011$. Let $N$ be the number of good polynomials. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Yang Liu[/i]
Find all polynomials $P(x)$ with real coefficients such that for all pairwise distinct positive integers $x, y, z, t$ with $x^2 + y^2 + z^2 = 2t^2$ and $\gcd(x, y, z, t ) = 1,$ the following equality holds \[2P^2(t ) + 2P(xy + yz + zx) = P^2(x + y + z) .\] [b]Note.[/b] $P^2(k)=\left( P(k) \right)^2.$
Find all two-variable polynomials $p(x,y)$ such that for each $a,b,c\in\mathbb R$: \[p(ab,c^2+1)+p(bc,a^2+1)+p(ca,b^2+1)=0\]
Let $f_n$ be a polynomial with real coefficients for all $n \in \mathbb{Z}$. Suppose that \[f_n(k) = f_{n+k}(k) \quad n, k \in \mathbb{Z}.\] (a) Does $f_n = f_m$ necessarily hold for all $m,n \in \mathbb{Z}$? (b) If furthermore $f_n$ is a polynomial with integer coefficients for all $n \in\mathbb{Z}$, does $f_n = f_m$ necessarily hold for all $m, n \in\mathbb{Z}$? [i]Proposed by usjl[/i]