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 all positive integers $n>1$ such that for any divisor $d$ of $n,$ the numbers $d^2-d+1$ and $d^2+d+1$ are prime. [i]Lucian Petrescu[/i]
Show that $ 3^{2008} \plus{} 4^{2009}$ can be written as product of two positive integers each of which is larger than $ 2009^{182}$.
Find the sum of all positive integers $b<1000$ such that the base-$b$ integer $36_b$ is a perfect square and the base-$b$ integer $27_b$ is a perfect cube.
Let ABCD be a trapezoid with $AB \parallel CD, AB = 5, BC = 9, CD = 10,$ and $DA = 7$. Lines $BC$ and $DA$ intersect at point $E$. Let $M$ be the midpoint of $CD$, and let $N$ be the intersection of the circumcircles of $\triangle BMC$ and $\triangle DMA$ (other than $M$). If $EN^2 = \tfrac ab$ for relatively prime positive integers $a$ and $b$, compute $100a + b$.
As shown in the figure, triangle $ABC$ is divided into six smaller triangles by lines drawn from the vertices through a common interior point. The areas of four of these triangles are as indicated. Find the area of triangle $ABC$. [asy] size(200); pair A=origin, B=(14,0), C=(9,12), D=foot(A, B,C), E=foot(B, A, C), F=foot(C, A, B), H=orthocenter(A, B, C); draw(F--C--A--B--C^^A--D^^B--E); label("$A$", A, SW); label("$B$", B, SE); label("$C$", C, N); label("84", centroid(H, C, E), fontsize(9.5)); label("35", centroid(H, B, D), fontsize(9.5)); label("30", centroid(H, F, B), fontsize(9.5)); label("40", centroid(H, A, F), fontsize(9.5));[/asy]
A massless string is wrapped around a frictionless pulley of mass $M$. The string is pulled down with a force of 50 N, so that the pulley rotates due to the pull. Consider a point $P$ on the rim of the pulley, which is a solid cylinder. The point has a constant linear (tangential) acceleration component equal to the acceleration of gravity on Earth, which is where this experiment is being held. What is the weight of the cylindrical pulley, in Newtons? [i](Proposed by Ahaan Rungta)[/i] [hide="Note"] This problem was not fully correct. Within friction, the pulley cannot rotate. So we responded: [quote]Excellent observation! This is very true. To submit, I'd say just submit as if it were rotating and ignore friction. In some effects such as these, I'm pretty sure it turns out that friction doesn't change the answer much anyway, but, yes, just submit as if it were rotating and you are just ignoring friction. [/quote]So do this problem imagining that the pulley does rotate somehow. [/hide]
In $\triangle ABC$, $\angle BAC = 60^{\circ}$, point $D$ lies on side $BC$, $O_1$ and $O_2$ are the centers of the circumcircles of $\triangle ABD$ and $\triangle ACD$, respectively. Lines $BO_1$ and $CO_2$ intersect at point $P$. If $I$ is the incenter of $\triangle ABC$ and $H$ is the orthocenter of $\triangle PBC$, then prove that the four points $B,C,I,H$ are on the same circle.
Mrs. Krabappel gives a five-question pop quiz one Monday. Nobody is ready, so everyone guesses and gets exactly three questions correct. The students later discover that they each answered a different set of three questions correctly. What is the largest possible number of students in the class? $\mathrm{(A) \ } 9 \qquad \mathrm{(B) \ } 10 \qquad \mathrm {(C) \ } 11 \qquad \mathrm{(D) \ } 12 \qquad \mathrm{(E) \ } 13$
Find, with proof, all solutions of the equation $\frac 1x +\frac 2y- \frac 3z = 1$ in positive integers $x, y, z.$
Unit cubes are made into beads by drilling a hole through them along a diagonal. The beads are put on a string in such a way that they can move freely in space under the restriction that the vertices of two neighboring cubes are touching. Let $ A$ be the beginning vertex and $ B$ be the end vertex. Let there be $ p \times q \times r$ cubes on the string $ (p, q, r \geq 1).$ [i](a)[/i] Determine for which values of $ p, q,$ and $ r$ it is possible to build a block with dimensions $ p, q,$ and $ r.$ Give reasons for your answers. [i](b)[/i] The same question as (a) with the extra condition that $ A \equal{} B.$
$A(0,2)$, and two points $B,C$ on parabola $y^2=x+4$ satisfy that $AB\perp BC$. Find the range value of $y_C$.
Let $n,k$ be given positive integers with $n>k$. Prove that: \[ \frac{1}{n+1} \cdot \frac{n^n}{k^k (n-k)^{n-k}} < \frac{n!}{k! (n-k)!} < \frac{n^n}{k^k(n-k)^{n-k}} \]
The two angles of the squares are adjacent, and the extension of the diagonals of one square intersect the diagonal of another square at point $O$ (see figure). Prove that $O$ is the midpoint of $AB$. [img]https://cdn.artofproblemsolving.com/attachments/7/8/8daaaa55c38e15c4a8ac7492c38707f05475cc.png[/img]
Medians $AD, BE$, and $CF$ of triangle $ABC$ intersect at point $M$. Is it possible that the circles with radii $MD, ME$, and $MF$ a) all have areas smaller than the area of triangle $ABC$, b) all have areas greater than the area of triangle $ABC$, c) all have areas equal to the area of triangle $ABC$?
There are $10$ cups, each having $10$ pebbles in them. Two players $A$ and $B$ play a game, repeating the following in order each move: $\bullet$ $B$ takes one pebble from each cup and redistributes them as $A$ wishes. $\bullet$ After $B$ distributes the pebbles, he tells how many pebbles are in each cup to $A$. Then $B$ destroys all the cups having no pebbles. $\bullet$ $B$ switches the places of two cups without telling $A$. After finitely many moves, $A$ can guarantee that $n$ cups are destroyed. Find the maximum possible value of $n$. (Note that $A$ doesn't see the cups while playing.) [i]Proposed by Emre Osman[/i]
Three edges of a parallelepiped lie on three intersecting diagonals of the lateral faces of a triangular prism. Find the ratio of the volumes of the parallelepiped and the prism.
Consider the matrices $A\in \mathcal{M}_{m,n}(\mathbb{C})$ and $B\in \mathcal{M}_{n,m}(\mathbb{C})$ with $n\le m$. It is given that $\text{rank}(AB)=n$ and $(AB)^2=AB$. a)Prove that $(BA)^3=(BA)^2$. b)Find $BA$.
Find all polynomials $p$ with real coefficients such that for all real $x$ , $xp(x)p(1-x)+x^3 +100 \ge 0$.
A regular unit $7$-simplex is a polytope in $7$-dimensional space with $8$ vertices that are all exactly a distance of $ 1$ apart. (It is the $7$-dimensional analogue to the triangle and the tetrahedron.) In this $7$-dimensional space, there exists a point that is equidistant from all $8$ vertices, at a distance $d$. Determine $d$.
Suppose a circle passes through the feet of the symmedians of a non-isosceles triangle $ABC$ , and is tangent to one of the sides. Show that $a^2 +b^2, b^2 + c^2 , c^2 + a^2$ are in geometric progression when taken in some order
Alice and Bob play a game. First, Alice secretly picks a finite set $S$ of lattice points in the Cartesian plane. Then, for every line $\ell$ in the plane which is horizontal, vertical, or has slope $+1$ or $-1$, she tells Bob the number of points of $S$ that lie on $\ell$. Bob wins if he can determine the set $S$. Prove that if Alice picks $S$ to be of the form \[S = \{(x, y) \in \mathbb{Z}^2 \mid m \le x^2 + y^2 \le n\}\] for some positive integers $m$ and $n$, then Bob can win. (Bob does not know in advance that $S$ is of this form.) [i]Proposed by Mark Sellke[/i]
Let $X$ be a regular topological space and let $S$ be a countably compact dense subspace in $X$. (The countably compact property means that every infinite subset of $S$ has an accumulation point in $S$.) Show that $S$ is also $G_\delta$-dense in $X$, i.e., $S$ intersects all nonempty $G_\delta$ sets.
[b]p1.[/b] Zion, RJ, Cam, and Tre decide to start learning languages. The four most popular languages that Duke offers are Spanish, French, Latin, and Korean. If each friend wants to learn exactly three of these four languages, how many ways can they pick courses such that they all attend at least one course together? [b]p2. [/b] Suppose we wrote the integers between $0001$ and $2019$ on a blackboard as such: $$000100020003 · · · 20182019.$$ How many $0$’s did we write? [b]p3.[/b] Duke’s basketball team has made $x$ three-pointers, $y$ two-pointers, and $z$ one-point free throws, where $x, y, z$ are whole numbers. Given that $3|x$, $5|y$, and $7|z$, find the greatest number of points that Duke’s basketball team could not have scored. [b]p4.[/b] Find the minimum value of $x^2 + 2xy + 3y^2 + 4x + 8y + 12$, given that $x$ and $y$ are real numbers. Note: calculus is not required to solve this problem. [b]p5.[/b] Circles $C_1, C_2$ have radii $1, 2$ and are centered at $O_1, O_2$, respectively. They intersect at points $ A$ and $ B$, and convex quadrilateral $O_1AO_2B$ is cyclic. Find the length of $AB$. Express your answer as $x/\sqrt{y}$ , where $x, y$ are integers and $y$ is square-free. [b]p6.[/b] An infinite geometric sequence $\{a_n\}$ has sum $\sum_{n=0}^{\infty} a_n = 3$. Compute the maximum possible value of the sum $\sum_{n=0}^{\infty} a_{3n} $. [b]p7.[/b] Let there be a sequence of numbers $x_1, x_2, x_3,...$ such that for all $i$, $$x_i = \frac{49}{7^{\frac{i}{1010}} + 49}.$$ Find the largest value of $n$ such that $$\left\lfloor \sum_{i=1}{n} x_i \right\rfloor \le 2019.$$ [b]p8.[/b] Let $X$ be a $9$-digit integer that includes all the digits $1$ through $9$ exactly once, such that any $2$-digit number formed from adjacent digits of $X$ is divisible by $7$ or $13$. Find all possible values of $X$. [b]p9.[/b] Two $2025$-digit numbers, $428\underbrace{\hbox{99... 99}}_{\hbox{2019 \,\, 9's}}571$ and $571\underbrace{\hbox{99... 99}}_{\hbox{2019 \,\, 9's}}428$ , form the legs of a right triangle. Find the sum of the digits in the hypotenuse. [b]p10.[/b] Suppose that the side lengths of $\vartriangle ABC$ are positive integers and the perimeter of the triangle is $35$. Let $G$ the centroid and $I$ be the incenter of the triangle. Given that $\angle GIC = 90^o$ , what is the length of $AB$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $n$ be a positive integer. If $x_1, x_2, \ldots, x_n \geq 0$, $x_1+x_2+\ldots+x_n=1$ and, assuming $x_{n+1}=x_1$, find the maximal value of $$\sum_{k=1}^n \frac{1+x_k^2+x_k^4}{1+x_{k+1}+x_{k+1}^2+x_{k+1}^3+x_{k+1}^4}.$$