Found problems: 85335
Let $\vartriangle ABC$ be a triangle of which the side lengths are positive integers which are pairwise coprime. The tangent in $A$ to the circumcircle intersects line $BC$ in $D$. Prove that $BD$ is not an integer.
If the sum of all the angles except one of a convex polygon is $ 2190^{\circ}$, then the number of sides of the polygon must be
$ \textbf{(A)}\ 13 \qquad
\textbf{(B)}\ 15 \qquad
\textbf{(C)}\ 17 \qquad
\textbf{(D)}\ 19 \qquad
\textbf{(E)}\ 21$
A square is cut into $100$ rectangles by $9$ straight lines parallel to one of the sides and $9$ lines parallel to another. If exactly $9$ of the rectangles are actually squares, prove that at least two of these $9$ squares are of the same size .
(V Proizvolov)
Let $BM$ be the median of the triangle $ABC$, in which $AB> BC$. Point $P$ is chosen so that $AB \parallel PC$ and $PM \perp BM$. Prove that $\angle ABM = \angle MBP$.
(Mikhail Standenko)
Define the Fibonacci numbers via $F_0=0$, $f_1=1$, and $F_{n-1}+F_{n-2}$.
Olivia flips two fair coins at the same time, repeatedly, until she has flipped a tails on both, not necessarily on the same throw. She records the number of pairs of flips $c$ until this happens (not including the last pair, so if on the last flip both coins turned up tails $c$ would be $0$). What is the expected value $F_c$?
A $4\times4\times4$ cube is composed of $64$ unit cubes. The faces of $16$ unit cubes are to be coloured red. A colouring is called interesting if there is exactly $1$ red unit cube in every $1\times1\times 4$ rectangular box composed of $4$ unit cubes. Determine the number of interesting colourings.
Every member, starting from the third one, of two sequences $\{a_n\}$ and $\{b_n\}$ equals to the sum of two preceding ones. First members are: $a_1 = 1, a_2 = 2, b_1 = 2, b_2 = 1$. How many natural numbers are encountered in both sequences (may be on the different places)?
(a) Is it possible to place five wooden cubes in space so that each of them has a part of its face touching each of the others?
(b) Answer the same question, but with $6$ cubes.
A polynomial $ f(x)\equal{}ax^4\plus{}bx^3\plus{}cx^2\plus{}dx$ with $ a,b,c,d>0$ is such that $ f(x)$ is an integer for $ x \in \{ \minus{}2,\minus{}1,0,1,2 \}$ and $ f(1)\equal{}1$ and $ f(5)\equal{}70$.
$ (a)$ Show that $ a\equal{}\frac{1}{24}, b\equal{}\frac{1}{4},c\equal{}\frac{11}{24},d\equal{}\frac{1}{4}$.
$ (b)$ Prove that $ f(x)$ is an integer for all $ x \in \mathbb{Z}$.
A particle is launched from the surface of a uniform, stationary spherical planet at an angle to the vertical. The particle travels in the absence of air resistance and eventually falls back onto the planet. Spaceman Fred describes the path of the particle as a parabola using the laws of projectile motion. Spacewoman Kate recalls from Kepler’s laws that every bound orbit around a point mass is an ellipse (or circle), and that the gravitation due to a uniform sphere is identical to that of a point mass. Which of the following best explains the discrepancy?
(A) Because the experiment takes place very close to the surface of the sphere, it is no longer valid to replace the sphere with a point mass.
(B) Because the particle strikes the ground, it is not in orbit of the planet and therefore can follow a nonelliptical path.
(C) Kate disregarded the fact that motions around a point mass may also be parabolas or hyperbolas.
(D) Kepler’s laws only hold in the limit of large orbits.
(E) The path is an ellipse, but is very close to a parabola due to the short length of the flight relative to the distance from the center of the planet.
In the unit squre For the given natural number $n \geq 2$ find the smallest number $k$ that from each set of $k$ unit squares of the $n$x$n$ chessboard one can achoose a subset such that the number of the unit squares contained in this subset an lying in a row or column of the chessboard is even
Let $ABC$ be a triangle with $\angle A = 90^o$ and let $D$ be an orthogonal projection of $A$ onto $BC$. The midpoints of $AD$ and $AC$ are called $E$ and $F$, respectively. Let $M$ be the circumcentre of $\vartriangle BEF$. Prove that $AC\parallel BM$.
Let $ABC$ be a triangle and $\Gamma$ its circumcircle. Let $D$ be the foot of the altitude from $A$ to the side $BC$, $M$ and $N$ the midpoints of $AB$ and $AC$, and $Q$ the point on $\Gamma$ diametrically opposite to $A$. Let $E$ be the midpoint of $DQ$. Show that the lines perpendicular to $EM$ and $EN$ passing through $M$ and $N$, respectively, meet on $AD$.
Find the smallest possible side of a square in which five circles of radius $1$ can be placed, so that no two of them have a common interior point.
Let $n\geq 4$ be a positive integer.Out of $n$ people,each of two individuals play table tennis game(every game has a winner).Find the minimum value of $n$,such that for any possible outcome of the game,there always exist an ordered four people group $(a_{1},a_{2},a_{3},a_{4})$,such that the person $a_{i}$ wins against $a_{j}$ for any $1\leq i<j\leq 4$
The first three terms of a geometric sequence are the integers $a,\,720,$ and $b,$ where $a<720<b.$ What is the sum of the digits of the least possible value of $b?$
$\textbf{(A) } 9 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 21$
Let $ a,b,c,d$ be positive real numbers and $cd=1$. Prove that there exists a positive integer $n$ such that
$ab\leq n^2\leq (a+c)(b+d)$
A postman has to deliver five letters to five different houses. Mischievously, he posts one letter through each door without looking to see if it is the correct address. In how many different ways could he do this so that exactly two of the five houses receive the correct letters?
A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes).
$a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table.
$b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.
Suppose $n$ coins are available that their mass is unknown. We have a pair of balances and every time we can choose an even number of coins and put half of them on one side of the balance and put another half on the other side, therefore a [i]comparison[/i] will be done. Our aim is determining that the mass of all coins is equal or not. Show that at least $n-1$ [i]comparisons[/i] are required.
Initially there is a checker on every square of a $1\times n$ board. The first move consists of moving a checker to an adjacent square thus creating a stack of two checkers. Then each time when making a move, one can choose a stack and move it in either direction as many squares on the board as there are checkers in the stack. If after the move the stack lands on a non-empty square, it is placed on top of the stack which is already there. Prove that it is possible to stack all the checkers on one square in $n - 1$ moves.
(A Shapovalov)
Let $a_1,a_2,\dots,a_{2023}$ be positive integers such that
[list=disc]
[*] $a_1,a_2,\dots,a_{2023}$ is a permutation of $1,2,\dots,2023$, and
[*] $|a_1-a_2|,|a_2-a_3|,\dots,|a_{2022}-a_{2023}|$ is a permutation of $1,2,\dots,2022$.
[/list]
Prove that $\max(a_1,a_{2023})\ge 507$.
[b]Problem Section #4
c) A special deck of cards contains $49$ cards, each labeled with a number from $1$ to $7$ and colored with
one of seven colors. Each number-color combination appears on exactly one card. John will select
a set of eight cards from the deck at random. Given that he gets at least one card of each color and
at least one card with each number, the probability that John can discard one of his cards and still
have at least one card of each color and at least one card with each number is $\frac{p}{q}$, where $p$ and $q$ are
relatively prime positive integers. Find $p+q$.
In triangle $ABC$, point $M$ is the midpoint of $BC, P$ is the intersection point of the tangents at points $B$ and $C$ of the circumscribed circle, $N$ is the midpoint of the segment $MP$. The segment $AN$ intersects the circumscribed circle at point $Q$. Prove that $\angle PMQ = \angle MAQ$.
Assume that $ S\equal{}(a_1, a_2, \cdots, a_n)$ consists of $ 0$ and $ 1$ and is the longest sequence of number, which satisfies the following condition: Every two sections of successive $ 5$ terms in the sequence of numbers $ S$ are different, i.e., for arbitrary $ 1\le i<j\le n\minus{}4$, $ (a_i, a_{i\plus{}1}, a_{i\plus{}2}, a_{i\plus{}3}, a_{i\plus{}4})$ and $ (a_j, a_{j\plus{}1}, a_{j\plus{}2}, a_{j\plus{}3}, a_{j\plus{}4})$ are different. Prove that the first four terms and the last four terms in the sequence are the same.