Found problems: 85335
Given a triangle $ABC$ ($AB \ne AC$). Let $ P$ be a point in the plane containing triangle $ABC$ satisfying the following property:
If the projections of $ P$ onto $AB$,$AC$ are $C_1$,$B_1$ respectively, then
$\frac{PB}{PC}=\frac{PC_1}{PB_1}=\frac{AB}{AC}$ or $\frac{PB}{PC}=\frac{PB_1}{PC_1}=\frac{AB}{AC}$.
Prove that $\angle PBC + \angle PCB = \angle BAC$.
A round table is surrounded by $n\geqslant 2$ people, each assigned one of the integers $0, 1,\ldots , n-1$ such that no two people have the same number. In each round, everyone adds their number to their right neighbour’s number, and their new number becomes the remainder of the sum when divided by $n{}.$ We call an initial configuration of integers [i]glorious[/i] if everyone’s number remains the same after some finite number of rounds, never changing again.
[list=a]
[*]For which integers $n\geqslant 2$ is every initial configuration glorious?
[*]For which integers $n\geqslant 2$ is there no glorious initial configuration at all?
[/list]
Compute $$\sum_{n=1}^{\infty} \frac{2^{n+1}}{8 \cdot 4^n - 6 \cdot 2^n +1}$$
Let $ ABC$ be an equilateral triangle. Let $ \Omega$ be its incircle (circle inscribed in the triangle) and let $ \omega$ be a circle tangent externally to $ \Omega$ as well as to sides $ AB$ and $ AC$. Determine the ratio of the radius of $ \Omega$ to the radius of $ \omega$.
Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$. Let $D$ be the midpoint of $\overline{AB}$, and let $E$ be the midpoint of $\overline{AC}$. The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$, respectively. What is the area of quadrilateral $FDBG$?
$
\textbf{(A) }60 \qquad
\textbf{(B) }65 \qquad
\textbf{(C) }70 \qquad
\textbf{(D) }75 \qquad
\textbf{(E) }80 \qquad
$
Let $ n \ge 3$ be a prime number and $ a_{1} < a_{2} < \cdots < a_{n}$ be integers. Prove that $ a_{1}, \cdots,a_{n}$ is an arithmetic progression if and only if there exists a partition of $ \{0, 1, 2, \cdots \}$ into sets $ A_{1},A_{2},\cdots,A_{n}$ such that
\[ a_{1} \plus{} A_{1} \equal{} a_{2} \plus{} A_{2} \equal{} \cdots \equal{} a_{n} \plus{} A_{n},\]
where $ x \plus{} A$ denotes the set $ \{x \plus{} a \vert a \in A \}$.
A family $L$ of 2006 lines on the plane is given in such a way that it doesn't contain
parallel lines and it doesn't contain three lines with a common point.We say that
the line $l_1\in L$ is [i]bounding[/i] the line $l_2\in L$,if all intersection points
of the line $l_2$ with other lines from $L$ lie on the one side of the line $l_1$.
Prove that in the family $L$ there are two lines $l$ and $l'$ such that the following
2 conditions are satisfied simultaneously:
[b]1)[/b] The line $l$ is bounding the line $l'$;
[b]2)[/b] the line $l'$ is not bounding the line $l$.
Prove that the equation $x^3+11^3=y^3$ has no solution in positive integers $x$ and $y$.
[hide=D stands for Dedekind, Z stands for Zermelo]they had two problem sets under those two names[/hide]
[u]Set 1[/u]
[b]D1 / Z1.[/b] What is $1 + 2 \cdot 3$?
[b]D2.[/b] What is the average of the first $9$ positive integers?
[b]D3 / Z2.[/b] A square of side length $2$ is cut into $4$ congruent squares. What is the perimeter of one of the $4$ squares?
[b]D4.[/b] Find the ratio of a circle’s circumference squared to the area of the circle.
[b]D5 / Z3.[/b] $6$ people split a bag of cookies such that they each get $21$ cookies. Kyle comes and demands his share of cookies. If the $7$ people then re-split the cookies equally, how many cookies does Kyle get?
[u]Set 2[/u]
[b]D6.[/b] How many prime numbers are perfect squares?
[b]D7.[/b] Josh has an unfair $4$-sided die numbered $1$ through $4$. The probability it lands on an even number is twice the probability it lands on an odd number. What is the probability it lands on either $1$ or $3$?
[b]D8.[/b] If Alice consumes $1000$ calories every day and burns $500$ every night, how many days will it take for her to first reach a net gain of $5000$ calories?
[b]D9 / Z4.[/b] Blobby flips $4$ coins. What is the probability he sees at least one heads and one tails?
[b]D10.[/b] Lillian has $n$ jars and $48$ marbles. If George steals one jar from Lillian, she can fill each jar with $8$ marbles. If George steals $3$ jars, Lillian can fill each jar to maximum capacity. How many marbles can each jar fill?
[u]Set 3[/u]
[b]D11 / Z6.[/b] How many perfect squares less than $100$ are odd?
[b]D12.[/b] Jash and Nash wash cars for cash. Jash gets $\$6$ for each car, while Nash gets $\$11$ per car. If Nash has earned $\$1$ more than Jash, what is the least amount of money that Nash could have earned?
[b]D13 / Z5.[/b] The product of $10$ consecutive positive integers ends in $3$ zeros. What is the minimum possible value of the smallest of the $10$ integers?
[b]D14 / Z7.[/b] Guuce continually rolls a fair $6$-sided dice until he rolls a $1$ or a $6$. He wins if he rolls a $6$, and loses if he rolls a $1$. What is the probability that Guuce wins?
[b]D15 / Z8.[/b] The perimeter and area of a square with integer side lengths are both three digit integers. How many possible values are there for the side length of the square?
PS. You should use hide for answers. D.16-30/Z.9-14, 17, 26-30 problems have been collected [url=https://artofproblemsolving.com/community/c3h2916250p26045695]here [/url]and Z.15-25 [url=https://artofproblemsolving.com/community/c3h2916258p26045774]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Does there exist bijections $f,g$ from positive integers to themselves st:
$$g(n)=\frac{f(1)+f(2)+ \cdot \cdot \cdot +f(n)}{n}$$
holds for any $n$?
Let $ABCD$ be a convex quadrilateral. $AC$ and $BD$ meet at $P$, with $\angle APD=60^{\circ}$. Let $E,F,G$, and $H$ be the midpoints of $AB,BC,CD$ and $DA$ respectively. Find the greatest positive real number $k$ for which
\[EG+3HF\ge kd+(1-k)s \]
where $s$ is the semi-perimeter of the quadrilateral $ABCD$ and $d$ is the sum of the lengths of its diagonals. When does the equality hold?
Three travel companies provide transportation between $n$ cities, such that each connection between a pair of cities is covered by one company only. Prove that, for $n \geq 11$, there must exist a round-trip through some four cities, using the services of a same company, while for $n < 11$ this is not anymore necessarily true.
[i]Dan Schwarz[/i]
$(SWE 3)$ Find the natural number $n$ with the following properties:
$(1)$ Let $S = \{P_1, P_2, \cdots\}$ be an arbitrary finite set of points in the plane, and $r_j$ the distance from $P_j$ to the origin $O.$ We assign to each $P_j$ the closed disk $D_j$ with center $P_j$ and radius $r_j$. Then some $n$ of these disks contain all points of $S.$
$(2)$ $n$ is the smallest integer with the above property.
A positive integer $b$ is called good if there exist positive integers $1=a_1, a_2, \ldots, a_{2023}=b$ such that $|a_{i+1}-a_i|=2^i$. Find the number of the good integers.
Two players take turns writing on the board in a row from left to right arbitrary numbers. The player loses, after whose move one or more several digits written in a row form a number divisible by $11$. Which player will win if played correctly?
Square $ABCD$ has center $O$, $AB=900$, $E$ and $F$ are on $AB$ with $AE<BF$ and $E$ between $A$ and $F$, $m\angle EOF =45^\circ$, and $EF=400$. Given that $BF=p+q\sqrt{r}$, wherer $p,q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r$.
Prove that for all odd $ n > 1$, we have $ 8n \plus{} 4|C^{4n}_{2n}$.
How many ways can you roll three 20-sided dice such that the sum of the three rolls is exactly $42$? Here the order of the rolls matter. [i](Note that a 20-sided die is is very much like a regular 6-sided die other than the fact that it has $20$ faces instead of $6$)[/i]
Determine all triples of positive integers $a, b, c$ that satisfy
a) $[a, b] + [a, c] + [b, c] = [a, b, c]$.
b) $[a, b] + [a, c] + [b, c] = [a, b, c] + (a, b, c)$.
Remark: Here $[x, y$] denotes the least common multiple of positive integers $x$ and $y$, and $(x, y)$ denotes their greatest common divisor.
Let $k$ be a positive integer. Scrooge McDuck owns $k$ gold coins. He also owns infinitely many boxes $B_1, B_2, B_3, \ldots$ Initially, bow $B_1$ contains one coin, and the $k-1$ other coins are on McDuck's table, outside of every box.
Then, Scrooge McDuck allows himself to do the following kind of operations, as many times as he likes:
- if two consecutive boxes $B_i$ and $B_{i+1}$ both contain a coin, McDuck can remove the coin contained in box $B_{i+1}$ and put it on his table;
- if a box $B_i$ contains a coin, the box $B_{i+1}$ is empty, and McDuck still has at least one coin on his table, he can take such a coin and put it in box $B_{i+1}$.
As a function of $k$, which are the integers $n$ for which Scrooge McDuck can put a coin in box $B_n$?
Jerry and Silvia wanted to go from the southwest corner of a square field to the northeast corner. Jerry walked due east and then due north to reach the goal, but Silvia headed northeast and reached the goal walking in a straight line. Which of the following is closest to how much shorter Silvia's trip was, compared to Jerry's trip?
$\textbf{(A)}\ 30 \%\qquad\textbf{(B)}\ 40 \%\qquad\textbf{(C)}\ 50 \%\qquad\textbf{(D)}\ 60 \%\qquad\textbf{(E)}\ 70 \%$
Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$.
[i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]
Consider the parallelogram $ABCD$ such that $CD = 8$ and $BC = 14$. The diagonals $\overline{AC}$ and $\overline{BD}$ intersect at $E$ and $AC = 16$. Consider a point $F$ on the segment $\overline{ED}$ with $F D =\frac{\sqrt{66}}{3}$. Compute $CF$.
There exists a unique positive integer $a$ for which the sum \[U=\sum_{n=1}^{2023}\left\lfloor\dfrac{n^{2}-na}{5}\right\rfloor\] is an integer strictly between $-1000$ and $1000$. For that unique $a$, find $a+U$.
(Note that $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x$.)
Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.