Found problems: 85335
Let $G$ be centroid and $R$ the circunradius of a triangle $ABC$. The extensions of $GA,GB,GC$ meet the circuncircle again at $D,E,F$. Prove that:
$\frac{3}{R} \leq \frac{1}{GD} + \frac{1}{GE} + \frac{1}{GF} \leq \sqrt{3} \leq \frac{1}{AB} + \frac{1}{BC} + \frac{1}{CA}$
Let $f(x,y)$ be a continuous function on the square $$S=\{(x,y):0\leq x\leq 1, 0\leq y\leq 1\}.$$ For each point $(a,b)$ in the interior of $S$, let $S_{(a,b)}$ be the largest square that is contained in $S$, is centered at $(a,b)$, and has sides parallel to those of $S$. If the double integral $\int \int f(x,y) dx dy$ is zero when taken over each square $S_{(a,b)}$, must $f(x,y)$ be identically zero on $S$?
Determine the smallest positive number $a$ such that the number of all integers belonging to $(a, 2016a]$ is $2016$.
The set of polynomials $f_1, f_2, \ldots, f_n$ with real coefficients is called [i]special [/i], if for any different $i,j,k \in \{ 1,2, \ldots, n\}$ polynomial $\dfrac{2}{3}f_i + f_j + f_k$ has no real roots, but for any different $p,q,r,s \in \{ 1,2, \ldots, n\}$ of a polynomial $f_p + f_q + f_r + f_s$ there is a real root.
a) Give an example of a [i]special [/i] set of four polynomials whose sum is not a zero polynomial.
b) Is there a [i]special [/i] set of five polynomials?
The function $f$ satisfies the condition $$f (x + 1) = \frac{1 + f (x)}{1 - f (x)}$$ for all real $x$, for which the function is defined. Determine $f(2012)$, if we known that $f(1000)=2012$.
The altitudes $BB_1$ and $CC_1$, are drawn in an acute triangle $ABC$. Let $X$ and $Y$ be the points, which are symmetrical to the points $B_1$ and $C_1$, with respect to the midpoints of the sides$ AB$ and $AC$ of the triangle $ABC$ respectively. Let's denote with $Z$ the point of intersection of the lines $BC$ and $XY$. Prove that the line $ZA$ is tangent to the circumscribed circle of the triangle $AXY$ .
It is known that for every integer $n > 1$ there is a prime number among the numbers $n+1,n+2,...,2n-1.$ Determine all positive integers $n$ with the following property: Every integer $m > 1$ less than $n$ and coprime to $n$ is prime.
Let $S$ be a set of 1980 points in the plane such that the distance between every pair of them is at least 1. Prove that $S$ has a subset of 220 points such that the distance between every pair of them is at least $\sqrt{3}.$
Let $ ABC$ be a non-obtuse triangle with $ CH$ and $ CM$ are the altitude and median, respectively. The angle bisector of $ \angle BAC$ intersects $ CH$ and $ CM$ at $ P$ and $ Q$, respectively. Assume that \[ \angle ABP\equal{}\angle PBQ\equal{}\angle QBC,\]
(a) prove that $ ABC$ is a right-angled triangle, and
(b) calculate $ \dfrac{BP}{CH}$.
[i]Soewono, Bandung[/i]
For how many positive integers $100 < n \le 10000$ does $\lfloor \sqrt{n-100} \rfloor$ divide $n$?
[i]Proposed by Michael Tang[/i]
[b]a)[/b] Let be a nonnegative integer $ n. $ Solve in the complex numbers the equation $ z^n\cdot\Re z=\bar z^n\cdot\Im z. $
[b]b)[/b] Let be two complex numbers $ v,d $ satisfying $ v+1/v=d/\bar d +\bar d/d. $ Show that
$$ v^n+1/v^n=d^n/\bar d^n + \bar d^n/d^n, $$
for any nonnegative integer $ n. $
$N$ denotes the set of all natural numbers. Define a function $T: N \to N$ such that $T (2k) = k$ and $T (2k + 1) = 2k + 2$. We write $T^2 (n) = T (T (n))$ and in general $T^k (n) = T^{k-1} (T (n))$ for all $k> 1$.
(a) Prove that for every $n \in N$, there exists $k$ such that $T^k (n) = 1$.
(b) For $k \in N$, $c_k$ denotes the number of elements in the set $\{n: T^k (n) = 1\}$.
Prove that $c_{k + 2} = c_{k + 1} + c_k$, for $1 \le k$.
Let the vertex set \( V \) of a graph be partitioned into \( h \) parts \( (V = V_1 \cup V_2 \cup \cdots \cup V_h) \), with \(|V_1| = n_1, |V_2| = n_2, \ldots, |V_h| = n_h \). If there is an edge between any two vertices only when they belong to different parts, the graph is called a complete \( h \)-partite graph, denoted as \( k(n_1, n_2, \ldots, n_h) \). Let \( n \) and \( r \) be positive integers, \( n \geq 6 \), \( r \leq \frac{2}{3}n \). Consider the complete \( r + 1 \)-partite graph \( k\left(\underbrace{1, 1, \ldots, 1}_{r}, n - r\right) \).
Answer the following questions:
1. Find the maximum number of disjoint circles (i.e., circles with no common vertices) in this complete \( r + 1 \)-partite graph.
2. Given \( n \), for all \( r \leq \frac{2}{3}n \), find the maximum number of edges in a complete \( r + 1 \)-partite graph \( k(1, 1, \ldots, 1, n - r) \) where no more than one circle is disjoint.
Determine $3x_4+2x_5$ if $x_1$, $x_2$, $x_3$, $x_4$, and $x_5$ satisfy the system of equations below.
\[ \begin{array}{l} 2x_1+x_2+x_3+x_4+x_5=6 \\ x_1+2x_2+x_3+x_4+x_5=12 \\ x_1+x_2+2x_3+x_4+x_5=24 \\ x_1+x_2+x_3+2x_4+x_5=48 \\ x_1+x_2+x_3+x_4+2x_5=96 \\ \end{array} \]
Given that $xy+x+y=5$ and $x+1=2$, compute $y+1$.
(10.4) A set of numbers $a_0, a_1,..., a_n$ satisfies the conditions: $a_0 = 0$, $0 \le a_{k+1}- a_k \le 1$ for $k = 0, 1, .. , n -1$. Prove the inequality $$\sum_{k=1}^n a^3_k \le \left(\sum_{k=1}^n a_k \right)^2$$
(11.3) A set of numbers $a_0, a_1,..., a_n$ satisfies the conditions: $a_0 = 0$, $a_{k+1} \ge a_k + 1$ for $k = 0, 1, .. , n -1$. Prove the inequality $$\sum_{k=1}^n a^3_k \ge \left(\sum_{k=1}^n a_k \right)^2$$
In a $12\times 12$ grid, colour each unit square with either black or white, such that there is at least one black unit square in any $3\times 4$ and $4\times 3$ rectangle bounded by the grid lines. Determine, with proof, the minimum number of black unit squares.
Let $ P(x)$ be a polynomial with degree 2008 and leading coefficient 1 such that
\[ P(0) \equal{} 2007, P(1) \equal{} 2006, P(2) \equal{} 2005, \dots, P(2007) \equal{} 0.
\]Determine the value of $ P(2008)$. You may use factorials in your answer.
Given a triangle $ABC$ with $AB=AC$ and circumcenter $O$. Let $D$ and $E$ be midpoints of $AC$ and $AB$ respectively, and let $DE$ intersect $AO$ at $F$. Denote $\omega$ to be the circle $(BOE)$. Let $BD$ intersect $\omega$ again at $X$ and let $AX$ intersect $\omega$ again at $Y$.
Suppose the line parallel to $AB$ passing through $O$ meets $CY$ at $Z$. Prove that the lines $FX$ and $BZ$ meet at $\omega$.
[i]Proposed by Ivan Chan Kai Chin[/i]
Find all functions $f,g : N \to N$ such that for all $m ,n \in N$ the following relation holds: $$f(m ) - f(n) = (m - n)(g(m) + g(n))$$.
Note: $N = \{0,1,2,...\}$
Let $k, l, m, n$ be positive integers. Given that $k+l+m+n=km=ln$, find all possible values of $k+l+m+n$.
Let $ABC$ be a right-angled triangle $\left(\angle A=90^{\circ}\right)$ and $M$ be the midpoint of $BC$. $\omega_1$ is a circle which passes through $B,M$ and touchs $AC$ at $X$. $\omega_2$ is a circle which passes through $C,M$ and touchs $AB$ at $Y$ ($X,Y$ and $A$ are in the same side of $BC$). Prove that $XY$ passes through the midpoint of arc $BC$ (does not contain $A$) of the circumcircle of $ABC$.
Find all integers $n\geq 1$ such that there exists a permutation $(a_1,a_2,...,a_n)$ of $(1,2,...,n)$ such that $a_1+a_2+...+a_k$ is divisible by $k$ for $k=1,2,...,n$
In a graph with $8$ vertices that contains no cycle of length $4$, at most how many edges can there be?
Inside triangle \( ABC \), points \( D \) and \( E \) are chosen such that \( \angle ABD = \angle CBE \) and \( \angle ACD = \angle BCE \). Point \( F \) on side \( AB \) is such that \( DF \parallel AC \), and point \( G \) on side \( AC \) is such that \( EG \parallel AB \). Prove that \( \angle BFG = \angle BDC \).
[i]Proposed by Anton Trygub[/i]