This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

In each field of a table there is a real number. We call such $n \times n$ table [i]silly[/i] if each entry equals the product of all the numbers in the neighbouring fields. a) Find all $2 \times 2$ silly tables. b) Find all $3 \times 3$ silly tables.
From point $ O $ a car starts on a straight road and travels with constant speed $ v $. A cyclist who is located at a distance $ a $ from point $ O $ and at a distance $ b $ from the road wants to deliver a letter to this car. What is the minimum speed a cyclist should ride to reach his goal?
We are given a triangle $ABC$. Let $M$ be the mid-point of its side $AB$. Let $P$ be an interior point of the triangle. We let $Q$ denote the point symmetric to $P$ with respect to $M$. Furthermore, let $D$ and $E$ be the common points of $AP$ and $BP$ with sides $BC$ and $AC$, respectively. Prove that points $A$, $B$, $D$, and $E$ lie on a common circle if and only if $\angle ACP = \angle QCB$ holds. (Karl Czakler)
Let $r_1,r_2,r$, with $r_1 < r_2 < r$, be the radii of three circles $\Gamma_1,\Gamma_2,\Gamma$, respectively. The circles $\Gamma_1,\Gamma_2$ are internally tangent to $\Gamma$ at two distinct points $A,B$ and intersect in two distinct points. Prove that the segment $AB$ contains an intersection point of $\Gamma_1$ and $\Gamma_2$ if and only if $r_1 +r_2 = r$.
Let $\triangle ABC$ be a right-angled triangle with $\angle BAC = 90^{\circ}$ and let $E$ be the foot of the perpendicular from $A$ to $BC$. Let $Z \ne A$ be a point on the line $AB$ with $AB = BZ$. Let $(c)$ be the circumcircle of the triangle $\triangle AEZ$. Let $D$ be the second point of intersection of $(c)$ with $ZC$ and let $F$ be the antidiametric point of $D$ with respect to $(c)$. Let $P$ be the point of intersection of the lines $FE$ and $CZ$. If the tangent to $(c)$ at $Z$ meets $PA$ at $T$, prove that the points $T$, $E$, $B$, $Z$ are concyclic. Proposed by [i]Theoklitos Parayiou, Cyprus[/i]
Consider the number $\alpha$ obtained by writing one after another the decimal representations of $1, 1987, 1987^2, \dots$ to the right the decimal point. Show that $\alpha$ is irrational.
Let $ABC$ be and acute triangle. Construct a triangle $PQR$ such that $ AB = 2PQ $, $ BC = 2QR $, $ CA = 2 RP $, and the lines $ PQ, QR,$ and $RP$ pass through the points $ A, B , $ and $ C $, respectively. (All six points $ A, B, C, P, Q, $ and $ R $ are distinct.)
I have an $n \times n$ sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let $b(n)$ be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants $c$ and $d$ such that \[ \dfrac{1}{7} n^2 - cn \leq b(n) \leq \dfrac{1}{5} n^2 + dn \] for all $n > 0$.
Suppose we have $w < x < y < z$, and each of the $6$ pairwise sums are distinct. The $4$ greatest sums are $4, 3, 2, 1$. What is the sum of all possible values of $w$?
Two line $BC$ and $EF$ are parallel. Let $D$ be a point on segment $BC$ different from $B$,$C$. Let $I$ be the intersection of $BF$ ans $CE$. Denote the circumcircle of $\triangle CDE$ and $\triangle BDF$ as $K$,$L$. Circle $K$,$L$ are tangent with $EF$ at $E$,$F$,respectively. Let $A$ be the other intersection of circle $K$ and $L$. Let $DF$ and circle $K$ intersect again at $Q$, and $DE$ and circle $L$ intersect again at $R$. Let $EQ$ and $FR$ intersect at $M$.\\ Prove that $I$, $A$, $M$ are collinear.
Let $p$ be a prime number. Let $\mathbb F_p$ denote the integers modulo $p$, and let $\mathbb F_p[x]$ be the set of polynomials with coefficients in $\mathbb F_p$. Define $\Psi : \mathbb F_p[x] \to \mathbb F_p[x]$ by \[ \Psi\left( \sum_{i=0}^n a_i x^i \right) = \sum_{i=0}^n a_i x^{p^i}. \] Prove that for nonzero polynomials $F,G \in \mathbb F_p[x]$, \[ \Psi(\gcd(F,G)) = \gcd(\Psi(F), \Psi(G)). \] Here, a polynomial $Q$ divides $P$ if there exists $R \in \mathbb F_p[x]$ such that $P(x) - Q(x) R(x)$ is the polynomial with all coefficients $0$ (with all addition and multiplication in the coefficients taken modulo $p$), and the gcd of two polynomials is the highest degree polynomial with leading coefficient $1$ which divides both of them. A non-zero polynomial is a polynomial with not all coefficients $0$. As an example of multiplication, $(x+1)(x+2)(x+3) = x^3+x^2+x+1$ in $\mathbb F_5[x]$. [i]Proposed by Mark Sellke[/i]
The plan considers $51$ points of integer coordinates, so that the distances between any two points are natural numbers. Show that at least $49\%$ of the distances are even.
Aws plays a solitaire game on a fifty-two card deck: whenever two cards of the same color are adjacent, he can remove them. Aws wins the game if he removes all the cards. If Aws starts with the cards in a random order, what is the probability for him to win?
The checker is standing on the corner field of a $n\times n$ chess-board. Each of two players moves it in turn to the neighbour (i.e. that has the common side) field. It is forbidden to move to the field, the checker has already visited. That who cannot make a move losts. a) Prove that for even $n$ the first can always win, and if $n$ is odd, than the second can always win. b) Who wins if the checker stands initially on the neighbour to the corner field?
An acute angle $A$ and a point $E$ inside it are given. Construct points $B, C$ on the sides of the angle such that $E$ is the center of the Euler circle of triangle $ABC$. (E. Diomidov)
A square pyramid with base $ABCD$ and vertex $E$ has eight edges of length 4. A plane passes through the midpoints of $\overline{AE}$, $\overline{BC}$, and $\overline{CD}$. The plane's intersection with the pyramid has an area that can be expressed as $\sqrt{p}$. Find $p$.
Consider the set $X =\{1, 2,3, ...,2018\}$. How many positive integers $k$ with $2 \le k \le 2017$ that satisfy the following conditions: i) There exists some partition of the set $X$ into $1009$ disjoint pairs which are $(a_1, b_1),(a_2, b_2), ...,(a_{1009}, b_{1009})$ with $|a_i - b_i| \in \{1, k\}$. ii) For all partitions satisfy the condition (i), the sum $T = \sum^{1009}_{i=1} |a_i - b_i|$ has the right most digit is $9$
The 16 fields of a $4 \times 4$ checker board can be arranged in 18 lines as follows: the four lines, the four columns, the five diagonals from north west to south east and the five diagonals from north east to south west. These diagonals consists of 2,3 or 4 edge-adjacent fields of same colour; the corner fields of the chess board alone do not form a diagonal. Now, we put a token in 10 of the 16 fields. Each of the 18 lines contains an even number of tokens contains a point. What is the highest possible point number when can be achieved by optimal placing of the 10 tokens. Explain your answer.
Estimate the number of ordered pairs $(p,q)$ of positive integers at most $2020$ such that the cubic equation $x^3-px-q=0$ has three distinct real roots. If your estimate is $E$ and the answer is $A$, your score for this problem will be \[\Big\lfloor15\min\Big(\frac{A}{E},\frac{E}{A}\Big)\Big\rfloor.\] [i]Proposed by Alex Li[/i]
Let $ABCDEF$ be a regular octahedron with unit side length, such that $ABCD$ is a square. Points $G, H$ are on segments $BE, DF$ respectively. The planes $AGD$ and $BCH$ divide the octahedron into three pieces, each with equal volume. Compute $BG$.
Some squares of a $1999\times 1999$ board are occupied with pawns. Find the smallest number of pawns for which it is possible that for each empty square, the total number of pawns in the row or column of that square is at least $1999$.
Hapi, the god of the annual flooding of the Nile is preparing for this year’s flooding. The shape of the channel of the Nile can be described by the function $y = \frac{-1000}{ x^2+100}$ where the $x$ and $y$ coordinates are in metres. The depth of the river is $5$ metres now. Hapi plans to increase the water level by $3$ metres. How many metres wide will the river be after the flooding? The depth of the river is always measured at its deepest point. [img]https://cdn.artofproblemsolving.com/attachments/8/3/4e1d277e5cacf64bf82c110d521747592b928e.png[/img]
Let define $P_{n}(x)=x^{n-1}+x^{n-2}+x^{n-3}+ \dots +x+1$ for every positive integer $n$. Prove that for every positive integer $a$ one can find a positive integer $n$ and polynomials $R(x)$ and $Q(x)$ with integer coefficients such that \[P_{n}(x)= [1+ax+x^{2}R(x)] Q(x).\]
[b]p1.[/b] A Slavic dragon has three heads. A knight fights the dragon. If the knight cuts off one dragon’s head three new heads immediately grow. Is it possible that the dragon has $2018$ heads at some moment of the fight? [b]p2.[/b] Peter has two squares $3\times 3$ and $4\times 4$. He must cut one of them or both of them in no more than four parts in total. Is Peter able to assemble a square using all these parts? [b]p3.[/b] Usually, dad picks up Constantine after his music lessons and they drive home. However, today the lessons have ended earlier and Constantine started walking home. He met his dad $14$ minutes later and they drove home together. They arrived home $6$ minutes earlier than usually. Home many minutes earlier than usual have the lessons ended? Please, explain your answer. [b]p4.[/b] All positive integers from $1$ to $2018$ are written on a blackboard. First, Peter erased all numbers divisible by $7$. Then, Natalie erased all remaining numbers divisible by $11$. How many numbers did Natalie remove? Please, explain your answer. [b]p5.[/b] $30$ students took part in a mathematical competition consisting of four problems. $25$ students solved the first problem, $24$ students solved the second problem, $22$ students solved the third, and, finally, $21$ students solved the fourth. Show that there are at least two students who solved all four problems. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Given a positive integer $n$, let $d(n)$ be the largest positive divisor of $n$ less than $n$. For example, $d(8) = 4$ and $d(13) = 1$. A sequence of positive integers $a_1, a_2,\dots$ satisfies \[a_{i+1} = a_i +d(a_i),\] for all positive integers $i$. Prove that regardless of the choice of $a_1$, there are infinitely many terms in the sequence divisible by $3^{2011}$.