Found problems: 85335
Find all prime numbers $p$ for which $p^3-4p+9$ is a perfect square.
For which positive integers $n \ge 4$ one can find n points in the plane, no three collinear, such that for each triangle formed with three of the $n$ points which are on the convex hull, exactly one of the $n - 3$ remaining points belongs to its interior.
Given a sequence $(x_1,x_2,\ldots, x_n)$ of 0's and 1's, let $A$ be the number of triples $(x_i,x_j,x_k)$ with $i<j<k$ such that $(x_i,x_j,x_k)$ equals $(0,1,0)$ or $(1,0,1)$. For $1\leq i \leq n$, let $d_i$ denote the number of $j$ for which either $j < i$ and $x_j = x_i$ or else $j > i$ and $x_j\neq x_i$.
(a) Prove that \[A = \binom n3 - \sum_{i=1}^n\binom{d_i}2.\] (Of course, $\textstyle\binom ab = \tfrac{a!}{b!(a-b)!}$.) [5 points]
(b) Given an odd number $n$, what is the maximum possible value of $A$? [15 points]
A group of $n{}$ $(n>1)$ people each visited $k{}$ $(k>1)$ citites. Each person makes a list of these $k$ cities in the order they want to visit them. A permutation $(a_1,a_2,\ldots,a_k)$ is called $m-prefered$ $(m\in\mathbb{N})$, if for every $i=1,2,\ldots,k$ there are at least $m$ people that would prefer to visit the city $a_i$ before the city $a_{i+1}$, $(a_{k+1}=a_1)$. Prove that there exists an m-prefered permutation if and only if $km\leq n(k-1)$.
Twelve friends met for dinner at Oscar's Overstuffed Oyster House, and each ordered one meal. The portions were so large, there was enough food for $18$ people. If they share, how many meals should they have ordered to have just enough food for the $12$ of them?
$\textbf{(A)}\ 8\qquad
\textbf{(B)}\ 9 \qquad
\textbf{(C)}\ 10\qquad
\textbf{(D)}\ 15\qquad
\textbf{(E)}\ 18$
A thin piece of wood of uniform density in the shape of an equilateral triangle with side length $3$ inches weighs $12$ ounces. A second piece of the same type of wood, with the same thickness, also in the shape of an equilateral triangle, has side length of $5$ inches. Which of the following is closest to the weight, in ounces, of the second piece?
$\textbf{(A)}\ 14.0\qquad\textbf{(B)}\ 16.0\qquad\textbf{(C)}\ 20.0\qquad\textbf{(D)}\ 33.3\qquad\textbf{(E)}\ 55.6$
A $5 \times 5$ table is called regular f each of its cells contains one of four pairwise distinct real numbers,such that each of them occurs exactly one in every $2 \times 2$ subtable.The sum of all numbers of a regular table is called the total sum of the table.With any four numbers,one constructs all possible regular tables,computes their total sums and counts the distinct outcomes.Determine the maximum possible count.
Find a four-digit number that is perfect square and such that the first two digits are the same and the last two as well.
Let $f : \mathbb R \to \mathbb R$ be a real-valued function defined on the set of real numbers that satisfies
\[f(x + y) \leq yf(x) + f(f(x))\]
for all real numbers $x$ and $y$. Prove that $f(x) = 0$ for all $x \leq 0$.
[i]Proposed by Igor Voronovich, Belarus[/i]
Prove that for all positive real numbers $a, b, c$ with $\frac{1}{a}+\frac{1}{b}+\frac{1}{c} =1$ the following inequality holds:
$$3(ab+bc+ca)+\frac{9}{a+b+c} \le \frac{9abc}{a+b+c} + 2(a^2+b^2+c^2)+1$$
Find all positive real numbers $(x,y,z)$ such that:
$$x = \frac{1}{y^2+y-1}$$
$$y = \frac{1}{z^2+z-1}$$
$$z = \frac{1}{x^2+x-1}$$
The altitude of the acute triangle $ABC$ drawn from $A$ , intersects the side $BC$ at $A_1$ and the circumscribed circle at $A_2$ (different from $A$). Similarly, we get the points $B_1$, $B_2$, $C_1$, $C_2$. Prove that
$$\frac{AA_2}{AA_1}+\frac{BB_2}{BB_1}+\frac{CC_2}{CC_1}= 4.$$
Let $ABC$ be a triangle with $\angle CAB = 2 \angle ABC$. Assume that a point $D$ is inside the triangle $ABC$ exists such that $AD = BD$ and $CD = AC$. Show that $\angle ACB = 3 \angle DCB$.
Let $ X$ be a set of $ k$ vertexes on a plane such that no three of them are collinear. Let $ P$ be the family of all $ {k \choose 2}$ segments that connect each pair of points. Determine $ \tau(P)$.
Find all functions $f: \mathbb{Z}\to \mathbb{Z}$ such that for all $m,n\in \mathbb{Z}$: \[f(m+f(n))=f(m)-n.\]
Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.
Let $p$ be a prime. Prove that $p^2+p+1$ is never a perfect cube.
Let $AB$ be a triangle and $\Gamma$ the excircle, relative to the vertex $A$, with center $D$. The circle $\Gamma$ is tangent to the lines $AB$ and $AC$ at $E$ and $F$, respectively. Let $P$ and $Q$ be the intersections of $EF$ with $BD$ and $CD$, respectively. If $O$ is the point of intersection of $BQ$ and $CP$, show that the distance from $O$ to the line $BC$ is equal to the radius of the inscribed circle in the triangle $ABC$.
Let $a,b,c$ be some complex numbers. Prove that
$$|\dfrac{a^2}{ab+ac-bc}| + |\dfrac{b^2}{ba+bc-ac}| + |\dfrac{c^2}{ca+cb-ab}| \ge \dfrac{3}{2}$$
if the denominators are not 0
In triangle $ABC$(with incenter $I$) let the line parallel to $BC$ from $A$ intersect circumcircle of $\triangle ABC$ at $A_1$ let $AI\cap BC=D$ and $E$ is tangency point of incircle with $BC$ let $ EA_1\cap \odot (\triangle ADE)=T$ prove that $AI=TI$.
Compute the sum of all positive integers $n$ such that $n^n$ has 325 positive integer divisors. (For example, $4^4=256$ has 9 positive integer divisors: 1, 2, 4, 8, 16, 32, 64, 128, 256.)
Each of the small circles in the figure has radius one. The innermost circle is tangent to the six circles that surround it, and each of those circles is tangent to the large circle and to its small-circle neighbors. Find the area of the shaded region.
[asy]unitsize(.3cm);
defaultpen(linewidth(.8pt));
path c=Circle((0,2),1);
filldraw(Circle((0,0),3),grey,black);
filldraw(Circle((0,0),1),white,black);
filldraw(c,white,black);
filldraw(rotate(60)*c,white,black);
filldraw(rotate(120)*c,white,black);
filldraw(rotate(180)*c,white,black);
filldraw(rotate(240)*c,white,black);
filldraw(rotate(300)*c,white,black);[/asy]$ \textbf{(A)}\ \pi \qquad \textbf{(B)}\ 1.5\pi \qquad \textbf{(C)}\ 2\pi \qquad \textbf{(D)}\ 3\pi \qquad \textbf{(E)}\ 3.5\pi$
Find all $x$ for which, for all $n,$ \[\sum^n_{k=1} \sin {k x} \leq \frac{\sqrt{3}}{2}.\]
For each positive integer $n$, let an be the smallest nonnegative integer such that there is only one positive integer at most $n$ that is relatively prime to all of $n$, $n + 1$, .. , $n + a_n$. If $n < 100$, compute the largest possible value of $n - a_n$.
Find all polynomials $P(x)$ with real coefficents, such that for all $x,y,z$ satisfying $x+y+z=0$, the equation below is true: \[P(x+y)^3+P(y+z)^3+P(z+x)^3=3P((x+y)(y+z)(z+x))\]