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

Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$
Prove that for any positive real $x$ and $y$, holds the inequality $$\frac{1}{(x+y)^2}+\frac{1}{x^2}+\frac{1}{y^2} \ge \frac{9}{4xy}$$
Consider $ 2011 $ positive real numbers $ a_1,a_2,\ldots ,a_{2011} . $ If they are in geometric progression, show that there exists a real number $ \lambda $ such that any $ i\in\{ 1,2,\ldots , 1005 \} $ implies $ \lambda =a_i\cdot a_{2012-i} . $ Disprove the converse. [i]Teodor Radu[/i]
Show that each integer $n$ can be written as the sum of five perfect cubes (not necessarily positive).
Form an eight-digit number, using only the digits $1,2,3,4$ each twice, so that: there is one digit between the $1$'s, there are two digits between the $2$'s, there are three digits between the $3$'s, and there are four digits between the $4$'s.
A point $P{}$ is considered on the incircle of the triangle $ABC$. We draw the tangent segments from $P{}$ to the three excircles of $ABC$. Prove that from the obtained three tangent segments it is possible to make a right triangle if and only if the point $P{}$ lies on one of the lines connecting two of the midpoints of the sides of $ABC$.
$\mathbb{Q}$ is set of all rational numbers. Find all functions $f:\mathbb{Q}\times\mathbb{Q}\rightarrow\mathbb{Q}$ such that for all $x$, $y$, $z$ $\in\mathbb{Q}$ satisfy $f(x,y)+f(y,z)+f(z,x)=f(0,x+y+z)$
Define a sequence of integers $a_0=m, a_1=n$ and $a_{k+1}=4a_k-5a_{k-1}$ for all $k \ge 1$. Suppose $p>5$ is a prime with $p \equiv 1 \pmod{4}$. Prove that it is possible to choose $m,n$ such that $p \nmid a_k$ for any $k \ge 0$.
Let $ABC$ be an acute triangle. Let $DAC,EAB$, and $FBC$ be isosceles triangles exterior to $ABC$, with $DA=DC, EA=EB$, and $FB=FC$, such that \[ \angle ADC = 2\angle BAC, \quad \angle BEA= 2 \angle ABC, \quad \angle CFB = 2 \angle ACB. \] Let $D'$ be the intersection of lines $DB$ and $EF$, let $E'$ be the intersection of $EC$ and $DF$, and let $F'$ be the intersection of $FA$ and $DE$. Find, with proof, the value of the sum \[ \frac{DB}{DD'}+\frac{EC}{EE'}+\frac{FA}{FF'}. \]
Let $F(x,y)$ and $G(x,y)$ be relatively prime homogeneous polynomials of degree at least one having integer coefficients. Prove that there exists a number $c$ depending only on the degrees and the maximum of the absolute values of the coefficients of $F$ and $G$ such that $F(x,y)\neq G(x,y)$ for any integers $x$ and $y$ that are relatively prime and satisfy $\max \{ |x|,|y|\} > c$. [K. Gyory]
Twelve pigeons can eat $28$ slices of bread in $5$ minutes. Find the number of slices of bread $5$ pigeons can eat in $48$ minutes. [i]Individual #1[/i]
Two sides of a regular polygon of $n$ sides when extended meet at $28$ degrees. What is smallest possible value of $n$
A village is constructed in the form of a square, consisting of $9$ blocks , each of side length $\ell$, in a $3 \times 3$ formation . Each block is bounded by a bitumen road . If we commence at a corner of the village, what is the smallest distance we must travel along bitumen roads , if we are to pass along each section of bitumen road at least once and finish at the same corner? (Muscovite folklore)
Let $ABC$ be an acute-angled triangle and let $D$, $E$, and $F$ be the midpoints of $BC$, $CA$, and $AB$ respectively. Construct a circle, centered at the orthocenter of triangle $ABC$, such that triangle $ABC$ lies in the interior of the circle. Extend $EF$ to intersect the circle at $P$, $FD$ to intersect the circle at $Q$ and $DE$ to intersect the circle at $R$. Show that $AP=BQ=CR$.
Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]
Six-hundred fifty students were surveyed about their pasta preferences. The choices were lasagna, manicotti, ravioli and spaghetti. The results of the survey are displayed in the bar graph. What is the ratio of the number of students who preferred spaghetti to the number of students who preferred manicotti? [asy] size(200); defaultpen(linewidth(0.7)); defaultpen(fontsize(8)); draw(origin--(0,250)); int i; for(i=0; i<6; i=i+1) { draw((0,50*i)--(5,50*i)); } filldraw((25,0)--(75,0)--(75,150)--(25,150)--cycle, gray, black); filldraw((75,0)--(125,0)--(125,100)--(75,100)--cycle, gray, black); filldraw((125,0)--(175,0)--(175,150)--(125,150)--cycle, gray, black); filldraw((225,0)--(175,0)--(175,250)--(225,250)--cycle, gray, black); label("$50$", (0,50), W); label("$100$", (0,100), W); label("$150$", (0,150), W); label("$200$", (0,200), W); label("$250$", (0,250), W); label(rotate(90)*"Lasagna", (50,0), S); label(rotate(90)*"Manicotti", (100,0), S); label(rotate(90)*"Ravioli", (150,0), S); label(rotate(90)*"Spaghetti", (200,0), S); label(rotate(90)*"$\mbox{Number of People}$", (-40,140), W);[/asy] $\textbf{(A)} \: \frac25\qquad \textbf{(B)} \: \frac12\qquad \textbf{(C)} \: \frac54\qquad \textbf{(D)} \: \frac53\qquad \textbf{(E)} \: \frac52$
Ephramis taking his final exams. He has $7$ exams and his school holds finals over $3$ days. For a certain arrangement of finals, let $f$ be the maximum number of finals Ephram takes on any given day. Find the expected value of $f$ .
Compute the number of (not necessarily convex) polygons in the coordinate plane with the following properties: [list] [*] If the coordinates of a vertex are $(x,y)$, then $x,y$ are integers and $1\leq |x|+|y|\leq 3$ [*] Every side of the polygon is parallel to either the x or y axis [*] The point $(0,0)$ is contained in the interior of the polygon. [/list] [i]2021 CCA Math Bonanza Lightning Round #4.2[/i]
Calculate the volume $ V $ of tetrahedron $ ABCD $ given the length $ d $ of edge $ AB $ and the area $ S $ of the projection of the tetrahedron on the plane perpendicular to the line $ AB $.
Solve the system of simultaneous equations \[\sqrt x - \frac 1y - 2w + 3z = 1,\]\[x + \frac{1}{y^2} - 4w^2 - 9z^2 = 3,\]\[x \sqrt x - \frac{1}{y^3} - 8w^3 + 27z^3 = -5,\]\[x^2 + \frac{1}{y^4} - 16w^4 - 81z^4 = 15.\]
Given $2025$ pairwise distinct positive integer numbers \(a_1, a_2, \ldots, a_{2025}\), find the maximum possible number of equal numbers among the fractions of the form \[ \frac{a_i^2 + a_j^2}{a_i + a_j} \] [i]Proposed by Mykhailo Shtandenko[/i]
The given triangular number table is as follows: [img]https://cdn.artofproblemsolving.com/attachments/a/0/123b7511850047f3cc51494f107703f2757085.png[/img] Among them, the numbers in the first row are $1, 2, 3, ..., 98, 99, 100$. Starting from the second row, each number is equal to the sum of the left and right numbers in the row above it. Find the value of $M$.
For each positive integer n, let $ f(n) \equal{} \sum_{k \equal{} 1}^{100} \lfloor \log_{10} (kn) \rfloor$. Find the largest value of n for which $ f(n) \le 300$. [b]Note:[/b] $ \lfloor x \rfloor$ is the greatest integer less than or equal to $ x$.
Let $ABCD$ be a cyclic quadrilateral with circumcentre $O$ and with $AC$ perpendicular to $BD$. Points $X$ and $Y$ lie on the circumcircle of the triangle $BOD$ such that $\angle AXO=\angle CYO=90^{\circ}$. Let $M$ be the midpoint of $AC$. Prove that $BD$ is tangent to the circumcircle of the triangle $MXY$.
Compute the sum of the series $\sum_{k=0}^{\infty} \frac{1}{(4k+1)(4k+2)(4k+3)(4k+4)} = \frac{1}{1\cdot2\cdot3\cdot4} + \frac{1}{5\cdot6\cdot7\cdot8} + ...$