Found problems: 85335
Let $$a_n = \frac{1\cdot3\cdot5\cdot\cdots\cdot(2n-1)}{2\cdot4\cdot6\cdot\cdots\cdot2n}.$$
(a) Prove that $\lim_{n\to \infty}a_n$ exists.
(b) Show that $$a_n = \frac{\left(1-\frac1{2^2}\right)\left(1-\frac1{4^2}\right)\left(1-\frac1{6^2}\right)\cdots\left(1-\frac{1}{(2n)^2}\right)}{(2n+1)a_n}.$$
(c) Find $\lim_{n\to\infty}a_n$ and justify your answer
A sequence $a_1, a_2, a_3, \ldots $ is defined as follows: $a_1$ is a positive integer and
$$a_{n+1} = \left\lfloor \frac{3}{2} a_n \right\rfloor +1$$
for all $n \in \mathbb{N}$. Can $a_1$ be chosen in such a way that the first $100000$ terms of the sequence are even, but the $100001$-th term is odd?
Find all nonnegative integers $k, n$ which satisfy $2^{2k+1} + 9\cdot 2^k + 5 = n^2.$
Given two points $ A$ and $ B$ and two circles, $\Gamma_1$ with center $A$ and passing through $ B$, and $\Gamma_2$ with center $ B$ and passing through $ A$. Line $AB$ meets $\Gamma_2$ at point $C$. Point $D$ lies on $\Gamma_2$ such that $\angle CDB = 57^o$. Line $BD$ meets $\Gamma_1$ at point $E$. What is $\angle CAE$, in degrees?
[b]Problem Section #1
a) A set contains four numbers. The six pairwise sums of distinct elements of the set, in no particular order, are $189, 320, 287, 264, x$, and y. Find the greatest possible value of: $x + y$.
[color=red]NOTE: There is a high chance that this problems was copied.[/color]
A non-empty subset of $\{1,2, ..., n\}$ is called [i]arabic [/i] if arithmetic mean of its elements is an integer. Show that the number of arabic subsets of $\{1,2, ..., n\}$ has the same parity as $n$.
The Pythagoras High School band has $100$ female and $80$ male members. The Pythagoras High School orchestra has $80$ female and $100$ male members. There are $60$ females who are members in both band and orchestra. Altogether, there are $230$ students who are in either band or orchestra or both. The number of males in the band who are NOT in the orchestra is
$\text{(A)}\ 10 \qquad \text{(B)}\ 20 \qquad \text{(C)}\ 30 \qquad \text{(D)}\ 50 \qquad \text{(E)}\ 70$
Find all pairs $(x,y)$ with $x,y$ real, satisfying the equations $$\sin\bigg(\frac{x+y}{2}\bigg)=0~,~\vert x\vert+\vert y\vert=1$$
Find two smallest natural numbers $n$ for which each of the fractions
$\frac{68}{n+70},\frac{69}{n+71},\frac{70}{n+72},...,\frac{133}{n+135}$ is irreducible.
If $\text{A}$ and $\text{B}$ are nonzero digits, then the number of digits (not necessarily different) in the sum of the three whole numbers is
\[\begin{tabular}[t]{cccc}
9 & 8 & 7 & 6 \\
& A & 3 & 2 \\
& & B & 1 \\ \hline
\end{tabular}\]
$\text{(A)}\ 4 \qquad \text{(B)}\ 5 \qquad \text{(C)}\ 6 \qquad \text{(D)}\ 9 \qquad \text{(E)}\ \text{depends on the values of A and B}$
Let $f(x)=\sin(\sin(x))$. Evaluate \[ \lim_{h \to 0} \dfrac {f(x+h)-f(h)}{x} \] at $x=\pi$.
Show that in a convex region in the plane whose boundary contains at most a finite number of straight line segments and whose area is greater than $\frac{\pi}{4}$ there is at least one pair of points a unit distance apart.
Let $f(n)$ be the sum of the factors of $2^n \cdot 31.$ Find $\sum_{n=0}^{4} f(n).$
We say that a number is [i]superstitious [/i] when it is equal to $13$ times the sum of its digits . Find all superstitious numbers.
Let $n$ be a positive integer and $a_1,...,a_n$ be positive real numbers.
Let $g(x)$ denote the product $(x + a_1)\cdot ... \cdot (x + a_n)$ .
Let $a_0$ be a real number and let
$f(x) = (x - a_0)g(x)= x^{n+1} + b_1x^n + b_2x^{n-1}+...+ b_nx + b_{n+1}$ .
Prove that all the coeffcients $b_1,b_2,..., b_{n+1}$ of the polynomial $f(x)$ are negative if and only if $a_0 > a_1 + a_2 +...+ a_n$.
Let $x$ and $y$ be positive real numbers that satisfy $(\log x)^2+(\log y)^2=\log(x^2)+\log(y^2)$. Compute the maximum possible value of $(\log(xy))^2$.
In triangle $ABC$, let the circumcenter, incenter, and orthocenter be $O$, $I$, and $H$ respectively. Segments $AO$, $AI$, and $AH$ intersect the circumcircle of triangle $ABC$ at $D$, $E$, and $F$. $CD$ intersects $AE$ at $M$ and $CE$ intersects $AF$ at $N$. Prove that $MN$ is parallel to $BC$.
Let $PQ$ be a line segment of constant length $\lambda$ taken on the side $BC$ of a triangle $ABC$ with the order $B,P,Q,C$, and let the lines through $P$ and $Q$ parallel to the lateral sides meet $AC$ at $P_1$ and $Q_1$ and $AB$ at $P_2$ and $Q_2$ respectively. Prove that the sum of the areas of the trapezoids $PQQ_1P_1$ and $PQQ_2P_2$ is independent of the position of $PQ$ on $BC.$
An acute triangle $ABC$ has $AB$ as one of its longest sides. The incircle of $ABC$ has center $I$ and radius $r$. Line $CI$ meets the circumcircle of $ABC$ at $D$. Let $E$ be a point on the minor arc $BC$ of the circumcircle of $ABC$ with $\angle ABE > \angle BAD$ and $E\notin \{B,C\}$. Line $AB$ meets $DE$ at $F$ and line $AD$ meets $BE$ at $G$. Let $P$ be a point inside triangle $AGE$ with $\angle APE=\angle AFE$ and $P\neq F$. Let $X$ be a point on side $AE$ with $XP\parallel EG$ and let $S$ be a point on side $EG$ with $PS\parallel AE$. Suppose $XS$ and $GP$ meet on the circumcircle of $AGE$. Determine the possible positions of $E$ as well as the minimum value of $\frac{BE}{r}$.
Define a sequence of polynomials $P_0\left(x\right)=x$ and $P_k\left(x\right)=P_{k-1}\left(x\right)^2-\left(-1\right)^kk$ for each $k\geq1$. Also define $Q_0\left(x\right)=x$ and $Q_k\left(x\right)=Q_{k-1}\left(x\right)^2+\left(-1\right)^kk$ for each $k\geq1$. Compute the product of the distinct real roots of \[P_1\left(x\right)Q_1\left(x\right)P_2\left(x\right)Q_2\left(x\right)\cdots P_{2018}\left(x\right)Q_{2018}\left(x\right).\]
[i]2018 CCA Math Bonanza Tiebreaker Round #2[/i]
In the increasing sequence of positive integers $a_1$, $a_2$,. . . , the number $a_k$ is said to be funny if it can be represented as the sum of some other terms (not necessarily distinct) of the sequence.
(a) Prove that all but finitely terms of the sequence are funny.
(b) Does the result in (a) always hold if the terms of the sequence can be any positive rational numbers?
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
A regular dodecahedron is a convex polyhedra that its faces are regular pentagons. The regular dodecahedron has twenty vertices and there are three edges connected to each vertex. Suppose that we have marked ten vertices of the regular dodecahedron.
[b]a)[/b] prove that we can rotate the dodecahedron in such a way that at most four marked vertices go to a place that there was a marked vertex before.
[b]b)[/b] prove that the number four in previous part can't be replaced with three.
[i]proposed by Kasra Alishahi[/i]
Given $2015$ subsets $A_1, A_2,...,A_{2015}$ of the set $\{1, 2,..., 1000\}$ such that $|A_i| \ge 2$ for every $i \ge 1$ and $|A_i \cap A_j| \ge 1$ for every $1 \le i < j \le 2015$. Prove that $k = 3$ is the smallest number of colors such that we can always color the elements of the set $\{1, 2,..., 1000\}$ by $k$ colors with the property that the subset $A_i$ has at least two elements of different colors for every $i \ge 1$.
Lê Anh Vinh
Solve system of equations
$$\begin{cases} x+\dfrac{x+y}{x^2+y^2}=1
\\ x+\dfrac{x-y}{x^2+y^2}=2
\end{cases}$$