Found problems: 85335
For a real number $x$, the minimum value of the expression $$\frac{2x^2 + x - 3}{x^2 - 2x + 3}$$ can be written in the form $\frac{a-\sqrt{b}}{c}$, where $a, b$, and $c$ are positive integers such that $a$ and $c$ are relatively prime. Find $a + b + c$
In triangle $ABC, AB \ne AC$. Circle $\omega$ passes through $A$ and meets sides $AB$ and $AC$ at $M$ and $N$, respectively, and the side $BC$ at $P$ and $Q$ such that $Q$ lies in between $B$ and $P$. Suppose that $MP // AC, NQ // AB$, and $BP \cdot AC = CQ \cdot AB$. Find $\angle BAC$.
Consider real numbers $a, b ,c \ge0$ with $a+b+c=2$. Prove that:
$\frac{bc}{\sqrt[4]{3a^2+4}}+\frac{ca}{\sqrt[4]{3b^2+4}}+\frac{ab}{\sqrt[4]{3c^2+4}} \le \frac{2*\sqrt[4] {3}}{3}$
Four distinct circles $C,C_1, C_2$, C3 and a line L are given in the plane such that $C$ and $L$ are disjoint and each of the circles $C_1, C_2, C_3$ touches the other two, as well as $C$ and $L$. Assuming the radius of $C$ to be $1$, determine the distance between its center and $L.$
Let $a_i,b_i,i=1,\cdots,n$ are nonnegitive numbers,and $n\ge 4$,such that $a_1+a_2+\cdots+a_n=b_1+b_2+\cdots+b_n>0$.
Find the maximum of $\frac{\sum_{i=1}^n a_i(a_i+b_i)}{\sum_{i=1}^n b_i(a_i+b_i)}$
Given integers $0 < a_1 < a_2 <... < a_{101} < 5050$, prove that one can always choose for different numbers $a_k,a_l,a_m,a_n$ such that $5050 | a_k +a_l -a_m -a_n$
In the following diagram, a semicircle is folded along a chord $AN$ and intersects its diameter $MN$ at $B$. Given that $MB : BN = 2 : 3$ and $MN = 10$. If $AN = x$, find $x^2$.
[asy]
size(120); defaultpen(linewidth(0.7)+fontsize(10));
pair D2(pair P) {
dot(P,linewidth(3)); return P;
}
real r = sqrt(80)/5;
pair M=(-1,0), N=(1,0), A=intersectionpoints(arc((M+N)/2, 1, 0, 180),circle(N,r))[0], C=intersectionpoints(circle(A,1),circle(N,1))[0], B=intersectionpoints(circle(C,1),M--N)[0];
draw(arc((M+N)/2, 1, 0, 180)--cycle); draw(A--N); draw(arc(C,1,180,180+2*aSin(r/2)));
label("$A$",D2(A),NW);
label("$B$",D2(B),SW);
label("$M$",D2(M),S);
label("$N$",D2(N),SE);
[/asy]
Let $R$ be the region consisting of the points $(x,y)$ of the cartesian plane satisfying both $|x|-|y| \leq 1$ and $|y| \leq 1$. Sketch the region $R$ and find its area.
Find the number of ways of filling a $8$ by $8$ grid with $0$'s and $X$'s so that the number of $0$'s in each row and each column is odd.
Let $x, y, z$ be real numbers each of whose absolute value is different from $\frac{1}{\sqrt 3}$ such that $x + y + z = xyz$. Prove that
\[\frac{3x - x^3}{1-3x^2} + \frac{3y - y^3}{1-3y^2} + \frac{3z -z^3}{1-3z^2} = \frac{3x - x^3}{1-3x^2} \cdot \frac{3y - y^3}{1-3y^2} \cdot \frac{3z - z^3}{1-3z^2}\]
A school has three senior classes of $M$ students each. Every student knows at least $\frac{3}{4}M$ people in each of the other two classes. Prove that the school can send $M$ non-intersecting teams to the olympiad so that each team consists of $3$ students from different classes who know each other.
[i]Proposed by C. Magyar, R. Martin[/i]
You are given an algebraic system admitting addition and multiplication for which all the laws of ordinary arithmetic are valid except commutativity of multiplication. Show that
\[(a + ab^{-1} a)^{-1}+ (a + b)^{-1} = a^{-1},\]
where $x^{-1}$ is the element for which $x^{-1}x = xx^{-1} = e$, where $e$ is the element of the system such that for all $a$ the equality $ea = ae = a$ holds.
Two positive valued sequences $\{ a_{n}\}$ and $\{ b_{n}\}$ satisfy:
(a): $a_{0}=1 \geq a_{1}$, $a_{n}(b_{n+1}+b_{n-1})=a_{n-1}b_{n-1}+a_{n+1}b_{n+1}$, $n \geq 1$.
(b): $\sum_{i=1}^{n}b_{i}\leq n^{\frac{3}{2}}$, $n \geq 1$.
Find the general term of $\{ a_{n}\}$.
Prove that there are no integers $x,y$ for that it is $x^3+y^3=4\cdot(x^2y+xy^2+1)$.
In an acute triangle $ABC$, let $M$ be the midpoint of $\overline{BC}$. Let $P$ be the foot of the perpendicular from $C$ to $AM$. Suppose that the circumcircle of triangle $ABP$ intersects line $BC$ at two distinct points $B$ and $Q$. Let $N$ be the midpoint of $\overline{AQ}$. Prove that $NB=NC$.
[i]Proposed by Holden Mui[/i]
Prove that the product of the sines of two opposite dihedrals in a tetrahedron is proportional to the product of the lengths of the edges of these dihedrals.
A regular star-shaped hexagon is split into $4$ parts. Construct from them a convex polygon.
Note: A regular six-pointed star is a figure that is obtained by combining a regular triangle and a triangle symmetrical to it relative to its center
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
If $n$ is a positive even number, find the last two digits of $(2^{6n}+26)-(6^{2n}-62)$.
Given a real number $t$ with $0 < t < 1$, define the real-valued function $f(t, \theta) = \sum^{\infty}_{n=-\infty} t^{|n|}\omega^n$, where $\omega = e^{i \theta} = \cos \theta + i\sin \theta$. For $\theta \in [0, 2\pi)$, the polar curve $r(\theta) = f(t, \theta)$ traces out an ellipse $E_t$ with a horizontal major axis whose left focus is at the origin. Let $A(t)$ be the area of the ellipse $E_t$. Let $A\left( \frac12 \right) = \frac{a\pi}{b}$ , where $a, b$ are relatively prime positive integers. Find $100a +b$ .
Let the definite integral $ I_n\equal{}\int_0^{\frac{\pi}{4}} \frac{dx}{(\cos x)^n}\ (n\equal{}0,\ \pm 1,\ \pm 2,\ \cdots )$.
(1) Find $ I_0,\ I_{\minus{}1},\ I_2$.
(2) Find $ I_1$.
(3) Express $ I_{n\plus{}2}$ in terms of $ I_n$.
(4) Find $ I_{\minus{}3},\ I_{\minus{}2},\ I_3$.
(5) Evaluate the definite integrals $ \int_0^1 \sqrt{x^2\plus{}1}\ dx,\ \int_0^1 \frac{dx}{(x^2\plus{}1)^2}\ dx$ in using the avobe results.
You are not allowed to use the formula of integral for $ \sqrt{x^2\plus{}1}$ directively here.
Let $D(n)$ denote the number of ways of writing the positive integer $n$ as a product$$n = f_1\cdot f_2\cdots f_k,$$where $k\ge1$, the $f_i$ are integers strictly greater than $1$, and the order in which the factors are listed matters (that is, two representations that differ only in the order of the factors are counted as distinct). For example, the number $6$ can be written as $6$, $2\cdot 3$, and $3\cdot2$, so $D(6) = 3$. What is $D(96)$?
$\textbf{(A) } 112 \qquad\textbf{(B) } 128 \qquad\textbf{(C) } 144 \qquad\textbf{(D) } 172 \qquad\textbf{(E) } 184$
For a natural number $n$, let $T(n)$ denote the number of ways we can place $n$ objects of weights $1,2,\cdots, n$ on a balance such that the sum of the weights in each pan is the same. Prove that $T(100) > T(99)$.
In a new edition of QoTD duels, $n \ge 2$ ranked contestants (numbered 1 to $n$) play a round robin tournament (i.e. each pair of contestants compete against each other exactly once); no draws are possible. Define an upset to be a pair $(i, j)$ where$ i > j$ and contestant $i$ wins against contestant $j$. At the end of the tournament, contestant $i$ has $s_i$ wins for each $1 \le i \le n$. The result of the tournament is defined as the $n$-tuple $(s_1, s_2, \cdots , s_n)$. An $n$-tuple $S$ is called interesting if, among the distinct tournaments that produce $S$ as a result, the number of tournaments with an odd number of upsets is not equal to the number of tournaments with an even number of upsets. Find the number of interesting $n$-tuples in terms of $n$.
[i](Two tournaments are considered distinct if the outcome of some match differs.)[/i]
[b]6.[/b] For a prime factorisation of a positive integer $N$ let us call the exponent of a prime $p$ the integer $k$ for which $p^{k} \mid N$ but $p^{k+1} \nmid N$; let, further, the power $p^{k}$ be called the "contribution" of $p$ to $N$. Show that for any positive integer $n$ and for any primes $p$ and $q$ the contibution of $p$ to $n!$ is greater than the contribution of $q$ if and only if the exponent of $p$ is greater than that of $q$.