Found problems: 85335
Show that if $n\ge 2$ is an integer, then there exist invertible matrices $A_1, A_2, \ldots, A_n \in \mathcal{M}_2(\mathbb{R})$ with non-zero entries such that:
\[A_1^{-1} + A_2^{-1} + \ldots + A_n^{-1} = (A_1 + A_2 + \ldots + A_n)^{-1}.\]
[hide=Edit.]
The $77777^{\text{th}}$ topic in College Math :coolspeak:
[/hide]
Find the sum of all positive integers whose largest proper divisor is $55$. (A proper divisor of $n$ is a divisor that is strictly less than $n$.)
Let $\triangle ABC$ have $\angle ABC=67^{\circ}$. Point $X$ is chosen such that $AB = XC$, $\angle{XAC}=32^\circ$, and $\angle{XCA}=35^\circ$. Compute $\angle{BAC}$ in degrees.
[i]Proposed by Raina Yang[/i]
[hide=Intro]The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$, inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or down until the entire answer has been written. Answers may cross dark lines. If the answers are correctly filled in, it will be uniquely possible to write an integer from $ 1$ to $ 8$ in every cell of the grid, so that each number will appear exactly once in every row, every column, and every marked $2$ by $4$ box. You will get $7$ points for every correctly filled answer, and a $15$ point bonus for filling in every gridcell. It will help to work back and forth between the grid and the problems, although every problem is uniquely solvable on its own.
Please write clearly within the boxes. No points will be given for a cell without a number, with multiple
numbers, or with illegible handwriting.[/hide]
[img]https://cdn.artofproblemsolving.com/attachments/9/b/f4db097a9e3c2602b8608be64f06498bd9d58c.png[/img]
[b]1 ACROSS:[/b] Jack puts $ 10$ red marbles, $ 8$ green marbles and 4 blue marbles in a bag. If he takes out $11$ marbles, what is the expected number of green marbles taken out?
[b]2 DOWN:[/b] What is the closest integer to $6\sqrt{35}$ ?
[b]3 ACROSS: [/b]Alan writes the numbers $ 1$ to $64$ in binary on a piece of paper without leading zeroes. How many more times will he have written the digit $ 1$ than the digit $0$?
[b]4 ACROSS:[/b] Integers a and b are chosen such that $-50 < a, b \le 50$. How many ordered pairs $(a, b)$ satisfy the below equation? $$(a + b + 2)(a + 2b + 1) = b$$
[b]5 DOWN: [/b]Zach writes the numbers $ 1$ through $64$ in binary on a piece of paper without leading zeroes. How many times will he have written the two-digit sequence “$10$”?
[b]6 ACROSS:[/b] If you are in a car that travels at $60$ miles per hour, $\$1$ is worth $121$ yen, there are $8$ pints in a gallon, your car gets $10$ miles per gallon, a cup of coffee is worth $\$2$, there are 2 cups in a pint, a gallon of gas costs $\$1.50$, 1 mile is about $1.6$ kilometers, and you are going to a coffee shop 32 kilometers away for a gallon of coffee, how much, in yen, will it cost?
[b]7 DOWN:[/b] Clive randomly orders the letters of “MIXING THE LETTERS, MAN”. If $\frac{p}{m^nq}$ is the probability that he gets “LMT IS AN EXTREME THING” where p and q are odd integers, and $m$ is a prime number, then what is $m + n$?
[b]8 ACROSS:[/b] Joe is playing darts. A dartboard has scores of $10, 7$, and $4$ on it. If Joe can throw $12$ darts, how many possible scores can he end up with?
[b]9 ACROSS:[/b] What is the maximum number of bounded regions that $6$ overlapping ellipses can cut the plane into?
[b]10 DOWN:[/b] Let $ABC$ be an equilateral triangle, such that $A$ and $B$ both lie on a unit circle with center $O$. What is the maximum distance between $O$ and $C$? Write your answer be in the form $\frac{a\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime, and $a$ and $c$ share no common factor. What is $abc$ ?
PS. You had better use hide for answers.
When Yunji added all the integers from $1$ to $9$, she mistakenly left out a number. Her incorrect sum turned out to be a square number. Which number did Yunji leave out?
$\textbf{(A) } 5\qquad\textbf{(B) } 6\qquad\textbf{(C) } 7\qquad\textbf{(D) } 8\qquad\textbf{(E) } 9$
Suppose $a$ and $b$ are real numbers such that $0 < a < b < 1$. Let
$$x= \frac{1}{\sqrt{b}} - \frac{1}{\sqrt{b+a}},\hspace{1cm}
y= \frac{1}{b-a} - \frac{1}{b}\hspace{0.5cm}\textrm{and}\hspace{0.5cm}
z= \frac{1}{\sqrt{b-a}} - \frac{1}{\sqrt{b}}.$$
Show that $x$, $y$, $z$ are always ordered from smallest to largest in the same way, regardless of the choice of $a$ and $b$. Find this order among $x$, $y$, $z$.
Let $\{n_{k}\}_{k \ge 1}$ be a sequence of natural numbers such that for $i<j$, the decimal representation of $n_{i}$ does not occur as the leftmost digits of the decimal representation of $n_{j}$. Prove that \[\sum^{\infty}_{k=1}\frac{1}{n_{k}}\le \frac{1}{1}+\frac{1}{2}+\cdots+\frac{1}{9}.\]
Find all continuous functions $f: R \to R$ such that $g(g(x)) = g(x)+2x$ for all real $x$.
Consider the real number axis (i. e. the $x$-axis of a Cartesian coordinate system). We mark the points $1$, $2$, ..., $2n$ on this axis. A flea starts at the point $1$. Now it jumps along the real number axis; it can jump only from a marked point to another marked point, and it doesn't visit any point twice. After the ($2n-1$)-th jump, it arrives at a point from where it cannot jump any more after this rule, since all other points are already visited. Hence, with its $2n$-th jump, the flea breaks this rule and gets back to the point $1$. Assume that the sum of the (non-directed) lengths of the first $2n-1$ jumps of the flea was $n\left(2n-1\right)$. Show that the length of the last ($2n$-th) jump is $n$.
An $n\times n$ chessboard is given, where $n$ is an even positive integer. On every line, the unit squares are to be permuted, subject to the condition that the resulting table has to be symmetric with respect to its main diagonal (the diagonal from the top-left corner to the bottom-right corner). We say that a board is [i]alternative[/i] if it has at least one pair of complementary lines (two lines are complementary if the unit squares on them which lie on the same column have distinct colours). Otherwise, we call the board [i]nonalternative[/i]. For what values of $n$ do we always get from the $n\times n$ chessboard an alternative board?\\ \\
[i](Alexandru Petrescu and Andra Elena Mircea)[/i]
Let $a, b$ be given two real number with $a \ne 0$. Find all polynomials $P$ with real coefficients such that
$x P(x - a) = (x - b)P(x)$ for all $x\in R$
Given a triangle $ ABC$. Let $ G$, $ I$, $ H$ be the centroid, the incenter and the orthocenter of triangle $ ABC$, respectively. Prove that $ \angle GIH > 90^{\circ}$.
Let $\mathbb{Z}$ and $\mathbb{Q}$ be the sets of integers and rationals respectively.
a) Does there exist a partition of $\mathbb{Z}$ into three non-empty subsets $A,B,C$ such that the sets $A+B, B+C, C+A$ are disjoint?
b) Does there exist a partition of $\mathbb{Q}$ into three non-empty subsets $A,B,C$ such that the sets $A+B, B+C, C+A$ are disjoint?
Here $X+Y$ denotes the set $\{ x+y : x \in X, y \in Y \}$, for $X,Y \subseteq \mathbb{Z}$ and for $X,Y \subseteq \mathbb{Q}$.
By straightedge and compass, reconstruct a right triangle $ABC$ ($\angle C = 90^o$), given the vertices $A, C$ and a point on the bisector of angle $B$.
$9$ horizontal and $9$ vertical lines are drawn through a square. Prove that it is possible to select $20$ rectangles so that the sides of each rectangle is a segment of one of the given lines (including the sides of the square), and for any two of the $20$ rectangles, it is possible to cover one of them with the other (rotations are allowed).
Philipe has two congruent regular $4046$-gons. He invites Philomena to a trick he's planning: he'll give her one of the $4046$-gons and she will paint in red $2023$ vertices of her polygon. Without knowing which vertices she chose, he'll paint $k$ vertices of the remaining polygon. After this, he wants to rotate the polygons so that each painted vertices from Philomena's polygon is corresponding to some painted vertice from Philipe's polygon. What is the minimal value of $k$ for which he can choose his vertices so that, no matter how she paints her polygon, the trick is always possible.
[b]p1.[/b] I open my $2010$-page dictionary, whose pages are numbered $ 1$ to $2010$ starting on page $ 1$ on the right side of the spine when opened, and ending with page $2010$ on the left. If I open to a random page, what is the probability that the two page numbers showing sum to a multiple of $6$?
[b]p2.[/b] Let $A$ be the number of positive integer factors of $128$.
Let $B$ be the sum of the distinct prime factors of $135$.
Let $C$ be the units’ digit of $381$.
Let $D$ be the number of zeroes at the end of $2^5\cdot 3^4 \cdot 5^3 \cdot 7^2\cdot 11^1$.
Let $E$ be the largest prime factor of $999$.
Compute $\sqrt[3]{\sqrt{A + B} +\sqrt[3]{D^C+E}}$.
[b]p3. [/b] The root mean square of a set of real numbers is defined to be the square root of the average of the squares of the numbers in the set. Determine the root mean square of $17$ and $7$.
[b]p4.[/b] A regular hexagon $ABCDEF$ has area $1$. The sides$ AB$, $CD$, and $EF$ are extended to form a larger polygon with $ABCDEF$ in the interior. Find the area of this larger polygon.
[b]p5.[/b] For real numbers $x$, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. For example, $\lfloor 3\rfloor = 3$ and $\lfloor 5.2 \rfloor = 5$. Evaluate $\lfloor -2.5 \rfloor + \lfloor \sqrt 2 \rfloor + \lfloor -\sqrt 2 \rfloor + \lfloor 2.5 \rfloor$.
[b]p6.[/b] The mean of five positive integers is $7$, the median is $8$, and the unique mode is $9$. How many possible sets of integers could this describe?
[b]p7.[/b] How many three digit numbers x are there such that $x + 1$ is divisible by $11$?
[b]p8.[/b] Rectangle $ABCD$ is such that $AD = 10$ and $AB > 10$. Semicircles are drawn with diameters $AD$ and $BC$ such that the semicircles lie completely inside rectangle $ABCD$. If the area of the region inside $ABCD$ but outside both semicircles is $100$, determine the shortest possible distance between a point $X$ on semicircle $AD$ and $Y$ on semicircle $BC$.
[b]p9.[/b] $ 8$ distinct points are in the plane such that five of them lie on a line $\ell$, and the other three points lie off the line, in a way such that if some three of the eight points lie on a line, they lie on $\ell$. How many triangles can be formed using some three of the $ 8$ points?
[b]p10.[/b] Carl has $10$ Art of Problem Solving books, all exactly the same size, but only $9$ spaces in his bookshelf. At the beginning, there are $9$ books in his bookshelf, ordered in the following way.
$A - B - C - D - E - F - G - H - I$
He is holding the tenth book, $J$, in his hand. He takes the books out one-by-one, replacing each with the book currently in his hand. For example, he could take out $A$, put $J$ in its place, then take out $D$, put $A$ in its place, etc. He never takes the same book out twice, and stops once he has taken out the tenth book, which is $G$. At the end, he is holding G in his hand, and his bookshelf looks like this.
$C - I - H - J - F - B - E - D - A$
Give the order (start to finish) in which Carl took out the books, expressed as a $9$-letter string (word).
PS. You had better use hide for answers.
[i]Nocycleland[/i] is a country with $500$ cities and $2013$ two-way roads, each one of them connecting two cities. A city $A$ [i]neighbors[/i] $B$ if there is one road that connects them, and a city $A$ [i]quasi-neighbors[/i] $B$ if there is a city $C$ such that $A$ neighbors $C$ and $C$ neighbors $B$.
It is known that in Nocycleland, there are no pair of cities connected directly with more than one road, and there are no four cities $A$, $B$, $C$ and $D$ such that $A$ neighbors $B$, $B$ neighbors $C$, $C$ neighbors $D$, and $D$ neighbors $A$.
Show that there is at least one city that quasi-neighbors at least $57$ other cities.
Solve the equation $a^3+b^3+c^3=2001$ in positive integers.
[i]Mircea Becheanu, Romania[/i]
$P(x)$ and $Q(x)$ are two polynomials with integer coefficients such that $P(x)|Q(x)^2+1$.
[b]a)[/b] Prove that there exists polynomials $A(x)$ and $B(x)$ with rational coefficients and a rational number $c$ such that $P(x)=c(A(x)^2+B(x)^2)$.
[b]b)[/b] If $P(x)$ is a monic polynomial with integer coefficients, Prove that there exists two polynomials $A(x)$ and $B(x)$ with integer coefficients such that $P(x)$ can be written in the form of $A(x)^2+B(x)^2$.
[i]Proposed by Mohammad Gharakhani[/i]
Let $ABCDEF$ be a regular hexagon and let point $O$ be the center of the hexagon. How many ways can you color these seven points either red or blue such that there doesn’t exist any equilateral triangle with vertices of all the same color?
Joseph rolls a fair 6-sided dice repeatedly until he gets 3 of the same side in a row. What is the expected value of the number of times he rolls?
[i]Lightning 3.1[/i]
Let $ABC$ be a triangle with $AB=13$, $BC=14$, and $AC=15$. Denote by $\omega$ its incircle. A line $\ell$ tangent to $\omega$ intersects $\overline{AB}$ and $\overline{AC}$ at $X$ and $Y$ respectively. Suppose $XY=5$. Compute the positive difference between the lengths of $\overline{AX}$ and $\overline{AY}$.
Javier multiplies four digits, not necessarily different, and obtains a number ending in $7$. Determine how much the sum of the four digits that Javier multiplies can be worth. Give all the possibilities.
For an infinite sequence $a_1, a_2,. . .$ denote as it's [i]first derivative[/i] is the sequence $a'_n= a_{n + 1} - a_n$ (where $n = 1, 2,..$.), and her $k$- th derivative as the first derivative of its $(k-1)$-th derivative ($k = 2, 3,...$). We call a sequence [i]good[/i] if it and all its derivatives consist of positive numbers.
Prove that if $a_1, a_2,. . .$ and $b_1, b_2,. . .$ are good sequences, then sequence $a_1\cdot b_1, a_2 \cdot b_2,..$ is also a good one.
R. Salimov