Found problems: 85335
Find the greatest positive integer $m$, such that one of the $4$ letters $C,G,M,O$ can be placed in each cell of a table with $m$ rows and $8$ columns, and has the following property: For any two distinct rows in the table, there exists at most one column, such that the entries of these two rows in such a column are the same letter.
Let $ n$ be a positive integer, $ X \equal{} \{1, 2, \ldots , n\},$ and $ k$ a positive integer such that $ \frac{n}{2} \leq k \leq n.$ Determine, with proof, the number of all functions $ f : X \mapsto X$ that satisfy the following conditions:
[b](i)[/b] $ f^2 \equal{} f;$
[b](ii)[/b] the number of elements in the image of $ f$ is $ k;$
[b](iii)[/b] for each $ y$ in the image of $ f,$ the number of all points $ x \in X$ such that $ f(x)\equal{}y$ is at most $ 2.$
Let $ABC$ be a triangle with $AB=26$, $AC=28$, $BC=30$. Let $X$, $Y$, $Z$ be the midpoints of arcs $BC$, $CA$, $AB$ (not containing the opposite vertices) respectively on the circumcircle of $ABC$. Let $P$ be the midpoint of arc $BC$ containing point $A$. Suppose lines $BP$ and $XZ$ meet at $M$ , while lines $CP$ and $XY$ meet at $N$. Find the square of the distance from $X$ to $MN$.
[i]Proposed by Michael Kural[/i]
Let $ ABC$ be an equilateral triangle and $ \Gamma$ the semicircle drawn exteriorly to the triangle, having $ BC$ as diameter. Show that if a line passing through $ A$ trisects $ BC,$ it also trisects the arc $ \Gamma.$
Quadrilateral $ABCD$ has the property that $AD = BD = CD$ and $\angle ADB < \angle CDB$. Let the circumcircle of $ABD$ be $O$. $O$ intersects $BC$ at $E$ and $CD$ at $F$. Next, extend $AB$ and $CD$ to intersect at a point $G$. Suppose that $BE = 1$, $EF = 3$, and $F D = 4$. Compute the perimeter of $\vartriangle ADG$.
Let $h$ and $k$ be positive integers. Prove that for every $\varepsilon >0,$ there are positive integers $m$ and $n$ such that \[\varepsilon < \left|h\sqrt{m}-k\sqrt{n}\right|<2\varepsilon.\]
Alan, Beth, Carlos, and Diana were discussing their possible grades in mathematics class this grading period. Alan said, "If I get an A, then Beth will get an A." Beth said, "If I get an A, then Carlos will get an A." Carlos said, "If I get an A, then Diana will get an A." All of these statements were true, but only two of the students received an A. Which two received A's?
\[ \textbf{(A)} \text{Alan, Beth} \qquad
\textbf{(B)} \text{Beth, Carlos} \qquad
\textbf{(C)} \text{Carlos, Diana} \qquad
\textbf{(D)} \text{Alan, Diana} \qquad
\textbf{(E)} \text{Beth, Diana}
\]
Chip and Dale play the following game. Chip starts by splitting $222$ nuts between two piles, so Dale can see it. In response, Dale chooses some number $N$ from $1$ to $222$. Then Chip moves nuts from the piles he prepared to a new (third) pile until there will be exactly $N$ nuts in any one or two piles. When Chip accomplishes his task, Dale gets an exact amount of nuts that Chip moved. What is the maximal number of nuts that Dale can get for sure, no matter how Chip acts? (Naturally, Dale wants to get as many nuts as possible, while Chip wants to lose as little as possible).
$ABC$ be a triangle. Its incircle touches the sides $CB, AC, AB$ respectively at $N_{A},N_{B},N_{C}$. The orthic triangle of $ABC$ is $H_{A}H_{B}H_{C}$ with $H_{A}, H_{B}, H_{C}$ are respectively on $BC, AC, AB$. The incenter of $AH_{C}H_{B}$ is $I_{A}$; $I_{B}$ and $I_{C}$ were defined similarly.
Prove that the hexagon $I_{A}N_{B}I_{C}N_{A}I_{B}N_{C}$ has all sides equal.
The number $60$ is written on a blackboard. In every move, Andris wipes the numbers on the board one by one, and writes all its divisors in its place (including itself). After $10$ such moves, how many times will $1$ appear on the board?
A prime number$ q $is called[b][i] 'Kowai' [/i][/b]number if $ q = p^2 + 10$ where $q$, $p$, $p^2-2$, $p^2-8$, $p^3+6$ are prime numbers. WE know that, at least one [b][i]'Kowai'[/i][/b] number can be found. Find the summation of all [b][i]'Kowai'[/i][/b] numbers.
On the side $BC$ of the parallelogram $ABCD$, points $E$ and $F$ are given ($E$ lies between $B$ and $F$) and the diagonals $AC, BD$ meet at $O$. If it's known that $AE, DF$ are tangent to the circumcircle of $\triangle AOD$, prove that they're tangent to the circumcircle of $\triangle EOF$ as well.
Coins are placed in some squares on a $n\times n$ board. Each coin can be moved towards the square symmetrical with respect to either of the two diagonals, as long as that square is empty. The initial coin setup is said to be [i]good [/i], if any coin can make the first move.
(a) Determine the maximum number of coins $M$ that can be placed on the $n\times n$ board, such that the configuration is good.
(b) Calculate the total number of good configurations that have exactly $M$ coins.
If $ a$ is $ 50\%$ larger than $ c$, and $ b$ is $ 25\%$ larger than $ c$,then $ a$ is what percent larger than $ b$?
$ \textbf{(A)}\ 20\%\qquad \textbf{(B)}\ 25\%\qquad \textbf{(C)}\ 50\%\qquad \textbf{(D)}\ 100\%\qquad \textbf{(E)}\ 200\%$
An integer $n\ge2$ is called [i]amicable[/i] if there exists subsets $A_1,A_2,\ldots,A_n$ of the set $\{1,2,\ldots,n\}$ such that
(i) $i\notin A_i$ for any $i=1,2,\ldots,n$,
(ii) $i\in A_j$ for any $j\notin A_i$, for any $i\ne j$
(iii) $A_i\cap A_j\ne\emptyset$ for any $i,j\in\{1,2,\ldots,n\}$
(a) Prove that $7$ is amicable.
(b) Prove that $n$ is amicable if and only if $n\ge7$.
Let $ABCD$ be the quadrilateral whose area is the largest among the quadrilaterals with given sides $a, b, c, d$, and let $PORS$ be the quadrilateral inscribed in $ABCD$ with the smallest perimeter. Find this perimeter.
A particle moves under a central force inversely proportional to the $k$-th power of the distance. If the particle describes a circle ( the central force proceeding from a point on the circumference of the circle ), find $k$.
A hotel packed breakfast for each of three guests. Each breakfast should have consisted of three types of rolls, one each of nut, cheese, and fruit rolls. The preparer wrapped each of the nine rolls and once wrapped, the rolls were indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one roll of each type is $\frac{m}{n}$, where $m$ and $n$ are relatively prime integers, find $m+n$.
Find all pairs $(a,b)$ of positive integers such that $a^2\mid b^3+1$ and $b^2\mid a^3+1$.
[i]Linus Tang[/i]
Find all functions $\displaystyle f : \mathbb N^\ast \to M$ such that
\[ \displaystyle 1 + f(n) f(n+1) = 2 n^2 \left( f(n+1) - f(n) \right), \, \forall n \in \mathbb N^\ast , \]
in each of the following situations:
(a) $\displaystyle M = \mathbb N$;
(b) $\displaystyle M = \mathbb Q$.
[i]Dinu Şerbănescu[/i]
Determine all functions $f:\mathbb{R}\to\mathbb{R}$ for which there exists a function $g:\mathbb{R}\to\mathbb{R}$ such that $f(x)+f(y)=\lfloor g(x+y)\rfloor$ for all real numbers $x$ and $y$.
[i]Emil Vasile[/i]
Through a random point $C_1$ from the edge $DC$ of the regular tetrahedron $ABCD$ is drawn a plane, parallel to the plane $ABC$. The plane constructed intersects the edges $DA$ and $DB$ at the points $A_1,B_1$ respectively. Let the point $H$ is the midpoint of the altitude through the vertex $D$ of the tetrahedron $DA_1B_1C_1$ and $M$ is the center of gravity (barycenter) of the triangle $ABC_1$. Prove that the measure of the angle $HMC$ doesn’t depend on the position of the point $C_1$. [i](Ivan Tonov)[/i]
Let $n$ be a positive integer. Ana and Beto play a game on a $2 \times n$ board (with 2 rows and $n$ columns). First, Ana writes a digit from 1 to 9 in each cell of the board such that in each column the two written digits are different. Then, Beto erases a digit from each column. Reading from left to right, a number with $n$ digits is formed. Beto wins if this number is a multiple of $n$; otherwise, Ana wins. Determine which of the two players has a winning strategy in the following cases:
$\bullet$ (a) $n = 1001$.
$\bullet$ (b) $n = 1003$.
Prove that there exist infinitely many even positive integers $k$ such that for every prime $p$ the number $p^2+k$ is composite.
Once in a restaurant [b][i]Dr. Strange[/i][/b] found out that there were 12 types of food items from 1 to 12 on the menu. He decided to visit the restaurant 12 days in a row and try a different food everyday. 1st day, he tries one of the items from the first two. On the 2nd day, he eats either item 3 or the item he didn’t tried on the 1st day. Similarly, on the 3rd day, he eats either item 4 or the item he didn’t tried on the 2nd day. If someday he's not able to choose items that way, he eats the item that remained uneaten from the menu. In how many ways can he eat the items for 12 days?