Found problems: 1148
Find all primes $p$ such that $p^2-p+1$ is a perfect cube.
For how many values of the coefficient $a$ do the equations \begin{align*}x^2+ax+1=0 \\ x^2-x-a=0\end{align*} have a common real solution?
$\textbf{(A)}\ 0 \qquad
\textbf{(B)}\ 1 \qquad
\textbf{(C)}\ 2 \qquad
\textbf{(D)}\ 3 \qquad
\textbf{(E)}\ \text{infinitely many}$
Let $ m$ and $ n$ be positive integers such that $ x^2 \minus{} mx \plus{}n \equal{} 0$ has real roots $ \alpha$ and $ \beta$.
Prove that $ \alpha$ and $ \beta$ are integers [b]if and only if[/b] $ [m\alpha] \plus{} [m\beta]$ is the square of an integer.
(Here $ [x]$ denotes the largest integer not exceeding $ x$)
Let $S$ be the set of positive real numbers. Find all functions $f\colon S^3 \to S$ such that, for all positive real numbers $x$, $y$, $z$ and $k$, the following three conditions are satisfied:
(a) $xf(x,y,z) = zf(z,y,x)$,
(b) $f(x, ky, k^2z) = kf(x,y,z)$,
(c) $f(1, k, k+1) = k+1$.
([i]United Kingdom[/i])
If $ c$ is a positive integer and $ p$ is an odd prime, what is the smallest residue (in absolute value) of \[ \sum_{n=0}^{\frac{p-1}{2}} \binom{2n}{n}c^n \;(\textrm{mod}\;p\ ) \ ?\]
J. Suranyi
Solve in integers the following equation:
\[y=2x^2+5xy+3y^2\]
For any quadratic functions $ f(x)$ such that $ f'(2)\equal{}1$, evaluate $ \int_{2\minus{}\pi}^{2\plus{}\pi}f(x)\sin\left(\frac{x}{2}\minus{}1\right) dx$.
In a quadratic table with $ 2007$ rows and $ 2007$ columns is an odd number written in each field.
For $ 1\leq i\leq2007$ is $ Z_i$ the sum of the numbers in the $ i$-th row and for $ 1\leq j\leq2007$ is $ S_j$ the sum of the numbers in the $ j$-th column.
$ A$ is the product of all $ Z_i$ and $ B$ the product of all $ S_j$.
Show that $ A\plus{}B\neq0$
Lines tangent to circle $O$ in points $A$ and $B$, intersect in point $P$. Point $Z$ is the center of $O$. On the minor arc $AB$, point $C$ is chosen not on the midpoint of the arc. Lines $AC$ and $PB$ intersect at point $D$. Lines $BC$ and $AP$ intersect at point $E$. Prove that the circumcentres of triangles $ACE$, $BCD$, and $PCZ$ are collinear.
Determine all functions $f:\mathbb R\rightarrow\mathbb R$ satisfying the condition
\[f(y^2+2xf(y)+f(x)^2)=(y+f(x))(x+f(y))\]
for all real numbers $x$ and $y$.
Call admissible a set $A$ of integers that has the following property:
If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$.
Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers.
[i]Proposed by Warut Suksompong, Thailand[/i]
If $x \neq 0$, $\frac x{2} = y^2$ and $\frac{x}{4} = 4y$, then $x$ equals
$ \textbf{(A)}\ 8\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 32\qquad\textbf{(D)}\ 64\qquad\textbf{(E)}\ 128 $
Three quadratic polynomials $f_1(x) = x^2+2a_1x+b_1$, $f_2(x) = x^2+2a_2x+b_2$,
$f_3(x) = x^2 + 2a_3x + b_3$ are such that $a_1a_2a_3 = b_1b_2b_3 > 1$. Prove that at
least one polynomial has two distinct roots.
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
On a Cartesian plane, $n$ parabolas are drawn, all of which are graphs of quadratic trinomials. No two of them are tangent. They divide the plane into many areas, one of which is above all the parabolas. Prove that the border of this area has no more than $2(n-1)$ corners (i.e. the intersections of a pair of parabolas).
Determine all pairs of natural numbers $(x; n)$ that satisfy the equation
\[x^{3}+2x+1 = 2^{n}.\]
If $x$ is a real and $4y^2+4xy+x+6=0$, then the complete set of values of $x$ for which $y$ is real, is:
$\text{(A)} \ x\le -2~\text{or}~x\ge3 \qquad \text{(B)} \ x\le 2~\text{or}~x\ge3 \qquad \text{(C)} \ x\le -3 ~\text{or}~x\ge 2$
$\text{(D)} \ -3\le x \le 2\qquad \text{(E)} \ \-2\le x \le 3$
On a board, there are $n$ equations in the form $*x^2+*x+*$. Two people play a game where they take turns. During a turn, you are aloud to change a star into a number not equal to zero. After $3n$ moves, there will be $n$ quadratic equations. The first player is trying to make more of the equations not have real roots, while the second player is trying to do the opposite. What is the maximum number of equations that the first player can create without real roots no matter how the second player acts?
Let $f(x)=x^2-ax+b$, where $a$ and $b$ are positive integers.
(a) Suppose that $a=2$ and $b=2$. Determine the set of real roots of $f(x)-x$, and the set of real roots of $f(f(x))-x$.
(b) Determine the number of positive integers $(a,b)$ with $1\le a,b\le 2011$ for which every root of $f(f(x))-x$ is an integer.
For each rational number $r$ consider the statement: If $x$ is a real number such that $x^2-rx$ and $x^3-rx$ are both rational, then $x$ is also rational.
[list](a) Prove the claim for $r \ge \frac43$ and $r \le 0$.
(b) Let $p,q$ be different odd primes such that $3p <4q$. Prove that the claim for $r=\frac{p}q$ does not hold.
[/list]
Given a non-isoceles triangle $ABC$ inscribes a circle $(O,R)$ (center $O$, radius $R$). Consider a varying line $l$ such that $l\perp OA$ and $l$ always intersects the rays $AB,AC$ and these intersectional points are called $M,N$. Suppose that the lines $BN$ and $CM$ intersect, and if the intersectional point is called $K$ then the lines $AK$ and $BC$ intersect.
$1$, Assume that $P$ is the intersectional point of $AK$ and $BC$. Show that the circumcircle of the triangle $MNP$ is always through a fixed point.
$2$, Assume that $H$ is the orthocentre of the triangle $AMN$. Denote $BC=a$, and $d$ is the distance between $A$ and the line $HK$. Prove that $d\leq\sqrt{4R^2-a^2}$ and the equality occurs iff the line $l$ is through the intersectional point of two lines $AO$ and $BC$.
If $p$ is a prime and both roots of $x^2+px-444p=0$ are integers, then
$ \textbf{(A)}\ 1<p\le 11 \qquad\textbf{(B)}\ 11<p \le 21 \qquad\textbf{(C)}\ 21< p \le 31 \\ \qquad\textbf{(D)}\ 31< p \le 41 \qquad\textbf{(E)}\ 41< p \le 51 $
Find all triples $ \left(p,x,y\right)$ such that $ p^x\equal{}y^4\plus{}4$, where $ p$ is a prime and $ x$ and $ y$ are natural numbers.
Alice and Bob play a game. Alice writes an equation of the form $ax^2 + bx + c =0$, choosing $a$, $b$, $c$ to be real numbers (possibly zero). Bob can choose to add (or subtract) any real number to each of $a$, $b$, $c$, resulting in a new equation. Bob wins if the resulting equation is quadratic and has two distinct real roots; Alice wins otherwise. For which choices of $a$, $b$, $c$ does Alice win, no matter what Bob does?
The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Find the maximum number of members this band can have.