Found problems: 85335
In a bag of marbles, $\frac{3}{5}$ of the marbles are blue and the rest are red. If the number of red marbles is doubled and the number of blue marbles stays the same, what fraction of the marbles will be red?
$ \textbf{(A)}\ \dfrac{2}{5}
\qquad\textbf{(B)}\ \dfrac{3}{7}
\qquad\textbf{(C)}\ \dfrac{4}{7}
\qquad\textbf{(D)}\ \dfrac{3}{5}
\qquad\textbf{(E)}\ \dfrac{4}{5}
$
Represent the number $\sqrt[3]{1342\sqrt{167}+2005}$ in the form where it contains only addition, subtraction, multiplication, division and square roots.
Two types of pieces, bishops and rooks, are to be placed on a $10\times 10$ chessboard (without necessarily filling it) such that each piece occupies exactly one square of the board. A bishop $B$ is said to [i]attack[/i] a piece $P$ if $B$ and $P$ are on the same diagonal and there are no pieces between $B$ and $P$ on that diagonal; a rook $R$ is said to attack a piece $P$ if $R$ and $P$ are on the same row or column and there are no pieces between $R$ and $P$ on that row or column.
A piece $P$ is [i]chocolate[/i] if no other piece $Q$ attacks $P$.
What is the maximum number of chocolate pieces there may be, after placing some pieces on the chessboard?
[i]Proposed by José Alejandro Reyes González[/i]
An equilateral triangle $ABC$ with center $O$ and radius $OA = R$ is given, and consider the seven regions that the lines of the sides determine on the plane. It is asked to draw and describe the region of the plane transformed from the two shaded regions in the attached figure, by the inversion of center $O$ and power $R^2$.
[img]https://cdn.artofproblemsolving.com/attachments/e/c/bf1cb12c961467d216d54885f3387b328ce744.png[/img]
Let $x, y, z$ be real numbers such that
$$x+y+z=2, \;\;\;\; xy+yz+zx=1$$
Find the maximum possible value of $x-y$.
Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition
\[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \]
for all $a,b \in \mathbb{Z}_{p^n}.$
Let $a$ ,$b$ and $c$ be distinct real numbers.
$a)$ Determine value of $ \frac{1+ab }{a-b} \cdot \frac{1+bc }{b-c} + \frac{1+bc }{b-c} \cdot \frac{1+ca }{c-a} + \frac{1+ca }{c-a} \cdot \frac{1+ab}{a-b} $
$b)$ Determine value of $ \frac{1-ab }{a-b} \cdot \frac{1-bc }{b-c} + \frac{1-bc }{b-c} \cdot \frac{1-ca }{c-a} + \frac{1-ca }{c-a} \cdot \frac{1-ab}{a-b} $
$c)$ Prove the following ineqaulity
$ \frac{1+a^2b^2 }{(a-b)^2} + \frac{1+b^2c^2 }{(b-c)^2} + \frac{1+c^2a^2 }{(c-a)^2} \geq \frac{3}{2} $
When does eqaulity holds?
Given an acute-angled $\vartriangle ABC$ with orthocenter $H$ and altitude $CC_1$. Points $D, E$ and $F$ lie on the segments $AC$, $BC$ and $AB$ respectively, so that $DE \parallel AB$ and $EF \parallel AC$. Denote by $Q$ the symmetric point of $H$ wrt to the midpoint of $DE$. Let $BD \cap CF = P$. If $HP \parallel AB$, prove that the points $C_1, D, Q$ and $E$ lie on a circle.
1. Let $ABC$ be an acute-angled triangle with $AB\neq AC$. The circle with diameter $BC$ intersects the sides $AB$ and $AC$ at $M$ and $N$ respectively. Denote by $O$ the midpoint of the side $BC$. The bisectors of the angles $\angle BAC$ and $\angle MON$ intersect at $R$. Prove that the circumcircles of the triangles $BMR$ and $CNR$ have a common point lying on the side $BC$.
[b]10.[/b] Let $X_1, X_2, \dots $ be independent random variables with the same distribution
$P(X_i = 1) = P(X_i = -1)=\frac{1}{2}\qquad (i= 1, 2, \dots )$
Define
$S_0=0, Sn=X_1 +X_2+\dots +X_n \qquad (n=1, 2, \dots$ ),
$\xi (x,n) = \left | \{k : 0 \leq k \leq n, S_k= x \} \right |\qquad (x=0, \pm 1, \pm 2, \dots $),
and
$\alpha(n)= \left | \{ x: \xi(x,n)=a \} \right |\qquad (n=0,1,\dots$).
Prove that
$P(\lim \inf \alpha(n)=0) =1$
and that there is a number $0<c<\infty$ such that $P(\lim \inf \alpha(n)/\log n=c) =1$
([b]P.24[/b])
[P. Révész]
A parallelogram $ABCD$ is given. On the diagonal BD, a point $P$ is selected such that $AP = BD$ is satisfied. Point $Q$ is the midpoint of segment $CP$. Prove that $\angle BQD = 90^o$.
[img]https://cdn.artofproblemsolving.com/attachments/2/0/4bc69ec0330e2afa6b560c56da5dd783b16efb.png[/img]
.
Let $ABC$ be an acute triangle inscribed in a circle $\omega$ with center $O$. Points $E$, $F$ lie on its side $AC$, $AB$, respectively, such that $O$ lies on $EF$ and $BCEF$ is cyclic. Let $R$, $S$ be the intersections of $EF$ with the shorter arcs $AB$, $AC$ of $\omega$, respectively. Suppose $K$, $L$ are the reflection of $R$ about $C$ and the reflection of $S$ about $B$, respectively. Suppose that points $P$ and $Q$ lie on the lines $BS$ and $RC$, respectively, such that $PK$ and $QL$ are perpendicular to $BC$. Prove that the circle with center $P$ and radius $PK$ is tangent to the circumcircle of $RCE$ if and only if the circle with center $Q$ and radius $QL$ is tangent to the circumcircle of $BFS$.
[i]Proposed by Mehran Talaei[/i]
On a $999\times 999$ board a [i]limp rook[/i] can move in the following way: From any square it can move to any of its adjacent squares, i.e. a square having a common side with it, and every move must be a turn, i.e. the directions of any two consecutive moves must be perpendicular. A [i]non-intersecting route[/i] of the limp rook consists of a sequence of pairwise different squares that the limp rook can visit in that order by an admissible sequence of moves. Such a non-intersecting route is called [i]cyclic[/i], if the limp rook can, after reaching the last square of the route, move directly to the first square of the route and start over.
How many squares does the longest possible cyclic, non-intersecting route of a limp rook visit?
[i]Proposed by Nikolay Beluhov, Bulgaria[/i]
King Radford of Peiza is hosting a banquet in his palace. The King has an enormous circular table with $2021$ chairs around it. At The King's birthday celebration, he is sitting in his throne (one of the $2021$ chairs) and the other $2020$ chairs are filled with guests, with the shortest guest sitting to the King's left and the remaining guests seated in increasing order of height from there around the table. The King announces that everybody else must get up from their chairs, run around the table, and sit back down in some chair. After doing this, The King notices that the person seated to his left is different from the person who was previously seated to his left. Each other person at the table also notices that the person sitting to their left is different.
Find a closed form expression for the number of ways the people could be sitting around the table at the end. You may use the notation $D_{n},$ the number of derangements of a set of size $n$, as part of your expression.
Dan the dog spots Cate the cat 50m away. At that instant, Cate begins running away from Dan at 6 m/s, and Dan begins running toward Cate at 8 m/s. Both of them accelerate instantaneously and run in straight lines. Compute the number of seconds it takes for Dan to reach Cate.
[i]Proposed by Eugene Chen[/i]
we named a $n*n$ table $selfish$ if we number the row and column with $0,1,2,3,...,n-1$.(from left to right an from up to down)
for every {$ i,j\in{0,1,2,...,n-1}$} the number of cell $(i,j)$ is equal to the number of number $i$ in the row $j$.
for example we have such table for $n=5$
1 0 3 3 4
1 3 2 1 1
0 1 0 1 0
2 1 0 0 0
1 0 0 0 0
prove that for $n>5$ there is no $selfish$ table
Let $x_1=2021$, $x_n^2-2(x_n+1)x_{n+1}+2021=0$ ($n\geq1$). Prove that the sequence ${x_n}$ converges. Find the limit $\lim_{n \to \infty} x_n$.
Show that, if $m$ and $n$ are non-zero integers of like parity, and $n^2 -1$ is divisible by $m^2 - n^2 + 1$, then $m^2 - n^2 + 1$ is the square of an integer.
Amer. Math. Monthly
For an ordered $10$-tuple of nonnegative integers $a_1,a_2,\ldots, a_{10}$, we denote
\[f(a_1,a_2,\ldots,a_{10})=\left(\prod_{i=1}^{10} {\binom{20-(a_1+a_2+\cdots+a_{i-1})}{a_i}}\right) \cdot \left(\sum_{i=1}^{10} {\binom{18+i}{19}}a_i\right).\] When $i=1$, we take $a_1+a_2+\cdots+a_{i-1}$ to be $0$. Let $N$ be the average of $f(a_1,a_2,\ldots,a_{10})$ over all $10$-tuples of nonnegative integers $a_1,a_2,\ldots, a_{10}$ satisfying
\[a_1+a_2+\cdots+a_{10}=20.\]
Compute the number of positive integer divisors of $N$.
[i]2021 CCA Math Bonanza Individual Round #14[/i]
Let $ABCD$ be a parallelogram with $\angle BAD < 90^{\circ}$. A circle tangent to sides $\overline{DA}$, $\overline{AB}$, and $\overline{BC}$ intersects diagonal $\overline{AC}$ at points $P$ and $Q$ with $AP < AQ$, as shown. Suppose that $AP = 3$, $PQ = 9$, and $QC = 16$. Then the area of $ABCD$ can be expressed in the form $m\sqrt n$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$.
[asy]
defaultpen(linewidth(0.6)+fontsize(11));
size(8cm);
pair A,B,C,D,P,Q;
A=(0,0);
label("$A$", A, SW);
B=(6,15);
label("$B$", B, NW);
C=(30,15);
label("$C$", C, NE);
D=(24,0);
label("$D$", D, SE);
P=(5.2,2.6);
label("$P$", (5.8,2.6), N);
Q=(18.3,9.1);
label("$Q$", (18.1,9.7), W);
draw(A--B--C--D--cycle);
draw(C--A);
draw(Circle((10.95,7.45), 7.45));
dot(A^^B^^C^^D^^P^^Q);
[/asy]
Determine $$ \left|\prod^{10}_{k=1}(e^{\frac{i \pi}{2^k}}+ 1) \right|$$
Each of the squares in a $50 \times 50$ square board is filled with a number from $1$ to $50$ so that each of the numbers $1,2, ..., 50$ appears exactly $50$ times. Prove that there is a row or a column containing at least $8$ distinct numbers.
Determine all functions $f : R \to R$ satisfying $f(f(x) + xf(y))= 3f(x) + 4xy$ for all real numbers $x,y$.
Let \( x \), \( y \), \( p \) be positive integers that satisfy the equation \( x^4 = p + 9y^4 \), where \( p \) is a prime number. Show that \( \frac{p^2 - 1}{3} \) is a perfect square and a multiple of 16.
Let $a_0, a_1, \ldots, a_{10}$ be integers such that, for each $i \in \{0,1,\ldots,2047\}$, there exists a subset $S \subseteq \{0,1,\ldots,10\}$ with
\[
\sum_{j \in S} a_j \equiv i \pmod{2048}.
\]
Show that for each $i \in \{0,1,\ldots,10\}$, there is exactly one $j \in \{0,1,\ldots,10\}$ such that $a_j$ is divisible by $2^i$ but not by $2^{i+1}$.
Note: $\sum_{j \in S} a_j$ is the summation notation, for instance, $\sum_{j \in \{2,5\}} a_j = a_2 + a_5$, while for the empty set $\varnothing$, one defines $\sum_{j \in \varnothing} a_j = 0$.