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

What is the sum of the solutions to the equation $\sqrt[4]x =\displaystyle \frac{12}{7-\sqrt[4]x}$?
Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square). [i]Evan O'Dorney and Victor Wang[/i]
Find the sum of all $\left\lfloor x\right\rfloor$ such that $x^2-15\left\lfloor x\right\rfloor+36=0$. $\text{(A) }15\qquad\text{(B) }26\qquad\text{(C) }45\qquad\text{(D) }49\qquad\text{(E) }75$
We denote the number of positive divisors of a positive integer $m$ by $d(m)$ and the number of distinct prime divisors of $m$ by $\omega(m)$. Let $k$ be a positive integer. Prove that there exist infinitely many positive integers $n$ such that $\omega(n) = k$ and $d(n)$ does not divide $d(a^2+b^2)$ for any positive integers $a, b$ satisfying $a + b = n$.
Let $ a,b,c$ be positive real numbers such that $ a^3 \plus{} b^3 \equal{} c^3$.Prove that: $ a^2 \plus{} b^2 \minus{} c^2 > 6(c \minus{} a)(c \minus{} b)$.
Let $g(n)$ be defined as follows: \[ g(1) = 0, g(2) = 1 \] and \[ g(n+2) = g(n) + g(n+1) + 1, n \geq 1. \] Prove that if $n > 5$ is a prime, then $n$ divides $g(n) \cdot (g(n) + 1).$
Let $p$ be a prime such that $p \equiv 1 (\text {mod}4)$. Evaluate \[\sum_{k=1}^{p-1} \left( \left \lfloor \frac{2k^2}{p}\right \rfloor - 2 \left \lfloor {\frac{k^2}{p}}\right \rfloor \right)\]
Find the largest real number $x$ such that \[\left(\dfrac{x}{x-1}\right)^2+\left(\dfrac{x}{x+1}\right)^2=\dfrac{325}{144}.\]
Find all the pairs of positive numbers such that the last digit of their sum is 3, their difference is a primer number and their product is a perfect square.
Let $P(x)=x^2-3x-9$. A real number $x$ is chosen at random from the interval $5\leq x \leq 15$. The probability that $\lfloor \sqrt{P(x)} \rfloor = \sqrt{P(\lfloor x \rfloor )}$ is equal to $\dfrac{\sqrt{a}+\sqrt{b}+\sqrt{c}-d}{e}$, where $a,b,c,d$ and $e$ are positive integers and none of $a,b,$ or $c$ is divisible by the square of a prime. Find $a+b+c+d+e$.
a) Prove that the values of $x$ for which $x=(x^2+1)/198$ lie between $1/198$ and $197.99494949\cdots$. b) Use the result of problem a) to prove that $\sqrt{2}<1.41\overline{421356}$. c) Is it true that $\sqrt{2}<1.41421356$?
Let $a,b,c$ be real numbers. Consider the quadratic equation in $\cos{x}$ \[ a \cos^2{x}+b \cos{x}+c=0. \] Using the numbers $a,b,c$ form a quadratic equation in $\cos{2x}$ whose roots are the same as those of the original equation. Compare the equation in $\cos{x}$ and $\cos{2x}$ for $a=4$, $b=2$, $c=-1$.
Find the real solution(s) to the equation $ (x \plus{} y)^2 \equal{} (x \plus{} 1)(y \minus{} 1)$.
For all integers $n\geq 1$ we define $x_{n+1}=x_1^2+x_2^2+\cdots +x_n^2$, where $x_1$ is a positive integer. Find the least $x_1$ such that 2006 divides $x_{2006}$.
Let $n$ be a positive integer. Prove that the number $2^n + 1$ has no prime divisor of the form $8 \cdot k - 1$, where $k$ is a positive integer.
Coordinate axes (without any marks, with the same scale) and the graph of a quadratic trinomial $y = x^2 + ax + b$ are drawn in the plane. The numbers $a$ and $b$ are not known. How to draw a unit segment using only ruler and compass?
Let $b$ be a real number randomly sepected from the interval $[-17,17]$. Then, $m$ and $n$ are two relatively prime positive integers such that $m/n$ is the probability that the equation \[x^4+25b^2=(4b^2-10b)x^2\] has $\textit{at least}$ two distinct real solutions. Find the value of $m+n$.
If the line $y=mx+1$ intersects the ellipse $x^2+4y^2=1$ exactly once, then the value of $m^2$ is $\textbf{(A) }\textstyle\frac{1}{2}\qquad\textbf{(B) }\frac{2}{3}\qquad\textbf{(C) }\frac{3}{4}\qquad\textbf{(D) }\frac{4}{5}\qquad \textbf{(E) }\frac{5}{6}$
A sequence of three real numbers forms an arithmetic progression with a first term of $ 9$. If $ 2$ is added to the second term and $ 20$ is added to the third term, the three resulting numbers form a geometric progression. What is the smallest possible value for the third term of the geometric progression? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 4\qquad \textbf{(C)}\ 36\qquad \textbf{(D)}\ 49\qquad \textbf{(E)}\ 81$
Let $ f(x) \equal{} x \minus{} \frac {1}{x}.$ How many different solutions are there to the equation $ f(f(f(x))) \equal{} 1$? A. 1 B. 2 C. 3 D. 6 E. 8
Suppose that $ a$ and $ b$ are real numbers such that the quadratic polynomial $ f(x)\equal{}x^2\plus{}ax\plus{}b$ has no nonnegative real roots. Prove that there exist two polynomials $ g,h$ whose coefficients are nonnegative real numbers such that: $ f(x)\equal{}\frac{g(x)}{h(x)}$ for all real numbers $ x$.
Find the least real number $k$ with the following property: if the real numbers $x$, $y$, and $z$ are not all positive, then \[k(x^{2}-x+1)(y^{2}-y+1)(z^{2}-z+1)\geq (xyz)^{2}-xyz+1.\]
Ana and Banana play a game. First, Ana picks a real number $p$ with $0 \le p \le 1$. Then, Banana picks an integer $h$ greater than $1$ and creates a spaceship with $h$ hit points. Now every minute, Ana decreases the spaceship's hit points by $2$ with probability $1-p$, and by $3$ with probability $p$. Ana wins if and only if the number of hit points is reduced to exactly $0$ at some point (in particular, if the spaceship has a negative number of hit points at any time then Ana loses). Given that Ana and Banana select $p$ and $h$ optimally, compute the integer closest to $1000p$. [i]Proposed by Lewis Chen[/i]
Let $A_1A_2A_3A_4$ be a non-cyclic quadrilateral. Let $O_1$ and $r_1$ be the circumcentre and the circumradius of the triangle $A_2A_3A_4$. Define $O_2,O_3,O_4$ and $r_2,r_3,r_4$ in a similar way. Prove that \[\frac{1}{O_1A_1^2-r_1^2}+\frac{1}{O_2A_2^2-r_2^2}+\frac{1}{O_3A_3^2-r_3^2}+\frac{1}{O_4A_4^2-r_4^2}=0.\] [i]Proposed by Alexey Gladkich, Israel[/i]