Found problems: 373
The set $ \{a_0, a_1, \ldots, a_n\}$ of real numbers satisfies the following conditions:
[b](i)[/b] $ a_0 \equal{} a_n \equal{} 0,$
[b](ii)[/b] for $ 1 \leq k \leq n \minus{} 1,$ \[ a_k \equal{} c \plus{} \sum^{n\minus{}1}_{i\equal{}k} a_{i\minus{}k} \cdot \left(a_i \plus{} a_{i\plus{}1} \right)\]
Prove that $ c \leq \frac{1}{4n}.$
If
\[
\sum_{n=1}^{\infty}\frac{\frac11 + \frac12 + \dots + \frac 1n}{\binom{n+100}{100}} = \frac pq
\]
for relatively prime positive integers $p,q$, find $p+q$.
[i]Proposed by Michael Kural[/i]
When a function $f(x)$ is differentiated $n$ times ,the function we get id denoted $f^n(x)$.If $f(x)=\dfrac {e^x}{x}$.Find the value of
\[\lim_{n \to \infty} \dfrac {f^ {2n}(1)}{(2n)!}\]
Let $n$ be a fixed positive integer. How many ways are there to write $n$ as a sum of positive integers,
\[n = a_1 + a_2 + \cdots a_k\]
with $k$ an arbitrary positive integer and $a_1 \le a_2 \le \cdots \le a_k \le a_1 + 1$? For example, with $n = 4$, there are four ways: $4$, $2 + 2$, $1 + 1 + 2$, $1 + 1 + 1 + 1$.
Let $a_0=5/2$ and $a_k=a_{k-1}^2-2$ for $k\ge 1.$ Compute \[\prod_{k=0}^{\infty}\left(1-\frac1{a_k}\right)\] in closed form.
Let $ABCD$ be a unit square. Let $Q_1$ be the midpoint of $\overline{CD}$. For $i=1,2,\dots,$ let $P_i$ be the intersection of $\overline{AQ_i}$ and $\overline{BD}$, and let $Q_{i+1}$ be the foot of the perpendicular from $P_i$ to $\overline{CD}$. What is
$$\sum_{i=1}^{\infty} \text{Area of } \triangle DQ_i P_i \, ?$$
$\textbf{(A)}\ \frac{1}{6} \qquad
\textbf{(B)}\ \frac{1}{4} \qquad
\textbf{(C)}\ \frac{1}{3} \qquad
\textbf{(D)}\ \frac{1}{2} \qquad
\textbf{(E)}\ 1$
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Find the sum of the decimal digits of the number
\[ 5\sum_{k=1}^{99} k(k + 1)(k^2 + k + 1). \]
[i]Proposed by Robin Park[/i]
Let $a < b < c < d < e$ be positive integers. Prove that
$$\frac{1}{[a, b]} + \frac{1}{[b, c]} + \frac{1}{[c, d]} + \frac{2}{[d, e]} \le 1$$
where $[x, y]$ is the least common multiple of $x$ and $y$ (e.g., $[6, 10] = 30$). When does equality hold?
Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red.
Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$
[I]Netherlands[/i]
Consider the sequence $x_n>0$ defined with the following recurrence relation:
\[x_1 = 0\]
and for $n>1$ \[(n+1)^2x_{n+1}^2 + (2^n+4)(n+1)x_{n+1}+ 2^{n+1}+2^{2n-2} = 9n^2x_n^2+36nx_n+32.\]
Show that if $n$ is a prime number larger or equal to $5$, then $x_n$ is an integer.
Find all polynomilals $P$ with real coefficients, such that
$(x+1)P(x-1)+(x-1)P(x+1)=2xP(x)$
Simplify the product
\[
\prod_{m=1}^{100}\prod_{n=1}^{100}\frac{x^{n+m}+x^{n+m+2}+x^{2n+1}+x^{2m+1}}{x^{2n}+2x^{n+m}+x^{2m}}
\]
Express your answer in terms of $x$.
Suppose that $g$ and $h$ are polynomials of degree $10$ with integer coefficients such that $g(2) < h(2)$ and
\[ g(x) h(x)
= \sum_{k=0}^{10} \left( \binom{k+11}{k} x^{20-k} - \binom{21-k}{11} x^{k-1} + \binom{21}{11}x^{k-1} \right) \]
holds for all nonzero real numbers $x$. Find $g(2)$.
[i]Proposed by Yang Liu[/i]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Let $n$ be a natural number. Prove that \[ \left\lfloor \frac{n+2^0}{2^1} \right\rfloor + \left\lfloor \frac{n+2^1}{2^2} \right\rfloor +\cdots +\left\lfloor \frac{n+2^{n-1}}{2^n}\right\rfloor =n. \]
[hide="Remark"]For any real number $x$, the number $\lfloor x \rfloor$ represents the largest integer smaller or equal with $x$.[/hide]
For a positive integer $N$, let $f_N$ be the function defined by
\[ f_N (x)=\sum_{n=0}^N \frac{N+1/2-n}{(N+1)(2n+1)} \sin\left((2n+1)x \right). \]
Determine the smallest constant $M$ such that $f_N (x)\le M$ for all $N$ and all real $x$.
Given that $\sum_{k=1}^{35}\sin 5k=\tan \frac mn,$ where angles are measured in degrees, and $m$ and $n$ are relatively prime positive integers that satisfy $\frac mn<90,$ find $m+n.$
Find the sum of all $x$ from $2$ to $1000$ inclusive such that $$\prod_{n=2}^x \log_{n^n}(n+1)^{n+2}$$ is an integer.
[i]Proposed by Deyuan Li and Andrew Milas[/i]
For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$
[i]Proposed by Shahjalal Shohag, Bangladesh[/i]
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
A beam of light strikes $\overline{BC}$ at point $C$ with angle of incidence $\alpha=19.94^\circ$ and reflects with an equal angle of reflection as shown. The light beam continues its path, reflecting off line segments $\overline{AB}$ and $\overline{BC}$ according to the rule: angle of incidence equals angle of reflection. Given that $\beta=\alpha/10=1.994^\circ$ and $AB=AC,$ determine the number of times the light beam will bounce off the two line segments. Include the first reflection at $C$ in your count.
[asy]
size(250);defaultpen(linewidth(0.7));
real alpha=24, beta=32;
pair B=origin, C=(1,0), A=dir(beta), D=C+0.5*dir(alpha);
pair EE=2*dir(180-alpha), E=intersectionpoint(C--EE, A--B);
pair EEE=reflect(B,A)*EE, EEEE=reflect(C,B)*EEE, F=intersectionpoint(E--EEE, B--C), G=intersectionpoint(F--EEEE, A--B);
draw((1.4,0)--B--1.4*dir(beta));
draw(D--C, linetype("4 4"),EndArrow(5));
draw(C--E, linetype("4 4"),EndArrow(5));
draw(E--F, linetype("4 4"),EndArrow(5));
draw(F--G, linetype("4 4"),EndArrow(5));
markscalefactor=0.01;
draw(anglemark(C,B,A));
draw(anglemark((1.4,0), C,D));
label("$\beta$", 0.07*dir(beta/2), dir(beta/2), fontsize(10));
label("$\alpha$", C+0.07*dir(alpha/2), dir(alpha/2), fontsize(10));
label("$A$", A, dir(90)*dir(A));
label("$B$", B, dir(beta/2+180));
label("$C$", C, S);[/asy]
Find all integers $n \geq 3$ such that among any $n$ positive real numbers $a_1, a_2, \hdots, a_n$ with $\text{max}(a_1,a_2,\hdots,a_n) \leq n \cdot \text{min}(a_1,a_2,\hdots,a_n)$, there exist three that are the side lengths of an acute triangle.