Found problems: 85335
Suppose that we have $n$ events $A_1,\dots, A_n,$ each of which has probability at least $1-a$ of occuring, where $a<1/4.$ Further suppose that $A_i$ and $A_j$ are mutually independent if $|i-j|>1.$ Assume as known that the recurrence $u_{k+1}=u_k-au_{k-1}, u_0=1, u_1=1-a,$ defines positive real numb $u_k$ for $k=0,1,\dots.$ Show that the probability of all of $A_1,\dots, A_n$ occuring is at least $u_n.$
Given triangle $ABC$, squares $ABEF, BCGH, CAIJ$ are constructed externally on side $AB, BC, CA$, respectively. Let $AH \cap BJ = P_1$, $BJ \cap CF = Q_1$, $CF \cap AH = R_1$, $AG \cap CE = P_2$, $BI \cap AG = Q_2$, $CE \cap BI = R_2$. Prove that triangle $P_1 Q_1 R_1$ is congruent to triangle $P_2 Q_2 R_2$.
Given any triangle $ABC$ and any positive integer $n$, we say that $n$ is a [i]decomposable[/i] number for triangle $ABC$ if there exists a decomposition of the triangle $ABC$ into $n$ subtriangles with each subtriangle similar to $\triangle ABC$. Determine the positive integers that are decomposable numbers for every triangle.
Given is that $x, y, z$ are real numbers, different from 0, $x$ and $z$ are different, such that
$(x+y) ^2+(2-xy)=9$ and $(y+z) ^2-(3+yz)=4$
Find the value of $A=(x/y+y^2/x^2+z^3/x^2y)(y/z+z^2/y^2+x^3/y^2z)(z/x+x^2/z^2+y^3/z^2x)=?$
In $\triangle ABC$, $BC=4$ and $CA=6$. If the perimeter of the triangle is $4$ times the length of side
$BC$, what is the length of $AB$?
Let $\mathcal{S}$ be the set of real numbers that can be represented as repeating decimals of the form $0.\overline{abc}$ where $a, b, c$ are distinct digits. Find the sum of the elements of $\mathcal{S}$.
Let $a$, $b$, and $c$ be the solutions of the equation $$x^3 - 3 \cdot 2021^2x = 2 \cdot 20213.$$ Compute $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}.$
Suppose that $n$ is s positive integer. Determine all the possible values of the first digit after the decimal point in the decimal expression of the number $\sqrt{n^3+2n^2+n}$
(a) Is there a polynomial $P(x)$ with real coefficients such that $P\left(\frac1k\right)=\frac{k+2}k$ for all positive integers $k$?
(b) Is there a polynomial $P(x)$ with real coefficients such that $P\left(\frac1k\right)=\frac1{2k+1}$ for all positive integers $k$?
There are $2022$ numbers arranged in a circle $a_1, a_2, . . ,a_{2022}$. It turned out that for any three consecutive $a_i$, $a_{i+1}$, $a_{i+2}$ the equality $a_i =\sqrt2 a_{i+2} - \sqrt3 a_{i+1}$. Prove that $\sum^{2022}_{i=1} a_ia_{i+2} = 0$, if we know that $a_{2023} = a_1$, $a_{2024} = a_2$.
The $19$ numbers $472$ , $473$ , $...$ , $490$ are juxtaposed in some order to form a $57$-digit number. Can any of the numbers thus obtained be prime?
Find the number of functions $ A\stackrel{f}{\longrightarrow } A $ for which there exist two functions $ A\stackrel{g}{\longrightarrow } B\stackrel{h}{\longrightarrow } A $ having the properties that $ g\circ h =\text{id.} $ and $ h\circ g=f, $ where $ B $ and $ A $ are two finite sets.
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
We are given 5040 balls in k different colors, where the number of balls of each color is the same. The balls are put into 2520 bags so that each bag contains two balls of different colors. Find the smallest k such that, however the balls are distributed into the bags, we can arrange the bags around a circle so that no two balls of the same color are in two neighboring bags.
Let $a$, $b$, $c$ be the lengths of the sides of a triangle. Prove that
\[ \sqrt{a+b-c} + \sqrt{b+c-a} + \sqrt{c+a-b} \leq \sqrt{a} + \sqrt{b} + \sqrt{c} \]
and determine when equality occurs.
Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called [i]beautiful[/i] if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$.
Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that $$M = N + 1.$$
The numbers $1$ to $n^2$ are written in an n×n squared paper in the usual ordering. Any sequence of right and downwards steps from a square to an adjacent one (by side) starting at square $1$ and ending at square $n^2$ is called a path. Denote by $L(C)$ the sum of the numbers through which path $C$ goes.
(a) For a fixed $n$, let $M$ and $m$ be the largest and smallest $L(C)$ possible. Prove that $M-m$ is a perfect cube.
(b) Prove that for no $n$ can one find a path $C$ with $L(C ) = 1996$.
Let $P$ be the product of the roots of $z^6+z^4+z^3+z^2+1=0$ that have positive imaginary part, and suppose that $P=r(\cos \theta^\circ+i\sin \theta^\circ),$ where $0<r$ and $0\le \theta <360.$ Find $\theta.$
Let $a, b, c$ be two-digit, three-digit, and four-digit numbers, respectively. Assume that the sum of all digits of number $a+b$, and the sum of all digits of $b + c$ are all equal to $2$. The largest value of $a + b + c$ is
(A): $1099$ (B): $2099$ (C): $1199$ (D): $2199$ (E): None of the above.
A circle with center $O$ is drawn in the first quadrant of the 2D Cartesian plane (the quadrant with both positive $x$ and $y$ values) such that it lies tangent to the $x$ and $y$-axes. A line is drawn with slope $m>1$ and passing through the origin; the line intersects the circle at two points $A$ and $B$, with $A$ closer to the origin than $B$. Suppose that $ABO$ is an equilateral triangle. Compute $m$.
Denote $\mathbb{Z}_{>0}=\{1,2,3,...\}$ the set of all positive integers. Determine all functions $f:\mathbb{Z}_{>0}\rightarrow \mathbb{Z}_{>0}$ such that, for each positive integer $n$,
$\hspace{1cm}i) \sum_{k=1}^{n}f(k)$ is a perfect square, and
$\vspace{0.1cm}$
$\hspace{1cm}ii) f(n)$ divides $n^3$.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $A$, $B$, $C$, and $D$ be points on a circle such that $AB=11$ and $CD=19$. Point $P$ is on segment $AB$ with $AP=6$, and $Q$ is on segment $CD$ with $CQ=7$. The line through $P$ and $Q$ intersects the circle at $X$ and $Y$. If $PQ=27$, find $XY$.
A sequence $a_n$ satisfies $a_1 =2t-3$ ($t \ne 1,-1$), and $a_{n+1}=\dfrac{(2t^{n+1}-3)a_n+2(t-1)t^n-1}{a_n+2t^n-1}$.
[list]
[b][i]i)[/i][/b] Find $a_n$,
[b][i]ii)[/i][/b] If $t>0$, compare $a_{n+1}$ with $a_n$.[/list]
a) Determine all 4-tuples $(x_0,x_1,x_2,x_3)$ of pairwise distinct intergers such that each $x_k$ is coprime to $x_{k+1}$(indices reduces modulo 4) and the cyclic sum $\frac{x_0}{x_1}+\frac{x_1}{x_2}+\frac{x_2}{x_3}+\frac{x_3}{x_1}$ is an interger.
b)Show that there are infinitely many 5-tuples $(x_0,x_1,x_2,x_3,x_4)$ of pairwise distinct intergers such that each $x_k$ is coprime to $x_{k+1}$(indices reduces modulo 5) and the cyclic sum $\frac{x_0}{x_1}+\frac{x_1}{x_2}+\frac{x_2}{x_3}+\frac{x_3}{x_4}+\frac{x_4}{x_0}$ is an interger.
Let $V$ be a set of eight points in $3\text{D}$ space that are the vertices of a cube with side length $1$. Compute the number of ways we can color the vertices in $V$ yellow or blue such that
[list]
[*] each vertex receives exactly one color, and [/*]
[*] there exists a point in $3\text{D}$ space whose distance to each yellow vertex is less than $1$ and whose distance to each blue vertex is greater than $1$. [/*]
[/list]