Found problems: 5802
The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT \to HTT \to TTT$, which stops after three operations.
(a) Show that, for each initial configuration, Harry stops after a finite number of operations.
(b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$.
[i]Proposed by David Altizio, USA[/i]
Ruby has a non-negative integer $n$. In each second, Ruby replaces the number she has with the product of all its digits. Prove that Ruby will eventually have a single-digit number or $0$. (e.g. $86\rightarrow 8\times 6=48 \rightarrow 4 \times 8 =32 \rightarrow 3 \times 2=6$)
[i]Proposed by Wong Jer Ren[/i]
There are infinitely many boxes - initially one of them contains $n$ balls and all others are empty. On a single move we take some balls from a non-empty box and put them into an empty box and on a sheet of paper we write down the product of the resulting amount of balls in the two boxes. After some moves, the sum of all numbers on the sheet of paper became $2023$. What is the smallest possible value of $n$?
The natural numbers are written in sequence, in increasing order, and by this we get an infinite sequence of digits. Find the least natural $k$, for which among the first $k$ digits of this sequence, any two nonzero digits have been written a different number of times.
[i]Aleksandar Ivanov, Emil Kolev [/i]
Let $n \geq 3$ be a positive integer. Find the maximum number of diagonals in a regular $n$-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.
Let $n$ be a positive integer, and let $b_{1}$, $b_{2}$, ..., $b_{n}$ be $n$ positive reals. Set $a_{1}=\frac{b_{1}}{b_{1}+b_{2}+...+b_{n}}$ and $a_{k}=\frac{b_{1}+b_{2}+...+b_{k}}{b_{1}+b_{2}+...+b_{k-1}}$ for every $k>1$. Prove the inequality
$a_{1}+a_{2}+...+a_{n}\leq\frac{1}{a_{1}}+\frac{1}{a_{2}}+...+\frac{1}{a_{n}}$.
$\omega$ is a complex number such that $\omega^{2013} = 1$ and $\omega^m \neq 1$ for $m=1,2,\ldots,2012$. Find the number of ordered pairs of integers $(a,b)$ with $1 \le a, b \le 2013$ such that \[ \frac{(1 + \omega + \cdots + \omega^a)(1 + \omega + \cdots + \omega^b)}{3} \] is the root of some polynomial with integer coefficients and leading coefficient $1$. (Such complex numbers are called [i]algebraic integers[/i].)
[i]Victor Wang[/i]
[u]Round 1[/u]
[b]p1.[/b] A positive integer is said to be transcendent if it leaves a remainder of $1$ when divided by $2$. Find the $1010$th smallest positive integer that is transcendent.
[b]p2.[/b] The two diagonals of a square are drawn, forming four triangles. Determine, in degrees, the sum of the interior angle measures in all four triangles.
[b]p3.[/b] Janabel multiplied $2$ two-digit numbers together and the result was a four digit number. If the thousands digit was nine and hundreds digit was seven, what was the tens digit?
[u]Round 2[/u]
[b]p4.[/b] Two friends, Arthur and Brandon, are comparing their ages. Arthur notes that $10$ years ago, his age was a third of Brandon’s current age. Brandon points out that in $12$ years, his age will be double of Arthur’s current age. How old is Arthur now?
[b]p5.[/b] A farmer makes the observation that gathering his chickens into groups of $2$ leaves $1$ chicken left over, groups of $3$ leaves $2$ chickens left over, and groups of $5$ leaves $4$ chickens left over. Find the smallest possible number of chickens that the farmer could have.
[b]p6.[/b] Charles has a bookshelf with $3$ layers and $10$ indistinguishable books to arrange. If each layer must hold less books than the layer below it and a layer cannot be empty, how many ways are there for Charles to arrange his $10$ books?
[u]Round 3[/u]
[b]p7.[/b] Determine the number of factors of $2^{2019}$.
[b]p8.[/b] The points $A$, $B$, $C$, and $D$ lie along a line in that order. It is given that $\overline{AB} : \overline{CD} = 1 : 7$ and $\overline{AC} : \overline{BD} = 2 : 5$. If $BC = 3$, find $AD$.
[b]p9.[/b] A positive integer $n$ is equal to one-third the sum of the first $n$ positive integers. Find $n$.
[u]Round 4[/u]
[b]p10.[/b] Let the numbers $a,b,c$, and $d$ be in arithmetic progression. If $a +2b +3c +4d = 5$ and $a =\frac12$ , find $a +b +c +d$.
[b]p11.[/b] Ten people playing brawl stars are split into five duos of $2$. Determine the probability that Jeff and Ephramare paired up.
[b]p12.[/b] Define a sequence recursively by $F_0 = 0$, $F_1 = 1$, and for all $n\ge 2$, $$F_n = \left \lceil
\frac{F_{n-1}+F_{n-2}}{2} \right \rceil +1,$$ where $\lceil r \rceil$ denotes the least integer greater than or equal to $r$ . Find $F_{2019}$.
PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3166019p28809679]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166115p28810631]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A pond has $2025$ lily pads arranged in a circle. Two frogs, Alice and Bob, begin on different lily pads. A frog jump is a jump which travels $2$, $3$, or $5$ positions clockwise. Alice and Bob each make a series of frog jumps, and each frog ends on the same lily pad that it started from. Given that each lily pad is the destination of exactly one jump, prove that each frog completes exactly two laps around the pond (i.e. travels $4050$ positions in total).
[i]Linus Tang[/i]
Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$
Show that every positive rational number can be written as a quotient of products of factorials of (not necessarily distinct) primes. For example, $ \frac{10}9\equal{}\frac{2!\cdot 5!}{3!\cdot 3!\cdot 3!}.$
For a positive integer $n$ let $S(n)$ be the sum of digits in the decimal representation of $n$. Any positive integer obtained by removing several (at least one) digits from the right-hand end of the decimal representation of $n$ is called a [i]stump[/i] of $n$. Let $T(n)$ be the sum of all stumps of $n$. Prove that $n=S(n)+9T(n)$.
Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.
Let $n$ be a positive integer. Prove that there exist integers $a_1, a_2,..., a_n$ such that for any integer $x$, the number $(... (((x^2 + a_1)^2 + a_2)^2 + ...)^2 + a_{n-1})^2 + a_n$ is divisible by $2n - 1$.
$a)$ Solve over the positive integers $3^x=x+2.$
$b)$ Find pairs $(x,y)\in\mathbb{N}\times\mathbb{N}$ such that $(x+3^y)$ and $(y+3^x)$ are consecutive.
[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$.
[b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials.
[b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace:
$\bullet$ two candies in the box with one chocolate bar,
$\bullet$ two muffins in the box with one chocolate bar,
$\bullet$ two chocolate bars in the box with one candy and one muffin,
$\bullet$ one candy and one chocolate bar in the box with one muffin,
$\bullet$ one muffin and one chocolate bar in the box with one candy.
Is it possible that after some time it remains only one object in the box?
[b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points?
[b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $a_n, b_n$ be sequences of positive reals such that,$$a_{n+1}= a_n + \frac{1}{2b_n}$$ $$b_{n+1}= b_n + \frac{1}{2a_n}$$ for all $n\in\mathbb N$.
Prove that, $\text{max}\left(a_{2018}, b_{2018}\right) >44$.
Find the number of $(a_1,a_2, ... ,a_{2014})$ permutations of the $(1,2, . . . ,2014)$ such that, for all $1\leq i<j\leq2014$, $i+a_i \leq j+a_j$.
$m$ and $n$ are positive integers. If the number \[ k=\dfrac{(m+n)^2}{4m(m-n)^2+4}\] is an integer, prove that $k$ is a perfect square.
Show that the number $1989$ as well as each of its powers $1989^n$ ($n \in N$), can be expressed as a sum of two positive squares in at least two ways.
Assign to each side $b$ of a convex polygon $P$ the maximum area of a triangle that has $b$ as a side and is contained in $P$. Show that the sum of the areas assigned to the sides of $P$ is at least twice the area of $P$.
For a fixed positive integer $k$, there are two sequences $A_n$ and $B_n$.
They are defined inductively, by the following recurrences.
$A_1 = k$, $A_2 = k$, $A_{n+2} = A_{n}A_{n+1}$
$B_1 = 1$, $B_2 = k$, $B_{n+2} = \frac{B^3_{n+1}+1}{B_{n}}$
Prove that for all positive integers $n$, $A_{2n}B_{n+3}$ is an integer.
Let be two matrices $ A,B\in\mathcal{M}_2\left( \mathbb{C} \right) $ satisfying $ AB-BA=A. $ Show that:
[b]a)[/b] $ \text{tr} (A) =\det (A) =0 $
[b]b)[/b] $ AB^nA=0, $ for any natural number $ n $
There are $n$ rooms in a sauna, each has unlimited capacity. No room may be attended by a female and a male simultaneously. Moreover, males want to share a room only with males that they don't know and females want to share a room only with females that they know. Find the biggest number $k$ such that any $k$ couples can visit the sauna at the same time, given that two males know each other if and only if their wives know each other.
Let $n$ be a positive integer. Suppose there are exactly $M$ squarefree integers $k$ such that $\left\lfloor\frac nk\right\rfloor$ is odd in the set $\{ 1, 2,\ldots, n\}$. Prove $M$ is odd.
An integer is [i]squarefree[/i] if it is not divisible by any square other than $1$.