Found problems: 85335
Let $N$ be an integer greater than $1$. A deck has $N^3$ cards, each card has one of $N$ colors, has one of $N$ figures and has one of $N$ numbers (there are no two identical cards). A collection of cards of the deck is "complete" if it has cards of every color, or if it has cards of every figure or of all numbers. How many non-complete collections are there such that, if you add any other card from the deck, the collection becomes complete?
Each edge of a graph with $15$ vertices is colored either red or blue in such a way that no three vertices are pairwise connected with edges of the same color. Determine the largest possible number of edges in the graph.
Evaluate the following definite integral.
\[ 2^{2009}\frac {\int_0^1 x^{1004}(1 \minus{} x)^{1004}\ dx}{\int_0^1 x^{1004}(1 \minus{} x^{2010})^{1004}\ dx}\]
(a) Let $p>1$ a real number. Find a real constant $c_p$ for which the following statement holds:
If $f: [-1,1]\rightarrow\mathbb{R}$ is a continuously differentiable function with $f(1)>f(-1)$ and $|f'(y)|\le1 \forall y\in[-1,1]$, then $\exists x\in[-1,1]: f'(x)>0$ so that $\forall y\in[-1,1]: |f(y)-f(x)|\le c_p\sqrt[p]{f'(x)}|y-x|$.
(b) What if $p=1$?
At least how many non-zero real numbers do we have to select such that every one of them can be written as a sum of $2019$ other selected numbers and
a) the selected numbers are not necessarily different?
b) the selected numbers are pairwise different?
5-Two circles $ S_1$ and $ S_2$ with equal radius and intersecting at two points are given in the plane.A line $ l$ intersects $ S_1$ at $ B,D$ and $ S_2$ at $ A,C$(the order of the points on the line are as follows:$ A,B,C,D$).Two circles $ W_1$ and $ W_2$ are drawn such that both of them are tangent externally at $ S_1$ and internally at $ S_2$ and also tangent to $ l$ at both sides.Suppose $ W_1$ and $ W_2$ are tangent.Then PROVE $ AB \equal{} CD$.
Circles $ \omega_1$ and $ \omega_2$ meet at $ P$ and $ Q$. Segments $ AC$ and $ BD$ are chords of $ \omega_1$ and $ \omega_2$ respectively, such that segment $ AB$ and ray $ CD$ meet at $ P$. Ray $ BD$ and segment $ AC$ meet at $ X$. Point $ Y$ lies on $ \omega_1$ such that $ PY \parallel BD$. Point $ Z$ lies on $ \omega_2$ such that $ PZ \parallel AC$. Prove that points $ Q,X,Y,Z$ are collinear.
Let $(a_1, a_2,..., a_n)$ and $(b_1, b_2, ..., b_n)$ be two sequences of positive real numbers. Let $\pi$ be a permutation of the set $\{1, 2, ..., n\}$, for which the sum $a_{\pi(1)}(b_{\pi(1)}+b_{\pi(2)}+...+b_{\pi(n)})+a_{\pi(2)}(b_{\pi(3)}+b_{\pi(3)}+...+b_{\pi(n)})+...+a_{\pi(n)}b_{\pi(n)}$ is minimal.
Proce for this permutation $\pi$, that $$ \frac{a_{\pi(1)}}{b_{\pi(1)}}\le \frac{a_{\pi(2})}{b_{\pi(2)}}\le ... \le \frac{a_{\pi(n)}}{b_{\pi(n)}}$$
Application: In an idealized role-playing game you fight against $n$ opponents at the same time. In order to minimize the damage you suffer yourself, you should first take care of your opponent for the ratio of the time it takes to defeat him (if you only focus on him), and the damage it does per second is minimal; next, one should fight the opponent with the second smallest such ratio, and so on.
How many strings of length $5$ formed from the digits $0$,$1$,$2$,$3$,$4$ are there such that for each $j\in\{1,2,3,4\}$, at least $j$ of the digits are less than $j$? (For example, $02214$ satisfies the condition because it contains at least $1$ digit less than $1$, at least $2$ digits less than $2$, at least $3$ digits less than $3$, and at least $4$ digits less than $4$. The string $23404$ does not satisfy the condition because it does not contain at least $2$ digits less than $2$.)
$\textbf{(A) }500\qquad\textbf{(B) }625\qquad\textbf{(C) }1089\qquad\textbf{(D) }1199\qquad\textbf{(E) }1296$
Five test scores have a mean (average score) of $90$, a median (middle score) of $91$ and a mode (most frequent score) of $94$. The sum of the two lowest test scores is
$\text{(A)}\ 170 \qquad \text{(B)}\ 171 \qquad \text{(C)}\ 176 \qquad \text{(D)}\ 177 \qquad \text{(E)}\ \text{not determined by the information given}$
Find all real pairs $(a,b)$ that solve the system of equation \begin{align*} a^2+b^2 &= 25, \\ 3(a+b)-ab &= 15. \end{align*} [i](German MO 2016 - Problem 1)[/i]
In the figure below, the centers of the six congruent circles form a regular hexagon with side length 2.
[asy]
import graph;
pair A = 2dir(0);
pair B = 2dir(60);
pair C = 2dir(120);
pair D = 2dir(180);
pair E = 2dir(240);
pair F = 2dir(300);
path hexagon = A -- B -- C -- D -- E -- F -- cycle;
fill(hexagon, gray);
filldraw(Circle(A, 1), white);
filldraw(Circle(B, 1), white);
filldraw(Circle(C, 1), white);
filldraw(Circle(D, 1), white);
filldraw(Circle(E, 1), white);
filldraw(Circle(F, 1), white);
draw(hexagon);
[/asy]
Adjacent circles are tangent to each other. What is the area of the shaded region?
Let $A = (a_1, a_2, \ldots, a_{2001})$ be a sequence of positive integers. Let $m$ be the number of 3-element subsequences $(a_i,a_j,a_k)$ with $1 \leq i < j < k \leq 2001$, such that $a_j = a_i + 1$ and $a_k = a_j + 1$. Considering all such sequences $A$, find the greatest value of $m$.
Let $H$ be the orthocenter of the acute triangle $ABC$. Let $BB'$ and $CC'$ be altitudes of the triangle ($B^{\prime} \in AC$, $C^{\prime} \in AB$). A variable line $\ell$ passing through $H$ intersects the segments $[BC']$ and $[CB']$ in $M$ and $N$. The perpendicular lines of $\ell$ from $M$ and $N$ intersect $BB'$ and $CC'$ in $P$ and $Q$. Determine the locus of the midpoint of the segment $[ PQ]$.
[i]Gheorghe Szolosy[/i]
$$\int\frac{\ln^2(x)}{x}\,dx$$
[i]Proposed by Connor Gordon[/i]
A set \( S \) of two or more positive integers is called [i]almost closed under addition[/i] if the sum of any two distinct elements of \( S \) also belongs to \( S \). Let \( P(x) \) be a polynomial with integer coefficients for which there exists an almost closed under addition set \( S \), such that for any two distinct \( a \) and \( b \) from \( S \), the numbers \( P(a) \) and \( P(b) \) are coprime. Prove that \( P \) is a constant.
Let $ABCDE$ be a pentagon with area $2017$ such that four of its sides $AB, BC, CD$, and $EA$ have integer length. Suppose that $\angle A = \angle B = \angle C = 90^o$, $AB = BC$, and $CD = EA$. The maximum possible perimeter of $ABCDE$ is $a + b \sqrt{c}$, where $a$, $b$, and $c$ are integers and $c$ is not divisible by the square of any prime. Find $a + b + c$.
Suzanne went to the bank and withdrew \$$800$. The teller gave her this amount using \$$20$ bills, \$$50$ bills, and \$$100$ bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?
$\textbf{(A) }45\qquad\textbf{(B) }21\qquad\textbf{(C) }36\qquad\textbf{(D) }28\qquad\textbf{(E) }32$
Let $\{a_n\}_{n \in N}$ be a sequence of real numbers with $a_1 = 2$ and $a_n =\frac{n^2 + 1}{\sqrt{n^3 - 2n^2 + n}}$ for all positive integers $n \ge 2$.
Let $s_n = a_1 + a_2 + ...+ a_n$ for all positive integers $n$. Prove that $$\frac{1}{s_1s_2}+\frac{1}{s_2s_3}+ ...+\frac{1}{s_ns_{n+1}}<\frac15$$
for all positive integers $n$.
How many digits are in the base $10$ representation of $3^{30}$ given $\log 3 = 0.47712$?
[i]2015 CCA Math Bonanza Lightning Round #1.4[/i]
For each real number $k$, denote by $f(k)$ the larger of the two roots of the quadratic equation
$$(k^2+1)x^2+10kx-6(9k^2+1)=0.$$Show that the function $f(k)$ attains a minimum and maximum and evaluate these two values.
Numbers $a, b, c$ are such that $3a + 4b = 3c$ and $4a - 3b = 4c$. Show that $a^2 + b^2 = c^2$.
A tournament of order $n$, $n \in \mathbb{N}$, consists of $2^n$ players, which are numbered with $1, 2, \ldots, 2^n$, and has $n$ rounds. In each round, the remaining players paired with each other to play a match and the winner from each match advances to the next round. The winner of the $n$-th round is considered the winner of the tournament. Two tournaments are considered different if there is a match that took place in the $k$-th round of one tournament, but not in the $k$-th round of the other, or if the tournaments have different winners. Determine how many different tournaments of order $n$ there are with the property that in each round, the sum of the numbers of the players in each match is the same (but not necessarily the same for all rounds).
Let $n$ be an integer greater than $1$, $\alpha$ is a real, $0<\alpha < 2$, $a_1,\ldots ,a_n,c_1,\ldots ,c_n$ are all positive numbers. For $y>0$, let
$$f(y)=\left(\sum_{a_i\le y} c_ia_i^2\right)^{\frac{1}{2}}+\left(\sum_{a_i>y} c_ia_i^{\alpha} \right)^{\frac{1}{\alpha}}.$$
If positive number $x$ satisfies $x\ge f(y)$ (for some $y$), prove that $f(x)\le 8^{\frac{1}{\alpha}}\cdot x$.
In triangle $\triangle ABC$ , $M$ is the midpoint of arc $(BAC)$ and $N$ is the antipode of $A$ in $(ABC)$. The line through $B$ perpendicular to $AM$ , intersects $AM , (ABC)$ at $D,P$ respectively and a line through $D$ perpendicular to $AC$ , intersects $BC,AC$ at $F,E$ respectively. Prove that $PE,MF,ND$ are concurrent.