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

Form the infinite graph $A$ by taking the set of primes $p$ congruent to $1\pmod{4}$, and connecting $p$ and $q$ if they are quadratic residues modulo each other. Do the same for a graph $B$ with the primes $1\pmod{8}$. Show $A$ and $B$ are isomorphic to each other. [i]Linus Hamilton.[/i]
Let $ABCD$ be a quadrilateral with $\overline{AB}\parallel\overline{CD}$, $AB=16$, $CD=12$, and $BC<AD$. A circle with diameter $12$ is inside of $ABCD$ and tangent to all four sides. Find $BC$.
A triangular piece of paper of area $1$ is folded along a line parallel to one of the sides and pressed flat. What is the minimum possible area of the resulting figure?
Let $p$ be an odd prime of the form $p=4n+1$. [list=a][*] Show that $n$ is a quadratic residue $\pmod{p}$. [*] Calculate the value $n^{n}$ $\pmod{p}$. [/list]
While there do not exist pairwise distinct real numbers $a,b,c$ satisfying $a^2+b^2+c^2 = ab+bc+ca$, there do exist complex numbers with that property. Let $a,b,c$ be complex numbers such that $a^2+b^2+c^2 = ab+bc+ca$ and $|a+b+c| = 21$. Given that $|a-b| = 2\sqrt{3}$, $|a| = 3\sqrt{3}$, compute $|b|^2+|c|^2$. [hide="Clarifications"] [list] [*] The problem should read $|a+b+c| = 21$. An earlier version of the test read $|a+b+c| = 7$; that value is incorrect. [*] $|b|^2+|c|^2$ should be a positive integer, not a fraction; an earlier version of the test read ``... for relatively prime positive integers $m$ and $n$. Find $m+n$.''[/list][/hide] [i]Ray Li[/i]
Prove that if coefficients of the quadratic equation $ ax^2\plus{}bx\plus{}c\equal{}0$ are odd integers, then the roots of the equation cannot be rational numbers.
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]
Let a quadratic polynomial $g(x) = ax^2 + bx + c$ be given and an integer $n \ge 1$. Prove that there exists at most one polynomial $f(x)$ of $n$th degree such that $f(g(x)) = g(f(x)).$
One base of a trapezoid is 100 units longer than the other base. The segment that joins the midpoints of the legs divides the trapezoid into two regions whose areas are in the ratio $2: 3.$ Let $x$ be the length of the segment joining the legs of the trapezoid that is parallel to the bases and that divides the trapezoid into two regions of equal area. Find the greatest integer that does not exceed $x^2/100.$
Find all non-negative integers $ m$ and $ n$ that satisfy the equation: \[ 107^{56}(m^2\minus{}1)\minus{}2m\plus{}5\equal{}3\binom{113^{114}}{n}\] (If $ n$ and $ r$ are non-negative integers satisfying $ r\le n$, then $ \binom{n}{r}\equal{}\frac{n}{r!(n\minus{}r)!}$ and $ \binom{n}{r}\equal{}0$ if $ r>n$.)
Two players $A$ and $B$ play the following game taking alternate moves. In each move, a player writes one digit on the blackboard. Each new digit is written either to the right or left of the sequence of digits already written on the blackboard. Suppose that $A$ begins the game and initially the blackboard was empty. $B$ wins the game if ,after some move of $B$, the sequence of digits written in the blackboard represents a perfect square. Prove that $A$ can prevent $B$ from winning.
Positive integers $k, m, n$ satisfy $mn=k^2+k+3$, prove that at least one of the equations $x^2+11y^2=4m$ and $x^2+11y^2=4n$ has an odd solution.
Let $N=10^6$. For which integer $a$ with $0 \leq a \leq N-1$ is the value of \[\binom{N}{a+1}-\binom{N}{a}\] maximized? [i]Proposed by Lewis Chen[/i]
$n$ teams take part in a tournament, in which every two teams compete exactly once, and that no draws are possible. It is known that for any two teams, there exists another team which defeated both of the two teams. Find all $n$ for which this is possible.
Let $f(x)$ be a quadratic polynomial such that $f(f(1)) = f(-f(-1)) = 0$ and $f(1) \neq -f(-1)$. Suppose furthermore that the quadratic $2f(x)$ has coefficients that are nonzero integers. Find $f(0)$. [i]Proposed by Andrew Wu[/i]
Let $a, b, c$ be reals such that some two of them have difference greater than $\frac{1}{2 \sqrt{2}}$. Prove that there exists an integer $x$, such that $$x^2-4(a+b+c)x+12(ab+bc+ca)<0.$$
Find $\displaystyle n \in \mathbb N$, $\displaystyle n \geq 2$, and the digits $\displaystyle a_1,a_2,\ldots,a_n$ such that \[ \displaystyle \sqrt{\overline{a_1 a_2 \ldots a_n}} - \sqrt{\overline{a_1 a_2 \ldots a_{n-1}}} = a_n . \]
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 $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$, then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$.[i](IMO Problem 6)[/i] [b][i]Original Formulation[/i][/b] Let $f(x) = x^2 + x + p$, $p \in \mathbb N.$ Prove that if the numbers $f(0), f(1), \cdots , f( \sqrt{p\over 3} )$ are primes, then all the numbers $f(0), f(1), \cdots , f(p - 2)$ are primes. [i]Proposed by Soviet Union. [/i]
If $a@b=\dfrac{a^3-b^3}{a-b}$, for how many real values of $a$ does $a@1=0$?
A quadratic polynomial $p(x)$ with integer coefficients satisfies $p(41) = 42$. For some integers $a, b > 41$, $p(a) = 13$ and $p(b) = 73$. Compute the value of $p(1)$. [i]Proposed by Aaron Lin[/i]
Two men set out at the same time to walk towards each other from $ M$ and $ N$, $ 72$ miles apart. The first man walks at the rate of $ 4$ mph. The second man walks $ 2$ miles the first hour, $ 2\frac {1}{2}$ miles the second hour, $ 3$ miles the third hour, and so on in arithmetic progression. Then the men will meet: $ \textbf{(A)}\ \text{in 7 hours} \qquad \textbf{(B)}\ \text{in }{8\frac {1}{4}}\text{ hours}\qquad \textbf{(C)}\ \text{nearer }{M}\text{ than }{N}\qquad \\ \textbf{(D)}\ \text{nearer }{N}\text{ than }{M}\qquad \textbf{(E)}\ \text{midway between }{M}\text{ and }{N}$
Jenny and Kenny are walking in the same direction, Kenny at 3 feet per second and Jenny at 1 foot per second, on parallel paths that are 200 feet apart. A tall circular building 100 feet in diameter is centered midway between the paths. At the instant when the building first blocks the line of sight between Jenny and Kenny, they are 200 feet apart. Let $t$ be the amount of time, in seconds, before Jenny and Kenny can see each other again. If $t$ is written as a fraction in lowest terms, what is the sum of the numerator and denominator?
Given that $x^2 + y^2 = 14x + 6y + 6$, what is the largest possible value that $3x + 4y$ can have? $\text{(A)}\ 72 \qquad \text{(B)}\ 73 \qquad \text{(C)}\ 74 \qquad \text{(D)}\ 75\qquad \text{(E)}\ 76$
Find all pairs of coprime natural numbers $a$ and $b$ such that the fraction $\frac{a}{b}$ is written in the decimal system as $b.a.$