Found problems: 85335
A digital display shows the current date as an $8$-digit integer consisting of a $4$-digit year, followed by a $2$-digit month, followed by a $2$-digit date within the month. For example, Arbor Day this year is displayed as 20230428. For how many dates in $2023$ will each digit appear an even number of times in the 8-digital display for that date?
$\textbf{(A)}~5\qquad\textbf{(B)}~6\qquad\textbf{(C)}~7\qquad\textbf{(D)}~8\qquad\textbf{(E)}~9$
Let $a$ and $b$ be positive integers with $b$ odd, such that the number $$\frac{(a+b)^2+4a}{ab}$$ is an integer. Prove that $a$ is a perfect square.
Inside an acute triangle $ABC$ is a point $P$ that is not the circumcenter. Prove that among the segments $AP$, $BP$ and $CP$, at least one is longer and at least one is shorter than the circumradius of $ABC$.
Find the number of positive integers $n$ such that the highest power of $7$ dividing $n!$ is $8$.
Let $\mathcal{F}$ be a family of (distinct) subsets of the set $\{1,2,\dots,n\}$ such that for all $A$, $B\in \mathcal{F}$,we have that $A^C\cup B\in \mathcal{F}$, where $A^C$ is the set of all members of ${1,2,\dots,n}$ that are not in $A$.
Prove that every $k\in {1,2,\dots,n}$ appears in at least half of the sets in $\mathcal{F}$.
[i]Stijn Cambie, Mohammad Javad Moghaddas Mehr[/i]
[u]Set 7[/u]
[b]p19.[/b] Let circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively, intersect at $X$ and $Y$ . A lies on $\omega_1$ and $B$ lies on $\omega_2$ such that $AO_1$ and $BO_2$ are both parallel to $XY$, and $A$ and $B$ lie on the same side of $O_1O_2$. If $XY = 60$, $\angle XAY = 45^o$, and $\angle XBY = 30^o$, then the length of $AB$ can be expressed in the form $\sqrt{a - b\sqrt2 + c\sqrt3}$, where $a, b, c$ are positive integers. Determine $a + b + c$.
[b]p20.[/b] If $x$ is a positive real number such that $x^{x^2}= 2^{80}$, find the largest integer not greater than $x^3$.
[b]p21.[/b] Justin has a bag containing $750$ balls, each colored red or blue. Sneaky Sam takes out a random number of balls and replaces them all with green balls. Sam notices that of the balls left in the bag, there are $15$ more red balls than blue balls. Justin then takes out $500$ of the balls chosen randomly. If $E$ is the expected number of green balls that Justin takes out, determine the greatest integer less than or equal to $E$.
[u]Set 8[/u]
These three problems are interdependent; each problem statement in this set will use the answers to the other two problems in this set. As such, let the positive integers $A, B, C$ be the answers to problems $22$, $23$, and $24$, respectively, for this set.
[b]p22.[/b] Let $WXYZ$ be a rectangle with $WX =\sqrt{5B}$ and $XY =\sqrt{5C}$. Let the midpoint of $XY$ be $M$ and the midpoint of $YZ$ be $N$. If $XN$ and $W Y$ intersect at $P$, determine the area of $MPNY$ .
[b]p23.[/b] Positive integers $x, y, z$ satisfy $$xy \equiv A \,\, (mod 5)$$
$$yz \equiv 2A + C\,\, (mod 7)$$
$$zx \equiv C + 3 \,\, (mod 9).$$ (Here, writing $a \equiv b \,\, (mod m)$ is equivalent to writing $m | a - b$.)
Given that $3 \nmid x$, $3 \nmid z$, and $9 | y$, find the minimum possible value of the product $xyz$.
[b]p24.[/b] Suppose $x$ and $y$ are real numbers such that $$x + y = A$$
$$xy =\frac{1}{36}B^2.$$ Determine $|x - y|$.
[u]Set 9[/u]
[b]p25. [/b]The integer $2017$ is a prime which can be uniquely represented as the sum of the squares of two positive integers: $$9^2 + 44^2 = 2017.$$ If $N = 2017 \cdot 128$ can be uniquely represented as the sum of the squares of two positive integers $a^2 +b^2$, determine $a + b$.
[b]p26.[/b] Chef Celia is planning to unveil her newest creation: a whole-wheat square pyramid filled with maple syrup. She will use a square flatbread with a one meter diagonal and cut out each of the five polygonal faces of the pyramid individually. If each of the triangular faces of the pyramid are to be equilateral triangles, the largest volume of syrup, in cubic meters, that Celia can enclose in her pyramid can be expressed as $\frac{a-\sqrt{b}}{c}$ where $a, b$ and $c$ are the smallest possible possible positive integers. What is $a + b + c$?
[b]p27.[/b] In the Cartesian plane, let $\omega$ be the circle centered at $(24, 7)$ with radius $6$. Points $P, Q$, and $R$ are chosen in the plane such that $P$ lies on $\omega$, $Q$ lies on the line $y = x$, and $R$ lies on the $x$-axis. The minimum possible value of $PQ+QR+RP$ can be expressed in the form $\sqrt{m}$ for some integer $m$. Find m.
[u]Set 10[/u]
[i]Deja vu?[/i]
[b]p28. [/b] Let $ABC$ be a triangle with incircle $\omega$. Let $\omega$ intersect sides $BC$, $CA$, $AB$ at $D, E, F$, respectively. Suppose $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ is $K$ and the area of $DEF$ is $\frac{m}{n}\cdot K$, where $m$ and $n$ are relatively prime positive integers, then compute $m + n$.
[b]p29.[/b] Sebastian is playing the game Split! again, but this time in a three dimensional coordinate system. He begins the game with one token at $(0, 0, 0)$. For each move, he is allowed to select a token on any point $(x, y, z)$ and take it off, replacing it with three tokens, one at $(x + 1, y, z)$, one at $(x, y + 1, z)$, and one at $(x, y, z + 1)$ At the end of the game, for a token on $(a, b, c)$, it is assigned a score $\frac{1}{2^{a+b+c}}$ . These scores are summed for his total score. If the highest total score Sebastian can get in $100$ moves is $m/n$, then determine $m + n$.
[b]p30.[/b] Determine the number of positive $6$ digit integers that satisfy the following properties:
$\bullet$ All six of their digits are $1, 5, 7$, or $8$,
$\bullet$ The sum of all the digits is a multiple of $5$.
[u]Set 11[/u]
[b]p31.[/b] The triangular numbers are defined as $T_n =\frac{n(n+1)}{2}$. We also define $S_n =\frac{n(n+2)}{3}$. If the sum $$\sum_{i=16}^{32} \left(\frac{1}{T_i}+\frac{1}{S_i}\right)= \left(\frac{1}{T_{16}}+\frac{1}{S_{16}}\right)+\left(\frac{1}{T_{17}}+\frac{1}{S_{17}}\right)+...+\left(\frac{1}{T_{32}}+\frac{1}{S_{32}}\right)$$ can be written in the form $a/b$ , where $a$ and $b$ are positive integers with $gcd(a, b) = 1$, then find $a + b$.
[b]p32.[/b] Farmer Will is considering where to build his house in the Cartesian coordinate plane. He wants to build his house on the line $y = x$, but he also has to minimize his travel time for his daily trip to his barnhouse at $(24, 15)$ and back. From his house, he must first travel to the river at $y = 2$ to fetch water for his animals. Then, he heads for his barnhouse, and promptly leaves for the long strip mall at the line $y =\sqrt3 x$ for groceries, before heading home. If he decides to build his house at $(x_0, y_0)$ such that the distance he must travel is minimized, $x_0$ can be written in the form $\frac{a\sqrt{b}-c}{d}$ , where $a, b, c, d$ are positive integers, $b$ is not divisible by the square of a prime, and $gcd(a, c, d) = 1$. Compute $a+b+c+d$.
[b]p33.[/b] Determine the greatest positive integer $n$ such that the following two conditions hold:
$\bullet$ $n^2$ is the difference of consecutive perfect cubes;
$\bullet$ $2n + 287$ is the square of an integer.
[u]Set 12[/u]
The answers to these problems are nonnegative integers that may exceed $1000000$. You will be awarded points as described in the problems.
[b]p34.[/b] The “Collatz sequence” of a positive integer n is the longest sequence of distinct integers $(x_i)_{i\ge 0}$ with $x_0 = n$ and $$x_{n+1} =\begin{cases} \frac{x_n}{2} & if \,\, x_n \,\, is \,\, even \\ 3x_n + 1 & if \,\, x_n \,\, is \,\, odd \end{cases}.$$ It is conjectured that all Collatz sequences have a finite number of elements, terminating at $1$. This has been confirmed via computer program for all numbers up to $2^{64}$. There is a unique positive integer $n < 10^9$ such that its Collatz sequence is longer than the Collatz sequence of any other positive integer less than $10^9$. What is this integer $n$?
An estimate of $e$ gives $\max\{\lfloor 32 - \frac{11}{3}\log_{10}(|n - e| + 1)\rfloor, 0\}$ points.
[b]p35.[/b] We define a graph $G$ as a set $V (G)$ of vertices and a set $E(G)$ of distinct edges connecting those vertices. A graph $H$ is a subgraph of $G$ if the vertex set $V (H)$ is a subset of $V (G)$ and the edge set $E(H)$ is a subset of $E(G)$. Let $ex(k, H)$ denote the maximum number of edges in a graph with $k$ vertices without a subgraph of $H$. If $K_i$ denotes a complete graph on $i$ vertices, that is, a graph with $i$ vertices and all ${i \choose 2}$ edges between them present, determine $$n =\sum_{i=2}^{2018} ex(2018, K_i).$$
An estimate of $e$ gives $\max\{\lfloor 32 - 3\log_{10}(|n - e| + 1)\rfloor, 0\}$ points.
[b]p36.[/b] Write down an integer between $1$ and $100$, inclusive. This number will be denoted as $n_i$ , where your Team ID is $i$. Let $S$ be the set of Team ID’s for all teams that submitted an answer to this problem. For every ordered triple of distinct Team ID’s $(a, b, c)$ such that a, b, c ∈ S, if all roots of the polynomial $x^3 + n_ax^2 + n_bx + n_c$ are real, then the teams with ID’s $a, b, c$ will each receive one virtual banana.
If you receive $v_b$ virtual bananas in total and $|S| \ge 3$ teams submit an answer to this problem, you will be awarded $$\left\lfloor \frac{32v_b}{3(|S| - 1)(|S| - 2)}\right\rfloor$$ points for this problem. If $|S| \le 2$, the team(s) that submitted an answer to this problem will receive $32$ points for this problem.
PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777264p24369138]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Sequence of real numbers $a_0,a_1,\dots,a_{1389}$ are called concave if for each $0<i<1389$, $a_i\geq\frac{a_{i-1}+a_{i+1}}2$. Find the largest $c$ such that for every concave sequence of non-negative real numbers:
\[\sum_{i=0}^{1389}ia_i^2\geq c\sum_{i=0}^{1389}a_i^2\]
An infinite increasing sequence $a_1 < a_2 < a_3 < \cdots$ of positive integers is called [i]central[/i] if for every positive integer $n$ , the arithmetic mean of the first $a_n$ terms of the sequence is equal to $a_n$.
\\Show that there exists an infinite sequence $b_1, b_2, b_3, \dots$ of positive integers such that for every central sequence $a_1, a_2, a_3, \dots, $ there are infinitely many positive integers $n$ with $a_n = b_n$.
Does there exist a positive integer such that its last digit is nonzero and that it becomes exactly two times bigger when the order of its digits is reversed?
Let $DEF$ be a triangle and H the foot of the altitude from $D$ to $EF$. If $DE = 60$, $DF = 35$, and $DH = 21$, what is the difference between the minimum and the maximum possible values for the area of $DEF$?
In $\triangle PQR$, $PR=15$, $QR=20$, and $PQ=25$. Points $A$ and $B$ lie on $\overline{PQ}$, points $C$ and $D$ lie on $\overline{QR}$, and points $E$ and $F$ lie on $\overline{PR}$, with $PA=QB=QC=RD=RE=PF=5$. Find the area of hexagon $ABCDEF$.
[color=darkred] Let $m$ and $n$ be two nonzero natural numbers. Determine the minimum number of distinct complex roots of the polynomial $\prod_{k=1}^m\, (f+k)$ , when $f$ covers the set of $n^{\text{th}}$ - degree polynomials with complex coefficients.
[/color]
Suppose that $G$ is a finite group generated by the two elements $g$ and $h,$ where the order of $g$ is odd. Show that every element of $G$ can be written in the form
\[g^{m_1}h^{n_1}g^{m_2}h^{n_2}\cdots g^{m_r}h^{n_r}\]
with $1\le r\le |G|$ and $m_n,n_1,m_2,n_2,\dots,m_r,n_r\in\{1,-1\}.$ (Here $|G|$ is the number of elements of $G.$)
Let \[S = 1 + \frac 18 + \frac{1\cdot 5}{8\cdot 16} + \frac{1\cdot 5\cdot 9}{8\cdot 16\cdot 24} + \cdots + \frac{1\cdot 5\cdot 9\cdots (4k+1)}{8\cdot 16\cdot 24\cdots(8k+8)} + \cdots.\] Find the positive integer $n$ such that $2^n < S^{2007} < 2^{n+1}$.
If $\angle A = 20^\circ$ and $\angle AFG = \angle AGF$, then $\angle B + \angle D = $
[asy]
pair A,B,C,D,EE,F,G;
A = (0,0);
B = (9,4);
C = (21,0);
D = (13,-12);
EE = (4,-16);
F = (13/2,-6);
G = (8,0);
draw(A--C--EE--B--D--cycle);
label("$A$",A,W);
label("$B$",B,N);
label("$C$",C,E);
label("$D$",D,SE);
label("$E$",EE,SW);
label("$F$",F,WSW);
label("$G$",G,NW);
[/asy]
$\text{(A)}\ 48^\circ \qquad \text{(B)}\ 60^\circ \qquad \text{(C)}\ 72^\circ \qquad \text{(D)}\ 80^\circ \qquad \text{(E)}\ 90^\circ$
$ABCD$ is a cyclic quadrilateral and $\omega$ its circumcircle. The perpendicular line to $AC$ at $D$ intersects $AC$ at $E$ and $\omega$ at F. Denote by $\ell$ the perpendicular line to $BC$ at $F$. The perpendicular line to $\ell$ at A intersects $\ell$ at $G$ and $\omega$ at $H$. Line $GE$ intersects $FH$ at $I$ and $CD$ at $J$. Prove that points $C, F, I$ and $J$ are concyclic
Let $O$ be the center of the circumcircle of an acute triangle $ABC$, let $P$ be any point inside the segment $BC$. Suppose the circumcircle of triangle $BPO$ intersects the segment $AB$ at point $R$ and the circumcircle of triangle $COP$ intersects $CA$ at point $Q$.
(i) Consider the triangle $PQR$, show that it is similar to triangle $ABC$ and that $O$ is its orthocenter.
(ii) Show that the circumcircles of triangles $BPO$, $COP$, $PQR$ have the same radius.
Let $P(x)$ be a real polynomial with $P(x) \ge 0$ for $0 \le x \le 1$. Show that there exist polynomials $P_i (x) (i = 0, 1,2)$ with $P_i (x) \ge 0$ for all real x such that $P (x) = P_0 (x) + xP_1 (x)( 1- x)P_2 (x)$.
Let $p$ be a prime and let $f(x)$ be a polynomial of degree $d$ with integer coefficients. Assume that the numbers $f(1),f(2),\dots,f(p)$ leave exactly $k$ distinct remainders when divided by $p$, and $1<k<p$. Prove that
\[ \frac{p-1}{d}\leq k-1\leq (p-1)\left(1-\frac1d \right) .\]
[i] Dániel Domán, Gauls Károlyi, and Emil Kiss [/i]
Find all functions $f: \mathbb R \to \mathbb R$ such that \[ f( xf(x) + f(y) ) = f^2(x) + y \] for all $x,y\in \mathbb R$.
Let $ABC$ be an acute scalene triangle, and let $A_1, B_1, C_1$ be the feet of the altitudes from $A, B, C$. Let $A_2$ be the intersection of the tangents to the circle $ABC$ at $B, C$ and define $B_2, C_2$ similarly. Let $A_2A_1$ intersect the circle $A_2B_2C_2$ again at $A_3$ and define $B_3, C_3$ similarly. Show that the circles $AA_1A_3, BB_1B_3$, and $CC_1C_3$ all have two common points, $X_1$ and $X_2$ which both lie on the Euler line of the triangle $ABC$.
[i]United Kingdom, Joe Benton[/i]
Let $f(x)=|2\{x\} -1|$ where $\{x\}$ denotes the fractional part of $x$. The number $n$ is the smallest positive integer such that the equation $$nf(xf(x)) = x$$ has at least $2012$ real solutions $x$. What is $n$?
$\textbf{Note:}$ the fractional part of $x$ is a real number $y= \{x\}$, such that $ 0 \le y < 1$ and $x-y$ is an integer.
$ \textbf{(A)}\ 30\qquad\textbf{(B)}\ 31\qquad\textbf{(C)}\ 32\qquad\textbf{(D)}\ 62\qquad\textbf{(E)}\ 64 $
In tetrahedron $ABCD,$ as shown below, compute the number of ways to start at $A,$ walk along some path of edges, and arrive back at $A$ without walking over the same edge twice.
[Insert Diagram]
[i]Proposed by Richard Chen[/i]
[u]Round 4[/u]
[b]p13.[/b] What is the units digit of the number $(2^1 + 1)(2^2 - 1)(2^3 + 1)(2^4 - 1)...(2^{2010} - 1)$?
[b]p14.[/b] Mr. Fat noted that on January $2$, $2010$, the display of the day is $01/02/2010$, and the sequence $01022010$ is a palindrome (a number that reads the same forwards and backwards). How many days does Mr. Fat need to wait between this palindrome day and the last palindrome day of this decade?
[b]p15.[/b] Farmer Tim has a $30$-meter by $30$-meter by $30\sqrt2$-meter triangular barn. He ties his goat to the corner where the two shorter sides meet with a 60-meter rope. What is the area, in square meters, of the land where the goat can graze, given that it cannot get inside the barn?
[b]p16.[/b] In triangle $ABC$, $AB = 3$, $BC = 4$, and $CA = 5$. Point $P$ lies inside the triangle and the distances from $P$ to two of the sides of the triangle are $ 1$ and $2$. What is the maximum distance from $P$ to the third side of the triangle?
[u]Round 5[/u]
[b]p17.[/b] Let $Z$ be the answer to the third question on this guts quadruplet. If $x^2 - 2x = Z - 1$, find the positive value of $x$.
[b]p18.[/b] Let $X$ be the answer to the first question on this guts quadruplet. To make a FATRON2012, a cubical steel body as large as possible is cut out from a solid sphere of diameter $X$. A TAFTRON2013 is created by cutting a FATRON2012 into $27$ identical cubes, with no material wasted. What is the length of one edge of a TAFTRON2013?
[b]p19.[/b] Let $Y$ be the smallest integer greater than the answer to the second question on this guts quadruplet. Fred posts two distinguishable sheets on the wall. Then, $Y$ people walk into the room. Each of the Y people signs up on $0, 1$, or $2$ of the sheets. Given that there are at least two people in the room other than Fred, how many possible pairs of lists can Fred have?
[b]p20.[/b] Let $A, B, C$, be the respective answers to the first, second, and third questions on this guts quadruplet. At the Robot Design Convention and Showcase, a series of robots are programmed such that each robot shakes hands exactly once with every other robot of the same height. If the heights of the $16$ robots are $4$, $4$, $4$, $5$, $5$, $7$, $17$, $17$, $17$, $34$, $34$, $42$, $100$, $A$, $B$, and $C$ feet, how many handshakes will take place?
[u]Round 6[/u]
[b]p21.[/b] Determine the number of ordered triples $(p, q, r)$ of primes with $1 < p < q < r < 100$ such that $q - p = r - q$.
[b]p22.[/b] For numbers $a, b, c, d$ such that $0 \le a, b, c, d \le 10$, find the minimum value of $ab + bc + cd + da - 5a - 5b - 5c - 5d$.
[b]p23.[/b] Daniel has a task to measure $1$ gram, $2$ grams, $3$ grams, $4$ grams , ... , all the way up to $n$ grams. He goes into a store and buys a scale and six weights of his choosing (so that he knows the value for each weight that he buys). If he can place the weights on either side of the scale, what is the maximum value of $n$?
[b]p24.[/b] Given a Rubik’s cube, what is the probability that at least one face will remain unchanged after a random sequence of three moves? (A Rubik’s cube is a $3$ by $3$ by $3$ cube with each face starting as a different color. The faces ($3$ by $3$) can be freely turned. A move is defined in this problem as a $90$ degree rotation of one face either clockwise or counter-clockwise. The center square on each face–six in total–is fixed.)
PS. You should use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2766534p24230616]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Triangle $ABC$ is inscribed in the circle $\Gamma$. Let $\Gamma_a$ denote the circle internally tangent to $\Gamma$ and also tangent to sides $AB$ and $AC$. Let $A'$ denote the point of tangency of $\Gamma$ and $\Gamma_a$. Define $B'$ and $C'$ similarly. Prove that $AA'$, $BB'$ and $CC'$ are concurrent.