Found problems: 260
Given a triangle $ABC$. Find the minimum of
\[\frac{\cos^{2}\frac{A}{2}\cos^{2}\frac{B}{2}}{\cos^{2}\frac{C}{2}}+\frac{\cos^{2}\frac{B}{2}\cos^{2}\frac{C}{2}}{\cos^{2}\frac{A}{2}}+\frac{\cos^{2}\frac{C}{2}\cos^{2}\frac{A}{2}}{\cos^{2}\frac{B}{2}}. \]
For a positive integer $a$, let $S_{a}$ be the set of primes $p$ for which there exists an odd integer $b$ such that $p$ divides $(2^{2^{a}})^{b}-1.$ Prove that for every $a$ there exist infinitely many primes that are not contained in $S_{a}$.
Find the tangents of the angles of a triangle knowing that they are positive integers.
An [i]animal[/i] with $n$ [i]cells[/i] is a connected figure consisting of $n$ equal-sized cells[1].
A [i]dinosaur[/i] is an animal with at least $2007$ cells. It is said to be [i]primitive[/i] it its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur.
(1) Animals are also called [i]polyominoes[/i]. They can be defined inductively. Two cells are [i]adjacent[/i] if they share a complete edge. A single cell is an animal, and given an animal with $n$ cells, one with $n+1$ cells is obtained by adjoining a new cell by making it adjacent to one or more existing cells.
Prove that all roots of $ 11z^{10} \plus{} 10iz^9 \plus{} 10iz \minus{}11 \equal{} 0$ have unit modulus (or equivalent $ |z| \equal{} 1$).
Let $ a, b, c$ be three natural numbers such that $ a < b < c$ and $ gcd (c \minus{} a, c \minus{} b) \equal{} 1$. Suppose there exists an integer $ d$ such that $ a \plus{} d, b \plus{} d, c \plus{} d$ form the sides of a right-angled triangle. Prove that there exist integers, $ l,m$ such that $ c \plus{} d \equal{} l^{2} \plus{} m^{2} .$
[b][Weightage 17/100][/b]
Prove that a positive integer is a sum of at least two consecutive positive integers if and only if it is not a power of two.
Let $ABC$ be a triangle such that $|AC|>|AB|$. Let $X$ be on line $AB$ (closer to $A$) such that $|BX|=|AC|$ and let $Y$ be on the segment $AC$ such that $|CY|=|AB|$. Intersection of lines $XY$ and bisector of $BC$ is point $P$. Prove that $\angle BPC+\angle BAC = 180^\circ$.
Show that the only solutions of the equation $x^{3}-3xy^2 -y^3 =1$ are given by $(x,y)=(1,0),(0,-1),(-1,1),(1,-3),(-3,2),(2,1)$.
Farmer Tim is lost in the densely-forested Cartesian plane. Starting from the origin he walks a sinusoidal path in search of home; that is, after $t$ minutes he is at position $(t,\sin t)$.
Five minutes after he sets out, Alex enters the forest at the origin and sets out in search of Tim. He walks in such a way that after he has been in the forest for $m$ minutes, his position is $(m,\cos t)$.
What is the greatest distance between Alex and Farmer Tim while they are walking in these paths?
Let $ P$ be a polynomial with integer coefficients such that there are two distinct integers at which $ P$ takes coprime values. Show that there exists an infinite set of integers, such that the values $ P$ takes at them are pairwise coprime.
Let $T$ be a non-empty finite subset of positive integers $\ge 1$. A subset $S$ of $T$ is called [b]good [/b] if for every integer $t\in T$ there exists an $s$ in $S$ such that $gcd(t,s) >1$. Let
\[A={(X,Y)\mid X\subseteq T,Y\subseteq T,gcd(x,y)=1 \text{for all} x\in X, y\in Y}\]
Prove that :
$a)$ If $X_0$ is not [b]good[/b] then the number of pairs $(X_0,Y)$ in $A$ is [b]even[/b].
$b)$ the number of good subsets of $T$ is [b]odd[/b].
Find the first integer $n > 1$ such that the average of $1^2 , 2^2 ,\cdots, n^2$ is itself a perfect square.
Two mathematicians, lost in Berlin, arrived on the corner of Barbarossa street with Martin Luther street and need to arrive on the corner of Meininger street with Martin Luther street. Unfortunately they don't know which direction to go along Martin Luther Street to reach Meininger Street nor how far it is, so they must go fowards and backwards along Martin Luther street until they arrive on the desired corner. What is the smallest value for a positive integer $k$ so that they can be sure that if there are $N$ blocks between Barbarossa street and Meininger street then they can arrive at their destination by walking no more than $kN$ blocks (no matter what $N$ turns out to be)?
Find all prime numbers $p$ such that $1 +p+p^2 +p^3 +p^4$ is a perfect square.
Point $P$ is inside $\triangle ABC$. Line segments $APD$, $BPE$, and $CPF$ are drawn with $D$ on $BC$, $E$ on $AC$, and $F$ on $AB$ (see the figure at right). Given that $AP=6$, $BP=9$, $PD=6$, $PE=3$, and $CF=20$, find the area of $\triangle ABC$.
[asy]
size(200);
pair A=origin, B=(7,0), C=(3.2,15), D=midpoint(B--C), F=(3,0), P=intersectionpoint(C--F, A--D), ex=B+40*dir(B--P), E=intersectionpoint(B--ex, A--C);
draw(A--B--C--A--D^^C--F^^B--E);
pair point=P;
label("$A$", A, dir(point--A));
label("$B$", B, dir(point--B));
label("$C$", C, dir(point--C));
label("$D$", D, dir(point--D));
label("$E$", E, dir(point--E));
label("$F$", F, dir(point--F));
label("$P$", P, dir(0));[/asy]
Prove that for positive $a,b,c,d$
\[\frac{a+c}{a+b}+\frac{b+d}{b+c}+\frac{c+a}{c+d}+\frac{d+b}{d+a}\ge 4\]
Let $ a_1,a_2,...,a_n$ be nonnegative real numbers. Prove that \[ ( \sum_{i=1}^na_i)( \sum_{i=1}^na_i^{n-1}) \leq n \prod_{i=1}^na_i+ (n-1) ( \sum_{i=1}^na_i^n).\]
[i]J. Suranyi[/i]
Consider a round-robin tournament with $2n+1$ teams, where each team plays each other team exactly one. We say that three teams $X,Y$ and $Z$, form a [i]cycle triplet [/i] if $X$ beats $Y$, $Y$ beats $Z$ and $Z$ beats $X$. There are no ties.
a)Determine the minimum number of cycle triplets possible.
b)Determine the maximum number of cycle triplets possible.
The real numbers $a,b,c,x,y,$ and $z$ are such that $a>b>c>0$ and $x>y>z>0$. Prove that
\[\frac {a^2x^2}{(by+cz)(bz+cy)}+\frac{b^2y^2}{(cz+ax)(cx+az)}+\frac{c^2z^2}{(ax+by)(ay+bx)}\ge \frac{3}{4}\]
Show that the equation $a^2 + b^2 = c^2 + 3$ has infinetely many triples of integers $a, b, c$ that are solutions.
In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$.
We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle.
The following property is satisfied:
"for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element"
Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends.
([i]Serbia[/i])
Find all positive integers $n$ such that:
\[ \dfrac{n^3+3}{n^2+7} \]
is a positive integer.
Find all real values of $\alpha$, for which there exists one and only one function $f: \mathbb{R} \mapsto \mathbb{R}$ and satisfying the equation \[ f(x^2 + y + f(y)) = (f(x))^2 + \alpha \cdot y \] for all $x, y \in \mathbb{R}$.
Let $ ABC$ be a triangle and $ P$ an arbitrary point in the plane. Let $ \alpha, \beta, \gamma$ be interior angles of the triangle and its area is denoted by $ F.$ Prove:
\[ \ov{AP}^2 \cdot \sin 2\alpha + \ov{BP}^2 \cdot \sin 2\beta + \ov{CP}^2 \cdot \sin 2\gamma \geq 2F
\]
When does equality occur?