Found problems: 85335
Suppose that $a$ cows give $b$ gallons of milk in $c$ days. At this rate, how many gallons of milk will $d$ cows give in $e$ days?
${ \textbf{(A)}\ \frac{bde}{ac}\qquad\textbf{(B)}\ \frac{ac}{bde}\qquad\textbf{(C)}\ \frac{abde}{c}\qquad\textbf{(D)}}\ \frac{bcde}{a}\qquad\textbf{(E)}\ \frac{abc}{de}$
There are $20$ pupils in the Backwoods school. Any two of them have a common grandfather. Prove that there exist $14$ pupils all of whom have a common grandfather.
(AV Shapovalov)
In the triangle $ABC$, the angle $\alpha = \angle BAC$ and the side $a = BC$ are given. Assume that $a = \sqrt{rR}$, where $r$ is the inradius and $R$ the circumradius. Compute all possible lengths of sides $AB$ and $AC.$
In the triangle $ABC$ on the sides $AB$ and $AC$, points $D$ and E are chosen, respectively. Can the segments $CD$ and $BE$ divide $ABC$ into four parts of the same area?
[img]https://cdn.artofproblemsolving.com/attachments/1/c/3bbadab162b22530f1b254e744ecd068dea65e.png[/img]
Let $n, k$ be positive integers with $k \geq 3$. The edges of of a complete graph $K_n$ are colored in $k$ colors, such that for any color $i$ and any two vertices, there exists a path between them, consisting only of edges in color $i$. Prove that there exist three vertices $A, B, C$ of $K_n$, such that $AB, BC$ and $CA$ are all distinctly colored.
Given two non-negative integers $m>n$, let's say that $m$ [i]ends in[/i] $n$ if we can get $n$ by erasing some digits (from left to right) in the decimal representation of $m$. For example, 329 ends in 29, and also in 9.
Determine how many three-digit numbers end in the product of their digits.
Determine the number of $ 8$-tuples of nonnegative integers $ (a_1,a_2,a_3,a_4,b_1,b_2,b_3,b_4)$ satisfying $ 0\le a_k\le k$, for each $ k \equal{} 1,2,3,4$, and $ a_1 \plus{} a_2 \plus{} a_3 \plus{} a_4 \plus{} 2b_1 \plus{} 3b_2 \plus{} 4b_3 \plus{} 5b_4 \equal{} 19$.
Let $n$ be a positive integer. Find the maximal number of non-congruent triangles whose sides lengths are integers $\leq n.$
Given a sequence $(x_n )$ such that $\lim_{n\to \infty} x_n - x_{n-2}=0,$ prove that
$$\lim_{n\to \infty} \frac{x_n -x_{n-1}}{n}=0.$$
Let $ABCD$ be a tetrahedron whose six side lengths are all integers, and let $N$ denote the sum of these side lengths. There exists a point $P$ inside $ABCD$ such that the feet from $P$ onto the faces of the tetrahedron are the orthocenter of $\triangle ABC$, centroid of $\triangle BCD$, circumcenter of $\triangle CDA$, and orthocenter of $\triangle DAB$. If $CD = 3$ and $N < 100{,}000$, determine the maximum possible value of $N$.
[i]Proposed by Sammy Luo and Evan Chen[/i]
Prove that for positive real numbers $x$, $y$, $z$, \[ x^3(y^2+z^2)^2 + y^3(z^2+x^2)^2+z^3(x^2+y^2)^2 \geq xyz\left[xy(x+y)^2 + yz(y+z)^2 + zx(z+x)^2\right].\] [i]Zarathustra (Zeb) Brady.[/i]
Given positive integer $n,k$ such that $2 \le n <2^k$. Prove that there exist a subset $A$ of $\{0,1,\cdots,n\}$ such that for any $x \neq y \in A$, ${y\choose x}$ is even, and $$|A| \ge \frac{{k\choose \lfloor \frac{k}{2} \rfloor}}{2^k} \cdot (n+1)$$
There are $n$ cities, $2$ airline companies in a country. Between any two cities, there is exactly one $2$-way flight connecting them which is operated by one of the two companies. A female mathematician plans a travel route, so that it starts and ends at the same city, passes through at least two other cities, and each city in the route is visited once. She finds out that wherever she starts and whatever route she chooses, she must take flights of both companies. Find the maximum value of $n$.
There is a football championship with $6$ teams involved, such that for any $2$ teams $A$ and $B$, $A$ plays with $B$ and $B$ plays with $A$ ($2$ such games are distinct). After every match, the winning teams gains $3$ points, the loosing team gains $0$ points and if there is a draw, both teams gain $1$ point each.\\ \\
In the end, the team standing on the last place has $12$ points and there are no $2$ teams that scored the same amount of points.\\ \\
For all the remaining teams, find their final scores and provide an example with the outcomes of all matches for at least one of the possible final situations.
$\textit{(Andrei Bâra)}$
If in triangle $ABC$ , $AC$=$15$, $BC$=$13$ and $IG||AB$ where $I$ is the incentre and $G$ is the centroid , what is the area of triangle $ABC$ ?
Let $ABC$ be a scalene triangle with $\angle BAC>90^\circ$. Let $D$ and $E$ be two points on the side $BC$ such that $\angle BAD=\angle ACB$ and $\angle CAE=\angle ABC$. The angle-bisector of $\angle ACB$ meets $AD$ at $N$, If $MN\parallel BC$, determine $\angle (BM, CN)$.
[i]Petru Braica[/i]
Prove that for any positive integer $n$, there exist pairwise distinct positive integers $a,b,c$, not equal to $n$, such that $ab+n, ac+n, bc+n$ are all perfect squares.
The sequence $(x_n)$ is defined by formulas
$$
x_1=c,\; x_{n+1} = cx_n + \sqrt{(c^2-1)(x_n^2-1)} \quad\text{ for }\quad n=1,2,\ldots$$
Prove that if $ c $ is a natural number, then all numbers $ x_n $ are natural.
Let $ I$ be an ideal of the ring $ R$ and $ f$ a nonidentity permutation of the set $ \{ 1,2,\ldots, k \}$ for some $ k$. Suppose that for every $ 0 \not\equal{} a \in R, \;aI \not\equal{} 0$ and $ Ia \not\equal{}0$ hold; furthermore, for any elements $ x_1,x_2,\ldots ,x_k \in I$, \[ x_1x_2\ldots x_k\equal{}x_{1f}x_{2f}\ldots x_{kf}\] holds. Prove that $ R$ is commutative.
[i]R. Wiegandt[/i]
A quadrilateral is cut from a piece of gift wrapping paper, which has equally wide white and gray stripes.
The grey stripes in the quadrilateral have a combined area of $10$. Determine the area of the quadrilateral.
[img]https://1.bp.blogspot.com/-ia13b4RsNs0/XzP0cepAcEI/AAAAAAAAMT8/0UuCogTRyj4yMJPhfSK3OQihRqfUT7uSgCLcBGAsYHQ/s0/2020%2Bmohr%2Bp2.png[/img]
[b]p1.[/b] A permutation on $\{1, 2,..., n\}$ is an ordered arrangement of the numbers. For example, $32154$ is a permutation of $\{1, 2, 3, 4, 5\}$. Does there exist a permutation $a_1a_2... a_n$ of $\{1, 2,..., n\}$ such that $i+a_i$ is a perfect square for every $1 \le i \le n$ when
a) $n = 6$ ?
b) $n = 13$ ?
c) $n = 86$ ?
Justify your answers.
[b]p2.[/b] Circle $C$ and circle $D$ are tangent at point $P$. Line $L$ is tangent to $C$ at point $Q$ and to $D$ at point $R$ where $Q$ and $R$ are distinct from $P$. Circle $E$ is tangent to $C, D$, and $L$, and lies inside triangle $PQR$. $C$ and $D$ both have radius $8$. Find the radius of $E$, and justify your answer.
[img]https://cdn.artofproblemsolving.com/attachments/f/b/4b98367ea64e965369345247fead3456d3d18a.png[/img]
[b]p3.[/b] (a) Prove that $\sin 3x = 4 \cos^2 x \sin x - \sin x$ for all real $x$.
(b) Prove that $$(4 \cos^2 9^o - 1)(4 \cos^2 27^o - 1)(4 cos^2 81^o - 1)(4 cos^2 243^o - 1)$$ is an integer.
[b]p4.[/b] Consider a $3\times 3\times 3$ stack of small cubes making up a large cube (as with the small cubes in a Rubik's cube). An ant crawls on the surface of the large cube to go from one corner of the large cube to the opposite corner. The ant walks only along the edges of the small cubes and covers exactly nine of these edges. How many different paths can the ant take to reach its goal?
[b]p5.[/b] Let $m$ and $n$ be positive integers, and consider the rectangular array of points $(i, j)$ with $1 \le i \le m$, $1 \le j \le n$. For what pairs m; n of positive integers does there exist a polygon for which the $mn$ points $(i, j)$ are its vertices, such that each edge is either horizontal or vertical? The figure below depicts such a polygon with $m = 10$, $n = 22$. Thus $10$, $22$ is one such pair.
[img]https://cdn.artofproblemsolving.com/attachments/4/5/c76c0fe197a8d1ebef543df8e39114fe9d2078.png[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
In the Cartesian plane, a line segment is called [i]tame[/i] if it lies parallel to one of the coordinate axes and its distance to this axis is an integer. Otherwise it is called [i]wild[/i].
Let $m$ and $n$ be odd positive integers. The rectangle with vertices $(0,0),(m,0),(m,n)$ and $(0,n)$ is partitioned into finitely many triangles. Let $M$ be the set of these triangles. Assume that
(1) Each triangle from $M$ has at least one tame side.
(2) For each tame side of a triangle from $M$, the corresponding altitude has length $1$.
(3) Each wild side of a triangle from $M$ is a common side of exactly two triangles from $M$.
Show that at least two triangles from $M$ have two tame sides each.
Let $n\ge 3$ be an integer. Lucas and Matías play a game in a regular $n$-sided polygon with a vertex marked as a trap. Initially Matías places a token at one vertex of the polygon. In each step, Lucas says a positive integer and Matías moves the token that number of vertices clockwise or counterclockwise, at his choice.
a) Determine all the $n\ge 3$ such that Matías can locate the token and move it in such a way as to never fall into the trap, regardless of the numbers Lucas says. Give the strategy to Matías.
b) Determine all the $n\ge 3$ such that Lucas can force Matías to fall into the trap. Give the strategy to Lucas.
Note. The two players know the value of $n$ and see the polygon.
Given an integer number $n \ge 2$, show that there exists a function $f : R \to R$ such that $f(x) + f(2x) + ...+ f(nx) = 0$, for all $x \in R$, and $f(x) = 0$ if and only if $x = 0$.
Let $1=d_1<d_2<d_3<\dots<d_k=n$ be the divisors of $n$. Find all values of $n$ such that $n=d_2^2+d_3^3$.