Found problems: 85335
The numbers 1, 2 and 3 are written on a board. Two friends are playing the following game. A player writes a number that doesn't exceed 2022 and isn't already on the board and is a sum or a product of two numbers that are written on the board. They take turns writing numbers and the winner is the player who writes 2022 on the board.
Which player has a winning strategy and why?
[i]Proposed by Ilija Jovcheski[/i]
Consider the sequences $(a_n), (b_n)$ defined by
\[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \]
Find the smallest integer $m$ for which $b_m > a_{100}.$
On day $1$ of the new year, John Adams and Samuel Adams each drink one gallon of tea. For each positive integer $n$, on the $n$th day of the year, John drinks $n$ gallons of tea and Samuel drinks $n^2$ gallons of tea. After how many days does the combined tea intake of John and Samuel that year first exceed $900$ gallons?
[i]Proposed by Aidan Duncan[/i]
[hide=Solution]
[i]Solution. [/i] $\boxed{13}$
The total amount that John and Samuel have drank by day $n$ is
$$\dfrac{n(n+1)(2n+1)}{6}+\dfrac{n(n+1)}{2}=\dfrac{n(n+1)(n+2)}{3}.$$
Now, note that ourdesired number of days should be a bit below $\sqrt[3]{2700}$. Testing a few values gives $\boxed{13}$ as our answer.
[/hide]
In $ xy \minus{}$plane, there are $ b$ blue and $ r$ red rectangles whose sides are parallel to the axis. Any parallel line to the axis can intersect at most one rectangle with same color. For any two rectangle with different colors, there is a line which is parallel to the axis and which intersects only these two rectangles. $ (b,r)$ cannot be ?
$\textbf{(A)}\ (1,7) \qquad\textbf{(B)}\ (2,6) \qquad\textbf{(C)}\ (3,4) \qquad\textbf{(D)}\ (3,3) \qquad\textbf{(E)}\ \text{None}$
Inside triangle $ABC$, point $P$ is taken so that angles $\angle ARB= \angle BPC = \angle CPA= 120^o$. Lines $BP$ and $CP$ intersect lines $AC$ and $AB$ at points $M$ and $K$. It is known that the quadrilateral $AMPK$ has same areq with the triangle $BCP$. What is the angle $\angle BAC$?
Define the polynomial $f(x) = x^4 + x^3 + x^2 + x + 1$. Compute the number of positive integers $n$ less than equal to $2022$ such that $f(n)$ is $1$ more than multiple of $5$.
Some pairs of cities in a certain country are connected by roads, at least three roads going out of each city. Prove that there exists a round path consisting of roads whose number is not divisible by $3$.
(B.Frenkin, 8) Does a regular polygon exist such that just half of its diagonals are parallel to its sides?
In the expression $ c\cdot a^b\minus{}d$, the values of $ a$, $ b$, $ c$, and $ d$ are $ 0$, $ 1$, $ 2$, and $ 3$, although not necessarily in that order. What is the maximum possible value of the result?
$ \textbf{(A)}\ 5\qquad
\textbf{(B)}\ 6\qquad
\textbf{(C)}\ 8\qquad
\textbf{(D)}\ 9\qquad
\textbf{(E)}\ 10$
Find, with proof, all pairs $(x, y)$ of integers satisfying the equation $3x^2+ 4 = 2y^3$.
Tom Sawyer must whitewash a circular fence consisting of $N$ planks. He whitewashes the fence going clockwise and following the rule: He whitewashes the first plank, skips two planks, whitewashes one, skips three, and so on. Some planks may be whitewashed several times. Tom believes that all planks will be whitewashed sooner or later, but aunt Polly is sure that some planks will remain unwhitewashed forever. Prove that Tom is right if $N$ is a power of two, otherwise
aunt Polly is right.
Solve the equation:
$x^2+2xcos(x-y)+1=0$
There is a board with 32 rows and 10 columns. Pablo writes 1 or -1 in each box. Matías, with Pablo's board in view, chooses one or more columns, and in each of the chosen columns, changes all of Pablo's numbers to their opposites (where there is 1 he puts -1 and where there is -1 he puts 1) . In the other columns, leave Pablo's numbers. Matías wins if he manages to make his board have each of the rows different from all the rows on Pablo's board. Otherwise, that is, if any row on Matías's board is equal to any row on Pablo's board, Pablo wins. If both play perfectly, determine which of the two is assured of victory.
Prove that for all positive integers $n$, there exists a positive integer $m$ which is a multiple of $n$ and the sum of the digits of $m$ is equal to $n$.
Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$.
[b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \]
[b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]
The ages of Jonie's four cousins are distinct single-digit positive integers. Two of the cousins' ages multiplied together give $24$, while the other two multiply to $30$. What is the sum of the ages of Jonie's four cousins?
$\textbf{(A) }21 \qquad \textbf{(B) }22 \qquad \textbf{(C) }23 \qquad \textbf{(D) }24 \qquad \textbf{(E) }25$
The picture shows $10$ equal regular pentagons where each two neighbouring pentagons have a common side. The smaller circle is tangent to one side of each pentagon and the larger circle passes through the opposite vertices of these sides. Find the area of the larger circle if the area of the smaller circle is $1$.
[img]https://cdn.artofproblemsolving.com/attachments/0/6/84fe98370868a5cf28d92d4b207ccb00e6eaa3.png[/img]
[b]7.1 / 6.1[/b] There are $8$ rooks on the chessboard such that no two of them they don't hit each other. Prove that the black squares contain an even number of rooks.
[b]7.2[/b] The sides of triangle $ABC$ are extended as shown in the figure. At this $AA' = 3 AB$,, $BB' = 5BC$ , $CC'= 8 CA$. How many times is the area of the triangle $ABC$ less than the area of the triangle $A'B'C' $?
[img]https://cdn.artofproblemsolving.com/attachments/9/f/06795292291cd234bf2469e8311f55897552f6.png[/img]
[url=https://artofproblemsolving.com/community/c893771h1860178p12579333]7.3[/url] Prove the equality $$\frac{2}{x^2-1}+\frac{4}{x^2-4} +\frac{6}{x^2-9}+...+\frac{20}{x^2-100}
=\frac{11}{(x-1)(x+10)}+\frac{11}{(x-2)(x+9)}+...+\frac{11}{(x-10)(x+1)}$$
[url=https://artofproblemsolving.com/community/c893771h1861966p12597273]7.4* / 8.4 *[/url] (asterisk problems in separate posts)
[b]7.5 [/b]. The collective farm consists of $4$ villages located in the peaks of square with side $10$ km. It has the means to conctruct 28 kilometers of roads . Can a collective farm build such a road system so that was it possible to get from any village to any other?
[b]7.6 / 6.6[/b] Two brilliant mathematicians were told in natural terms number and were told that these numbers differ by one. After that they take turns asking each other the same question: “Do you know my number?" Prove that sooner or later one of them will answer positively.
PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988085_1969_leningrad_math_olympiad]here[/url].
Let $n\in\mathbb{N}$, $n\geq 2$. Find all values of $k\in\mathbb{N}$, $k\geq 1$, for which the following statement holds: $$\text{"If }A\in\mathcal{M}_n(\mathbb{C})\text{ is such that }A^kA^*=A\text{, then }A=A^*\text{."}$$ (here, $A^*$ denotes the conjugate transpose of $A$).
Given is a grid 8x8. Every square is colored in black or white, so that in every 3x3, the number of white squares is even. What is the minimum number of black squares
A freight train departed from Moscow at $x$ hours and $y$ minutes and arrived at Saratov at $y$ hours and $z$ minutes. The length of its trip was $z$ hours and $x$ minutes. Find all possible values of $x$.
[i]S. Tokarev[/i]
In an acute triangle $\bigtriangleup ABC$, $AB<AC<BC$, and $A_1,B_1,C_1$ are the projections of $A,B,C$ to the corresponding sides. Let the reflection of $B_1$ wrt $CC_1$ be $Q$, and the reflection of $C_1$ wrt $BB_1$ be $P$.
Prove that the circumcirle of $A_1PQ$ passes through the midpoint of $BC$.
Given a $n\times m$ grid we play the following game . Initially we place $M$ tokens in each of $M$ empty cells and at the end of the game we need to fill the whole grid with tokens.For that purpose we are allowed to make the following move:If an empty cell shares a common side with at least two other cells that contain a token then we can place a token in this cell.Find the minimum value of $M$ in terms of $m,n$ that enables us to win the game.
Find all functions $f: R \to R$ such that for all real numbers $x, y$ holds $f(y - xy) = f(x)y + (x - 1)^2 f(y)$
The numbers $203$ and $298$ divided with the positive integer $x$ give both remainder $13$. Which are the possible values of $x$ ?