Found problems: 85335
[u]Round 1[/u]
[b]p1. [/b] What is the sum of the digits in the binary representation of $2023$?
[b]p2.[/b] Jack is buying fruits at the EMCCmart. Three apples and two bananas cost $\$11.00$. Five apples and four bananas cost $\$19.00$. In cents, how much more does an apple cost than a banana?
[b]p3.[/b] Define $a \sim b$ as $a! - ab$. What is $(4 \sim 5) \sim (5 \sim (3 \sim 1))$?
[u] Round 2[/u]
[b]p4.[/b] Alan has $24$ socks in his drawer. Of these socks, $4$ are red, $8$ are blue, and $12$ are green. Alan takes out socks one at a time from his drawer at random. What is the minimum number of socks he must pull out to guarantee that the number of green socks is at least twice the number of red socks?
[b]p5.[/b] What is the remainder when the square of the $24$th smallest prime number is divided by $24$?
[b]p6.[/b] A cube and a sphere have the same volume. If $k$ is the ratio of the length of the longest diagonal of the cube to the diameter of the sphere, find $k^6$.
[u]Round 3[/u]
[b]p7.[/b] Equilateral triangle $ABC$ has side length $3\sqrt3$. Point $D$ is drawn such that $BD$ is tangent to the circumcircle of triangle $ABC$ and $BD = 4$. Find the distance from the circumcenter of triangle $ABC$ to $D$.
[b]p8.[/b] If $\frac{2023!}{2^k}$ is an odd integer for an integer $k$, what is the value of $k$?
[b]p9.[/b] Let $S$ be a set of 6 distinct positive integers. If the sum of the three smallest elements of $S$ is $8$, and the sum of the three largest elements of $S$ is $19$, find the product of the elements in $S$.
[u]Round 4[/u]
[b]p10.[/b] For some integers $b$, the number $1 + 2b + 3b^2 + 4b^3 + 5b^4$ is divisible by $b + 1$. Find the largest possible value of $b$.
[b]p11.[/b] Let $a, b, c$ be the roots of cubic equation $x^3 + 7x^2 + 8x + 1$. Find $a^2 + b^2 + c^2 + \frac{1}{a} + \frac{1}{b} + \frac{1}{c}$
[b]p12.[/b] Let $C$ be the set of real numbers $c$ such that there are exactly two integers n satisfying $2c < n < 3c$. Find the expected value of a number chosen uniformly at random from $C$.
PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3131590p28370327]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Triangle $AB_0C_0$ has side lengths $AB_0 = 12$, $B_0C_0 = 17$, and $C_0A = 25$. For each positive integer $n$, points $B_n$ and $C_n$ are located on $\overline{AB_{n-1}}$ and $\overline{AC_{n-1}}$, respectively, creating three similar triangles $\triangle AB_nC_n \sim \triangle B_{n-1}C_nC_{n-1} \sim \triangle AB_{n-1}C_{n-1}$. The area of the union of all triangles $B_{n-1}C_nB_n$ for $n\geq1$ can be expressed as $\tfrac pq$, where $p$ and $q$ are relatively prime positive integers. Find $q$.
An object has the shape of a square and has side length $a$. Light beams are shone on the object from a big machine. If $m$ is the mass of the object, $P$ is the power $\emph{per unit area}$ of the photons, $c$ is the speed of light, and $g$ is the acceleration of gravity, prove that the minimum value of $P$ such that the bar levitates due to the light beams is \[ P = \dfrac {4cmg}{5a^2}. \]
[i]Problem proposed by Trung Phan[/i]
Let $ABC$ be an acute-angled triangle with $AC<BC.$ A circle passes through $A$ and $B$ and crosses the segments $AC$ and $BC$ again at $A_1$ and $B_1$ respectively. The circumcircles of $A_1B_1C$ and $ABC$ meet each other at points $P$ and $C.$ The segments $AB_1$ and $A_1B$ intersect at $S.$ Let $Q$ and $R$ be the reflections of $S$ in the lines $CA$ and $CB$ respectively. Prove that the points $P,$ $Q,$ $R,$ and $C$ are concyclic.
Let $O$ be the center of the circle circumscribed around the the triangle $ABC$. The centers of the circles circumscribed around the squares $OAB,OBC,OCA$ lie at the vertices of a regular triangle. Prove that the triangle $ABC$ is right.
Let be a tetahedron $ ABCD, $ and $ E $ be the projection of $ D $ on the plane formed by $ ABC. $ If $ \mathcal{A}_{\mathcal{R}} $ denotes the area of the region $ \mathcal{R}, $ show that the following affirmations are equivalent:
[b]a)[/b] $ C=E\vee CE\parallel AB $
[b]b)[/b] $ M\in\overline{CD}\implies\mathcal{A}_{ABM}^2=\frac{CM^2}{CD^2}\cdot\mathcal{A}_{ABD}^2 +\left( 1-\frac{CM^2}{CD^2}\right)\cdot\mathcal{A}_{ABC}^2 $
Prove that a positive integer of the form $n^4 +1$ can have more than $1000$ divisors of the form $a^4 +1$ with integral $a$.
In an acute-angled triangle $ABC$ is $AB > BC$ , and the points $A_1$ and $C_1$ are the feet of the altitudes of from the vertices $A$ and $C$. Let $D$ be the second intersection of the circumcircles of triangles $ABC$ and $A_1BC_1$ (different of $B$). Let $Z$ be the intersection of the tangents to the circumcircle of the triangle ABC at the points $A$ and $C$ , and let the lines $ZA$ and $A_1C_1$ intersect at the point $X$, and the lines $ZC$ and $A_1C_1$ intersect at the point $Y$. Prove that the point $D$ lies on the circumcircle of the triangle $XYZ$.
\[\int_0^{2022} \{x\lfloor x \rfloor\}\,\mathrm dx\]
[i]Proposed by Connor Gordon[/i]
The sum of the numbers $a,b$ and $c$ is zero, and their product is negative.
Prove that the number $\frac{a^2+b^2}{c}+\frac{b^2+c^2}{a}+\frac{c^2+a^2}{b}$ is positive.
Triangle $ABC$ has side lengths $AB = 11, BC=24$, and $CA = 20$. The bisector of $\angle{BAC}$ intersects $\overline{BC}$ in point $D$, and intersects the circumcircle of $\triangle{ABC}$ in point $E \ne A$. The circumcircle of $\triangle{BED}$ intersects the line $AB$ in points $B$ and $F \ne B$. What is $CF$?
$\textbf{(A) } 28 \qquad \textbf{(B) } 20\sqrt{2} \qquad \textbf{(C) } 30 \qquad \textbf{(D) } 32 \qquad \textbf{(E) } 20\sqrt{3}$
In the plane we are given two circles intersecting at $ X$ and $ Y$. Prove that there exist four points with the following property:
(P) For every circle touching the two given circles at $ A$ and $ B$, and meeting the line $ XY$ at $ C$ and $ D$, each of the lines $ AC$, $ AD$, $ BC$, $ BD$ passes through one of these points.
Let $K$ and $N > K$ be fixed positive integers. Let $n$ be a positive integer and let $a_1, a_2, ..., a_n$ be distinct integers. Suppose that whenever $m_1, m_2, ..., m_n$ are integers, not all equal to $0$, such that $\mid{m_i}\mid \le K$ for each $i$, then the sum
$$\sum_{i = 1}^{n} m_ia_i$$
is not divisible by $N$. What is the largest possible value of $n$?
[i]Proposed by Ilija Jovcevski, North Macedonia[/i]
Find the number of ordered pairs $(x,y)$, where $x$ and $y$ are both integers between $1$ and $9$, inclusive, such that the product $x\times y$ ends in the digit $5$.
[i]Proposed by Andrew Wen[/i]
All $n+3$ offices of University of Somewhere are numbered with numbers $0,1,2, \ldots ,$ $n+1,$ $n+2$ for some $n \in \mathbb{N}$. One day, Professor $D$ came up with a polynomial with real coefficients and power $n$. Then, on the door of every office he wrote the value of that polynomial evaluated in the number assigned to that office. On the $i$th office, for $i$ $\in$ $\{0,1, \ldots, n+1 \}$ he wrote $2^i$ and on the $(n+2)$th office he wrote $2^{n+2}$ $-n-3$.
[list=a]
[*] Prove that Professor D made a calculation error
[*] Assuming that Professor D made a calculation error, what is the smallest number of errors he made? Prove that in this case the errors are uniquely determined, find them and correct them.
[/list]
Let \(\mathbb R_{>0}\) denote the set of positive real numbers and \(\mathbb R_{\ge0}\) the set of nonnegative real numbers. Find all functions \(f:\mathbb R\times \mathbb R_{>0}\to \mathbb R_{\ge0}\) such that for all real numbers \(a\), \(b\), \(x\), \(y\) with \(x,y>0\), we have \[f(a,x)+f(b,y)=f(a+b,x+y)+f(ay-bx,xy(x+y)).\]
[i]Proposed by Luke Robitaille[/i]
Find the minimum value of $ 2x^2\plus{}2y^2\plus{}5z^2\minus{}2xy\minus{}4yz\minus{}4x\minus{}2z\plus{}15$ for real numbers $ x$, $ y$, $ z$.
A rectangular array has $ n$ rows and $ 6$ columns, where $ n \geq 2$. In each cell there is written either $ 0$ or $ 1$. All rows in the array are different from each other. For each two rows $ (x_{1},x_{2},x_{3},x_{4},x_{5},x_{6})$ and $ (y_{1},y_{2},y_{3},y_{4},y_{5},y_{6})$, the row $ (x_{1}y_{1},x_{2}y_{2},x_{3}y_{3},x_{4}y_{4},x_{5}y_{5},x_{6}y_{6})$ can be found in the array as well. Prove that there is a column in which at least half of the entries are zeros.
Source: 1976 Euclid Part B Problem 4
-----
The remainder when $f(x)=x^5-2x^4+ax^3-x^2+bx-2$ is divided by $x+1$ is $-7$. When $f(x)$ is divided by $x-2$ the remainder is $32$. Determine the remainder when $f(x)$ is divided by $x-1$.
If $a+b=b-c=c-a=3$, find $a+b+c$.
$\text{(A) }3\qquad\text{(B) }4\frac{1}{2}\qquad\text{(C) }6\qquad\text{(D) }7\frac{1}{2}\qquad\text{(E) }9$
Given $n\in\mathbb N_+,n\ge 3,a_1,a_2,\cdots ,a_n\in\mathbb R_+.$ Let $b_1,b_2,\cdots ,b_n\in\mathbb R_+$ satisfy that for $\forall k\in\{1,2,\cdots ,n\},$
$$\sum_{\substack{i,j\in\{1,2,\cdots ,n\}\backslash \{k\}\\i\neq j}}a_ib_j=0.$$
Prove that $b_1=b_2=\cdots =b_n=0.$
Given a tetrahedron $ABCD$, $E$, $F$, $G$, are on the respectively on the segments $AB$, $AC$ and $AD$. Prove that:
i) area $EFG \leq$ max{area $ABC$,area $ABD$,area $ACD$,area $BCD$}.
ii) The same as above replacing "area" for "perimeter".
Suppose that each of the 5 persons knows a piece of information, each piece is different, about a certain event. Each time person $A$ calls person $B$, $A$ gives $B$ all the information that $A$ knows at that moment about the event, while $B$ does not say to $A$ anything that he knew.
(a) What is the minimum number of calls are necessary so that everyone knows about the event?
(b) How many calls are necessary if there were $n$ persons?
Let $a_0$ be a positive integer. Define the sequence $\{a_n\}_{n \geq 0}$ as follows: if \[ a_n = \sum_{i = 0}^jc_i10^i \] where $c_i \in \{0,1,2,\cdots,9\}$, then \[ a_{n + 1} = c_0^{2005} + c_1^{2005} + \cdots + c_j^{2005}. \] Is it possible to choose $a_0$ such that all terms in the sequence are distinct?
A league consists of $2024$ players. A [i]round[/i] involves splitting the players into two different teams and having every member of one team play with every member of the other team. A round is called [i]balanced[/i] if both teams have an equal number of players. A tournament consists of several rounds at the end of which any two players have played each other. The committee organised a tournament last year which consisted of $N$ rounds. Prove that the committee can organise a tournament this year with $N$ balanced rounds.
[i]Proposed by Anant Mudgal and Navilarekallu Tejaswi[/i]