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

[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes \[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\] [b](b)[/b] Find the rearrangement that minimizes $Q.$
Consider a triangle with sides of length \( a \), \( b \), and \( c \) that satisfy the following conditions: \[ a + b = c + 3 \quad c^2 + 9 = 2ab \] Find the area of the triangle.
On the plane is give a broken line $ABCD$ in which $AB = BC = CD = 1$, and $AD$ is not equal to $1$. The positions of $B$ and $C$ are fixed but $A$ and $D$ change their positions in turn according to the following rule (preserving the distance rules given): the point $A$ is reflected with respect to the line $BD$, then $D$ is reflected with respect to the line $AC$ (in which $A$ occupies its new position), then $A$ is reflected with respect to the line $BD$ ($D$ occupying its new position), $D$ is reflected with respect to the line $AC$, and so on. Prove that after several steps $A$ and $D$ coincide with their initial positions. (M Kontzewich)
Let $ P$ be a point inside a regular tetrahedron $ T$ of unit volume. The four planes passing through $ P$ and parallel to the faces of $ T$ partition $ T$ into 14 pieces. Let $ f(P)$ be the joint volume of those pieces that are neither a tetrahedron nor a parallelepiped (i.e., pieces adjacent to an edge but not to a vertex). Find the exact bounds for $ f(P)$ as $ P$ varies over $ T.$
If $ABCD$ is a cyclic quadrilateral, then prove that the incenters of the triangles $ABC$, $BCD$, $CDA$, $DAB$ are the vertices of a rectangle.
[b]p1. [/b] If $f(x) = 3x - 1$, what is $f^6(2) = (f \circ f \circ f \circ f \circ f \circ f)(2)$? [b]p2.[/b] A frog starts at the origin of the $(x, y)$ plane and wants to go to $(6, 6)$. It can either jump to the right one unit or jump up one unit. How many ways are there for the frog to jump from the origin to $(6, 6)$ without passing through point $(2, 3)$? [b]p3.[/b] Alfred, Bob, and Carl plan to meet at a café between noon and $2$ pm. Alfred and Bob will arrive at a random time between noon and $2$ pm. They will wait for $20$ minutes or until $2$ pm for all $3$ people to show up after which they will leave. Carl will arrive at the café at noon and leave at $1:30$ pm. What is the probability that all three will meet together? [b]p4.[/b] Let triangle $ABC$ be isosceles with $AB = AC$. Let $BD$ be the altitude from $ B$ to $AC$, $E$ be the midpoint of $AB$, and $AF$ be the altitude from $ A$ to $BC$. If $AF = 8$ and the area of triangle $ACE$ is $ 8$, find the length of $CD$. [b]p5.[/b] Find the sum of the unique prime factors of $(2018^2 - 121) \cdot (2018^2 - 9)$. [b]p6.[/b] Compute the remainder when $3^{102} + 3^{101} + ... + 3^0$ is divided by $101$. [b]p7.[/b] Take regular heptagon $DUKMATH$ with side length $ 3$. Find the value of $$\frac{1}{DK}+\frac{1}{DM}.$$ [b]p8.[/b] RJ’s favorite number is a positive integer less than $1000$. It has final digit of $3$ when written in base $5$ and final digit $4$ when written in base $6$. How many guesses do you need to be certain that you can guess RJ’s favorite number? [b]p9.[/b] Let $f(a, b) = \frac{a^2+b^2}{ab-1}$ , where $a$ and $b$ are positive integers, $ab \ne 1$. Let $x$ be the maximum positive integer value of $f$, and let $y$ be the minimum positive integer value of f. What is $x - y$ ? [b]p10.[/b] Haoyang has a circular cylinder container with height $50$ and radius $5$ that contains $5$ tennis balls, each with outer-radius $5$ and thickness $1$. Since Haoyang is very smart, he figures out that he can fit in more balls if he cuts each of the balls in half, then puts them in the container, so he is ”stacking” the halves. How many balls would he have to cut up to fill up the container? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Define $ n!!$ to be $ n(n\minus{}2)(n\minus{}4)\ldots3\cdot1$ for $ n$ odd and $ n(n\minus{}2)(n\minus{}4)\ldots4\cdot2$ for $ n$ even. When $ \displaystyle \sum_{i\equal{}1}^{2009} \frac{(2i\minus{}1)!!}{(2i)!!}$ is expressed as a fraction in lowest terms, its denominator is $ 2^ab$ with $ b$ odd. Find $ \displaystyle \frac{ab}{10}$.
i) How many integers $n$ are there such that $n$ is divisible by $9$ and $n+1$ is divisible by $25$? ii) How many integers $n$ are there such that $n$ is divisible by $21$ and $n+1$ is divisible by $165$? iii) How many integers $n$ are there such that $n$ is divisible by $9, n + 1$ is divisible by $25$, and $n + 2$ is divisible by $4$?
a) Show that the product of $5$ consecutive even integers is divisible by $15$. b) Determine the largest integer $D$ such that the product of $5$ consecutive even integers is always divisible by $D$.
Let $a$ and $b$ be distinct real numbers. Prove that there exist integers $m$ and $n$ such that $am+bn<0$, $bm+an>0$.
A lampshade is made in the form of the lateral surface of the frustum of a right circular cone. The height of the frustum is $3\sqrt{3}$ inches, its top diameter is 6 inches, and its bottom diameter is 12 inches. A bug is at the bottom of the lampshade and there is a glob of honey on the top edge of the lampshade at the spot farthest from the bug. The bug wants to crawl to the honey, but it must stay on the surface of the lampshade. What is the length in inches of its shortest path to the honey? [center] [img]https://cdn.artofproblemsolving.com/attachments/b/4/23f9bc88ea057cb2676f2b8b373330b0f5df69.png[/img][/center] $\textbf{(A) } 6 + 3\pi\qquad \textbf{(B) }6 + 6\pi\qquad \textbf{(C) } 6\sqrt3 \qquad \textbf{(D) } 6\sqrt5 \qquad \textbf{(E) } 6\sqrt3 + \pi$
Let $n\ge  2$ be a positive integer and $p $ a prime such that $n|p-1$ and $p | n^3-1$. Show $ 4p-3$ is a square.
The graph shows the distribution of the number of children in the families of the students in Ms. Jordan's English class. The median number of children in the family for this distribution is [asy] unitsize(12); for(int i = 1; i <= 7; ++i) { draw((0,i)--(19,i),dotted); draw((-0.5,i)--(0.5,i)); } for(int i = 0; i <= 5; ++i) { draw((3*i+2,0)--(3*i+2,-0.5)); } fill((1,0)--(1,2)--(3,2)--(3,0)--cycle,white); fill((4,0)--(4,1)--(6,1)--(6,0)--cycle,white); fill((7,0)--(7,2)--(9,2)--(9,0)--cycle,white); fill((10,0)--(10,2)--(12,2)--(12,0)--cycle,white); fill((13,0)--(13,6)--(15,6)--(15,0)--cycle,white); draw((0,9)--(0,0)--(19,0)); draw((1,0)--(1,2)--(3,2)--(3,0)); draw((4,0)--(4,1)--(6,1)--(6,0)); draw((7,0)--(7,2)--(9,2)--(9,0)); draw((10,0)--(10,2)--(12,2)--(12,0)); draw((13,0)--(13,6)--(15,6)--(15,0)); label("$1$",(2,-0.5),S); label("$2$",(5,-0.5),S); label("$3$",(8,-0.5),S); label("$4$",(11,-0.5),S); label("$5$",(14,-0.5),S); label("$6$",(17,-0.5),S); label("$2$",(-0.5,2),W); label("$4$",(-0.5,4),W); label("$6$",(-0.5,6),W); label("$\textbf{Number of Children}$",(9,-1.5),S); label("$\textbf{in the Family}$",(9,-2.5),S); label("$\textbf{Number}$",(-1.5,6),W); label("$\textbf{of}$",(-3,5),W); label("$\textbf{Families}$",(-1.5,4),W); [/asy] $\text{(A)}\ 1 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 3 \qquad \text{(D)}\ 4 \qquad \text{(E)}\ 5$
Evaluate $ \int_0^{\frac {\pi}{2}} \frac {x^2}{(\cos x \plus{} x\sin x)^2}\ dx$ [color=darkblue]Virgil Nicula have already posted the integral[/color] :oops:
Let $p, q$ be real numbers. Knowing that there are positive real numbers $a, b, c$, different two by two, such that $$p=\frac{a^2}{(b-c)^2}+\frac{b^2}{(a-c)^2}+\frac{c^2}{(a-b)^2},$$ $$q=\frac{1}{(b-c)^2}+\frac{1}{(a-c)^2}+\frac{1}{(b-a)^2}$$ calculate the value of $$\frac{a}{(b-c)^2}+\frac{b}{(a-c)^2}+\frac{c}{(b-a)^2}$$ in terms of $p, q$.
A boy lives in a small island in which there are three roads at every junction. He starts from his home and walks along the roads. At each junction he would choose to turn to the road on his right or left alternatively, i.e., his choices would be . . ., left, right, left,... Prove that he will eventually return to his home.
Given a circular arc, find a triangle of the smallest possible area which covers the arc so that the endpoints of the arc lie on the same side of the triangle.
In triangle $ABC$, $AB = 1$ and $AC = 2$. Suppose there exists a point $P$ in the interior of triangle $ABC$ such that $\angle PBC = 70^{\circ}$, and that there are points $E$ and $D$ on segments $AB$ and $AC$, such that $\angle BPE = \angle EPA = 75^{\circ}$ and $\angle APD = \angle DPC = 60^{\circ}$. Let $BD$ meet $CE$ at $Q,$ and let $AQ$ meet $BC$ at $F.$ If $M$ is the midpoint of $BC$, compute the degree measure of $\angle MPF.$ [i]Authors: Alex Zhu and Ray Li[/i]
The sequence $a_0, a_1, a_2, ..$ is defined by $a_0 = a, a_{n+1} = a_n + L(a_n)$, where $L(m)$ is the last digit of $m$ (eg $L(14) = 4$). Suppose that the sequence is strictly increasing. Show that infinitely many terms must be divisible by $d = 3$. For what other d is this true?
Given a positive integer $k$, let $s(k)$ denote the sum of the digits of $k$. Let $a_1$, $a_2$, $a_3$, $...$ denote the strictly increasing sequence of all positive integers $n$ such that $s(7n + 1) = 7s(n) + 1$. Compute $a_{2023}$.
An altitude of a convex quadrilateral is a line through the midpoint of a side perpendicular to the opposite side. Show that the four altitudes are concurrent iff the quadrilateral is cyclic.
Given a regular 2007-gon. Find the minimal number $k$ such that: Among every $k$ vertexes of the polygon, there always exists 4 vertexes forming a convex quadrilateral such that 3 sides of the quadrilateral are also sides of the polygon.
In an acute-angled triangle $ABC$ the interior bisector of angle $A$ meets $BC$ at $L$ and meets the circumcircle of $ABC$ again at $N$. From $L$ perpendiculars are drawn to $AB$ and $AC$, with feet $K$ and $M$ respectively. Prove that the quadrilateral $AKNM$ and the triangle $ABC$ have equal areas.[i](IMO Problem 2)[/i] [i]Proposed by Soviet Union.[/i]
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
In square $ABCD,$ points $E$ and $F$ are chosen in the interior of sides $BC$ and $CD$, respectively. The line drawn from $F$ perpendicular to $AE$ passes through the intersection point $G$ of $AE$ and diagonal $BD$. A point $K$ is chosen on $FG$ such that $|AK|= |EF|$. Find $\angle EKF.$