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

A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]
Let $k,n$ and $r$ be positive integers. (a) Let $Q(x)=x^k+a_1x^{k+1}+\cdots+a_nx^{k+n}$ be a polynomial with real coefficients. Show that the function $\frac{Q(x)}{x^k}$ is strictly positive for all real $x$ satisfying $$0<|x|<\frac1{1+\sum\limits_{i=1}^n |a_i|}$$ (b) Let $P(x)=b_0+b_1x+\cdots+b_rx^r$ be a non zero polynomial with real coefficients. Let $m$ be the smallest number such that $b_m \neq 0$. Prove that the graph of $y=P(x)$ cuts the $x$-axis at the origin (i.e., $P$ changes signs at $x=0$) if and only if $m$ is an odd integer.
Determine all monic polynomial with integer coefficient $P$ such that for every integer $a,b$ there exists integer $c$ so that \[P(a)P(b)=P(c)\]
[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u]Set 3[/u] [b]P3.11[/b] Find all possible values of $c$ in the following system of equations: $$a^2 + ab + c^2 = 31$$ $$b^2 + ab - c^2 = 18$$ $$a^2 - b^2 = 7$$ [b]P3.12 / R5.25[/b] In square $ABCD$ with side length $13$, point $E$ lies on segment $CD$. Segment $AE$ divides $ABCD$ into triangle $ADE$ and quadrilateral $ABCE$. If the ratio of the area of $ADE$ to the area of $ABCE$ is $4 : 11$, what is the ratio of the perimeter of $ADE$ to the perimeter of$ ABCE$? [b]P3.13[/b] Thomas has two distinct chocolate bars. One of them is $1$ by $5$ and the other one is $1$ by $3$. If he can only eat a single $1$ by $1$ piece off of either the leftmost side or the rightmost side of either bar at a time, how many different ways can he eat the two bars? [b]P3.14[/b] In triangle $ABC$, $AB = 13$, $BC = 14$, and $CA = 15$. The entire triangle is revolved about side $BC$. What is the volume of the swept out region? [b]P3.15[/b] Find the number of ordered pairs of positive integers $(a, b)$ that satisfy the equation $a(a -1) + 2ab + b(b - 1) = 600$. [u]Set 4[/u] [b]P4.16[/b] Compute the sum of the digits of $(10^{2017} - 1)^2$ . [b]P4.17[/b] A right triangle with area $210$ is inscribed within a semicircle, with its hypotenuse coinciding with the diameter of the semicircle. $2$ semicircles are constructed (facing outwards) with the legs of the triangle as their diameters. What is the area inside the $2$ semicircles but outside the first semicircle? [b]P4.18[/b] Find the smallest positive integer $n$ such that exactly $\frac{1}{10}$ of its positive divisors are perfect squares. [b]P4.19[/b] One day, Sambuddha and Jamie decide to have a tower building competition using oranges of radius $1$ inch. Each player begins with $14$ oranges. Jamie builds his tower by making a $3$ by $3$ base, placing a $2$ by $2$ square on top, and placing the last orange at the very top. However, Sambuddha is very hungry and eats $4$ of his oranges. With his remaining $10$ oranges, he builds a similar tower, forming an equilateral triangle with $3$ oranges on each side, placing another equilateral triangle with $2$ oranges on each side on top, and placing the last orange at the very top. What is the positive difference between the heights of these two towers? [b]P4.20[/b] Let $r, s$, and $t$ be the roots of the polynomial $x^3 - 9x + 42$. Compute the value of $(rs)^3 + (st)^3 + (tr)^3$. [u]Set 5[/u] [b]P5.21[/b] For all integers $k > 1$, $\sum_{n=0}^{\infty}k^{-n} =\frac{k}{k -1}$. There exists a sequence of integers $j_0, j_1, ...$ such that $\sum_{n=0}^{\infty}j_n k^{-n} =\left(\frac{k}{k -1}\right)^3$ for all integers $k > 1$. Find $j_{10}$. [b]P5.22[/b] Nimi is a triangle with vertices located at $(-1, 6)$, $(6, 3)$, and $(7, 9)$. His center of mass is tied to his owner, who is asleep at $(0, 0)$, using a rod. Nimi is capable of spinning around his center of mass and revolving about his owner. What is the maximum area that Nimi can sweep through? [b]P5.23[/b] The polynomial $x^{19} - x - 2$ has $19$ distinct roots. Let these roots be $a_1, a_2, ..., a_{19}$. Find $a^{37}_1 + a^{37}_2+...+a^{37}_{19}$. [b]P5.24[/b] I start with a positive integer $n$. Every turn, if $n$ is even, I replace $n$ with $\frac{n}{2}$, otherwise I replace $n$ with $n-1$. Let $k$ be the most turns required for a number $n < 500$ to be reduced to $1$. How many values of $n < 500$ require k turns to be reduced to $1$? [b]P5.25[/b] In triangle $ABC$, $AB = 13$, $BC = 14$, and $AC = 15$. Let $I$ and $O$ be the incircle and circumcircle of $ABC$, respectively. The altitude from $A$ intersects $I$ at points $P$ and $Q$, and $O$ at point $R$, such that $Q$ lies between $P$ and $R$. Find $PR$. PS. You should use hide for answers. R1-15 /P1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2786721p24495629]here[/url], and R16-30 /P6-10/ P26-30 [url=https://artofproblemsolving.com/community/c3h2786837p24497019]here[/url] Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all polynomials $f$ with integer coefficient such that, for every prime $p$ and natural numbers $u$ and $v$ with the condition: \[ p \mid uv - 1 \] we always have $p \mid f(u)f(v) - 1$.
Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients.
(a) A polynomial $P(x)$ with integer coefficients takes the value $-2$ for at least seven distinct integers $x$. Prove that it cannot take the value $1996$. (b) Prove that there are irrational numbers $x,y$ such that $x^y$ is rational.
Find all natural numbers $n \ge 1$ such that there is a polynomial $p(x)$ with integer coefficients for which $p (1) = p (2) = 0$ and where $p (n)$ is a prime number .
For each prime $p$ of the form $4k+3$ with $k \in \mathbb{Z}^+$, consider the polynomial $$Q(x)=px^{2p} - x^{2p-1} + p^2x^{\frac{3p+1}{2}} - px^{p+1} +2(p^2+1)x^p -px^{p-1}+ p^2 x^{\frac{p-1}{2}} -x + p.$$ Determine all ordered pairs of polynomials $f, g$ with integer coefficients such that $Q(x)=f(x)g(x)$.
$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are  given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree  $\le n$ that satisfies the following conditions? a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $ b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $ [i]Proposed by Mojtaba Zare[/i]
P(x) is polynomial such that, polynomial P(P(x)) is strictly monotone in all real number line. Prove that polynomial P(x) is also strictly monotone in all real number line.
$f$ is a polynomial of degree $n$ with integer coefficients and $f(x)=x^2+1$ for $x=1,2,\cdot ,n$. What are the possible values for $f(0)$?
[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
When all vertex angles of a convex polygon are equal, call it equiangular. Prove that $ p > 2$ is a prime number, if and only if the lengths of all sides of equiangular $ p$ polygon are rational numbers, it is a regular $ p$ polygon.
Complex numbers $a$, $b$ and $c$ are the zeros of a polynomial $P(z) = z^3+qz+r$, and $|a|^2+|b|^2+|c|^2=250$. The points corresponding to $a$, $b$, and $c$ in the complex plane are the vertices of a right triangle with hypotenuse $h$. Find $h^2$.
Suppose $0<m_1<...<m_n$ and $m_i \equiv i (\mod 2)$. Prove that the following polynomial has at most $n$ real roots. ($\forall 1\le i \le n: a_i \in \mathbb R$). \[a_0+a_1x^{m_1}+a_2x^{m_2}+...+a_nx^{m_n}.\]
The quartic (4th-degree) polynomial P(x) satisfies $P(1)=0$ and attains its maximum value of $3$ at both $x=2$ and $x=3$. Compute $P(5)$.
A polynomial $p(x) = \sum_{j=1}^{2n-1} a_j x^j$ with real coefficients is called [i]mountainous[/i] if $n \ge 2$ and there exists a real number such that the polynomial's coefficients satisfy $a_1=1, a_{j+1}-a_j=k$ for $1 \le j \le n-1,$ and $a_{j+1}-a_j=-k$ for $n \le j \le 2n-2;$ we call $k$ the [i]step size[/i] of $p(x).$ A real number $k$ is called [i]good[/i] if there exists a mountainous polynomial $p(x)$ with step size $k$ such that $p(-3)=0.$ Let $S$ be the sum of all good numbers $k$ satisfying $k \ge 5$ or $k \le 3.$ If $S=\tfrac{b}{c}$ for relatively prime positive integers $b,c,$ find $b+c.$
The real numbers $x_1,x_2,..., x_n$ and $a_0,a_1,...,a_{n-1}$ with $x_i \ne 0$ for $i \in\{1,2,.., n\}$ are such that $$(x-x_1)(x-x_2)...(x-x_n)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0$$ Express $x_1^{-2}+x_2^{-2}+...+ x_n^{-2}$ in terms of $a_0,a_1,...,a_{n-1}$.
Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have : $$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$ Who has the winning strategy. Proposed by [i]Alireza Haghi[/i]
Let $P(x)$ be a polynomial of degree $2012$ with real coefficients satisfying the condition \[P(a)^3 + P(b)^3 + P(c)^3 \geq 3P(a)P(b)P(c),\] for all real numbers $a,b,c$ such that $a+b+c=0$. Is it possible for $P(x)$ to have exactly $2012$ distinct real roots?
Find all real numbers $c$ for which there exists a nonconstant two-variable polynomial $P(x, y)$ with real coefficients satisfying \[[P(x, y)]^2 = P(cxy, x^2 + y^2)\] for all real $x$ and $y$. [i]Nikolai Beluhov and Konstantin Garov[/i]
Find all functions $ f\colon \mathbb{R} \to \mathbb{R} $ such that $ f(x^3+y^3+xy)=x^2f(x)+y^2f(y)+f(xy) $, for all $ x,y \in \mathbb{R} $.
[b]p1.[/b] How many subsets of $\{D,U,K,E\}$ have an odd number of elements? [b]p2.[/b] Find the coefficient of $x^{12}$ in $(1 + x^2 + x^4 +... + x^{28})(1 + x + x^2 + ...+ x^{14})^2$. [b]p3.[/b] How many $4$-digit numbers have their digits in non-decreasing order from left to right? [b]p4.[/b] A dodecahedron (a polyhedron with $12$ faces, each a regular pentagon) is projected orthogonally onto a plane parallel to one of its faces to form a polygon. Find the measure (in degrees) of the largest interior angle of this polygon. [b]p5.[/b] Justin is back with a $6\times 6$ grid made of $36$ colorless squares. Dr. Kraines wants him to color some squares such that $\bullet$ Each row and column of the grid must have at least one colored square $\bullet$ For each colored square, there must be another colored square on the same row or column What is the minimum number of squares that Justin will have to color? [b]p6.[/b] Inside a circle $C$, we have three equal circles $C_1$, $C_2$, $C_3$, which are pairwise externally tangent to each other and all internally tangent to $C$. What is the ratio of the area of $C_1$ to the area of $C$? [b]p7.[/b] There are $3$ different paths between the Duke Chapel and the Physics building. $6$ students are heading towards the Physics building for a class, so they split into $3$ pairs and each pair takes a separate path from the Chapel. After class, they again split into $3$ pairs and take separate paths back. Find the number of possible scenarios where each student's companion on the way there is different from their companion on the way back. [b]p8.[/b] Let $a_n$ be a sequence that satisfies the recurrence relation $$a_na_{n+2} =\frac{\cos (3a_{n+1})}{\cos (a_{n+1})[2 \cos(2a_{n+1}) - 1]}a_{n+1}$$ with $a_1 = 2$ and $a_2 = 3$. Find the value of $2018a_{2017}$. [b]p9.[/b] Let $f(x)$ be a polynomial with minimum degree, integer coefficients, and leading coefficient of $1$ that satisfies $f(\sqrt7 +\sqrt{13})= 0$. What is the value of $f(10)$? [b]p10.[/b] $1024$ Duke students, indexed $1$ to $1024$, are having a chat. For each $1 \le i \le 1023$, student $i$ claims that student $2^{\lfloor \log_2 i\rfloor +1}$ has a girlfriend. ($\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) Given that exactly $201$ people are lying, find the index of the $61$st liar (ordered by index from smallest to largest). PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $ x,y,z$ be positive real numbers, show that $ \frac {xy}{z} \plus{} \frac {yz}{x} \plus{} \frac {zx}{y} > 2\sqrt [3]{x^3 \plus{} y^3 \plus{} z^3}.$