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

[u]Set 6[/u] [b]p16.[/b] Let $n! = n \times (n - 1) \times ... \times 2 \times 1$. Find the maximum positive integer value of $x$ such that the quotient $\frac{160!}{160^x}$ is an integer. [b]p17.[/b] Let $\vartriangle OAB$ be a triangle with $\angle OAB = 90^o$ . Draw points $C, D, E, F, G$ in its plane so that $$\vartriangle OAB \sim \vartriangle OBC \sim \vartriangle OCD \sim \vartriangle ODE \sim \vartriangle OEF \sim \vartriangle OFG,$$ and none of these triangles overlap. If points $O, A, G$ lie on the same line, then let $x$ be the sum of all possible values of $\frac{OG}{OA }$. Then, $x$ can be expressed in the form $m/n$ for relatively prime positive integers $m, n$. Compute $m + n$. [b]p18.[/b] Let $f(x)$ denote the least integer greater than or equal to $x^{\sqrt{x}}$. Compute $f(1)+f(2)+f(3)+f(4)$. [u]Set 7[/u] The Fibonacci sequence $\{F_n\}$ is defined as $F_0 = 0$, $F_1 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all integers $n \ge 0$. [b]p19.[/b] Find the least odd prime factor of $(F_3)^{20} + (F_4)^{20} + (F_5)^{20}$. [b]p20.[/b] Let $$S = \frac{1}{F_3F_5}+\frac{1}{F_4F_6}+\frac{1}{F_5F_7}+\frac{1}{F_6F_8}+...$$ Compute $420S$. [b]p21.[/b] Consider the number $$Q = 0.000101020305080130210340550890144... ,$$ the decimal created by concatenating every Fibonacci number and placing a 0 right after the decimal point and between each Fibonacci number. Find the greatest integer less than or equal to $\frac{1}{Q}$. [u]Set 8[/u] [b]p22.[/b] In five dimensional hyperspace, consider a hypercube $C_0$ of side length $2$. Around it, circumscribe a hypersphere $S_0$, so all $32$ vertices of $C_0$ are on the surface of $S_0$. Around $S_0$, circumscribe a hypercube $C_1$, so that $S_0$ is tangent to all hyperfaces of $C_1$. Continue in this same fashion for $S_1$, $C_2$, $S_2$, and so on. Find the side length of $C_4$. [b]p23.[/b] Suppose $\vartriangle ABC$ satisfies $AC = 10\sqrt2$, $BC = 15$, $\angle C = 45^o$. Let $D, E, F$ be the feet of the altitudes in $\vartriangle ABC$, and let $U, V , W$ be the points where the incircle of $\vartriangle DEF$ is tangent to the sides of $\vartriangle DEF$. Find the area of $\vartriangle UVW$. [b]p24.[/b] A polynomial $P(x)$ is called spicy if all of its coefficients are nonnegative integers less than $9$. How many spicy polynomials satisfy $P(3) = 2019$? [i]The next set will consist of three estimation problems.[/i] [u]Set 9[/u] Points will be awarded based on the formulae below. Answers are nonnegative integers that may exceed $1,000,000$. [b]p25.[/b] Suppose a circle of radius $20192019$ has area $A$. Let s be the side length of a square with area $A$. Compute the greatest integer less than or equal to $s$. If $n$ is the correct answer, an estimate of $e$ gives $\max \{ 0, \left\lfloor 1030 ( min \{ \frac{n}{e},\frac{e}{n}\}^{18}\right\rfloor -1000 \}$ points. [b]p26.[/b] Given a $50 \times 50$ grid of squares, initially all white, define an operation as picking a square and coloring it and the four squares horizontally or vertically adjacent to it blue, if they exist. If a square is already colored blue, it will remain blue if colored again. What is the minimum number of operations necessary to color the entire grid blue? If $n$ is the correct answer, an estimate of $e$ gives $\left\lfloor \frac{180}{5|n-e|+6}\right\rfloor$ points. [b]p27.[/b] The sphere packing problem asks what percent of space can be filled with equally sized spheres without overlap. In three dimensions, the answer is $\frac{\pi}{3\sqrt2} \approx 74.05\%$ of space (confirmed as recently as $2017!$), so we say that the packing density of spheres in three dimensions is about $0.74$. In fact, mathematicians have found optimal packing densities for certain other dimensions as well, one being eight-dimensional space. Let d be the packing density of eight-dimensional hyperspheres in eightdimensional hyperspace. Compute the greatest integer less than $10^8 \times d$. If $n$ is the correct answer, an estimate of e gives $\max \left\{ \lfloor 30-10^{-5}|n - e|\rfloor, 0 \right\}$ points. PS. You had better use hide for answers. First sets have be posted [url=https://artofproblemsolving.com/community/c4h2777330p24370124]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
The complete graph with 6 points and 15 edges has each edge colored red or blue. Show that we can find 3 points such that the 3 edges joining them are the same color.
The side lengths $a,b,c$ of a triangle $ABC$ are positive integers. Let:\\ \[T_{n}=(a+b+c)^{2n}-(a-b+c)^{2n}-(a+b-c)^{2n}+(a-b-c)^{2n}\] for any positive integer $n$. If $\frac{T_{2}}{2T_{1}}=2023$ and $a>b>c$ , determine all possible perimeters of the triangle $ABC$.
An ice cream cone has radius $1$ and height $4$ inches. What is the number of inches in the radius of a sphere of ice cream which has the same volume of the cone? $\text{(A) }\frac{1}{2}\qquad\text{(B) }1\qquad\text{(C) }\frac{3}{2}\qquad\text{(D) }2\qquad\text{(E) }\frac{5}{2}$
For $n$ a positive integer, define $f_1(n)=n$ and then for $i$ a positive integer, define $f_{i+1}(n)=f_i(n)^{f_i(n)}$. Determine $f_{100}(75)\pmod{17}$. Justify your answer.
Let $x$ be the largest root of $x^4 - 2009x + 1$. Find the nearest integer to $\frac{1}{x^3-2009}$ .
A solid cube has side length $ 3$ inches. A $ 2$-inch by $ 2$-inch square hole is cut into the center of each face. The edges of each cut are parallel to the edges of the cube, and each hole goes all the way through the cube. What is the volume, in cubic inches, of the remaining solid? $ \textbf{(A)}\ 7\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ 12\qquad \textbf{(E)}\ 15$
Let $ n$ be a positive integer, let the sets $ A_{1},A_{2},\cdots,A_{n \plus{} 1}$ be non-empty subsets of the set $ \{1,2,\cdots,n\}.$ prove that there exist two disjoint non-empty subsets of the set $ \{1,2,\cdots,n \plus{} 1\}$: $ \{i_{1},i_{2},\cdots,i_{k}\}$ and $ \{j_{1},j_{2},\cdots,j_{m}\}$ such that $ A_{i_{1}}\cup A_{i_{2}}\cup\cdots\cup A_{i_{k}} \equal{} A_{j_{1}}\cup A_{j_{2}}\cup\cdots\cup A_{j_{m}}$.
Let $S$ be the set of positive perfect squares that are of the form $\overline{AA}$, i.e. the concatenation of two equal integers $A$. (Integers are not allowed to start with zero.) (a) Prove that $S$ is infinite. (b) Does there exist a function $f:S\times S \rightarrow S$ such that if $a,b,c \in S$ and $a,b | c$, then $f(a,b) | c$? (If such a function $f$ exists, we call $f$ an LCM function)
A circle of radius 1 is randomly placed in a 15-by-36 rectangle $ABCD$ so that the circle lies completely within the rectangle. Given that the probability that the circle will not touch diagonal $AC$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
An antelope is a chess piece which moves similarly to the knight: two cells $(x_1,y_1)$ and $(x_2,y_2)$ are joined by an antelope move if and only if \[ \{|x_1-x_2|,|y_1-y_2|\}=\{3,4\}.\] The numbers from $1$ to $10^{12}$ are placed in the cells of a $10^6\times 10^6$ grid. Let $D$ be the set of all absolute differences of the form $|a-b|$, where $a$ and $b$ are joined by an antelope move in the arrangement. How many arrangements are there such that $D$ contains exactly four elements? Proposed by [i]Nikolai Beluhov[/i], Bulgaria
Let $p$ be a prime and $H\subseteq \{0,1,\ldots,p-1\}$ a nonempty set. Suppose that for each element $a\in H$ there exist elements $b$, $c\in H\setminus \{a\}$ such that $b+ c-2a$ is divisible by $p$. Prove that $p<4^k$, where $k$ denotes the cardinality of $H$.
Given a triangle $ABC$ where $|BC| = a, |CA| = b$ and $|AB| = c$, prove that the equality $\frac{1}{a + b}+\frac{1}{b + c}=\frac{3}{a + b + c}$ holds if and only if $\angle ABC = 60^o$.
Consider $k$ positive integers $a_1,a_2,\ldots,a_k$ satisfying $1\le a_1<a_2<\ldots<a_k\le n$ and $\operatorname{lcm}(a_i,a_j)\le n$ for any $i,j$. Prove that $$k\le2\lfloor\sqrt n\rfloor.$$
Prove for the sidelengths $a,b,c$ of a triangle $ABC$ the inequality $\frac{a^3}{b+c-a}+\frac{b^3}{c+a-b}+\frac{c^3}{a+b-c}\ge a^2+b^2+c^2$
In the acute triangle $ABC$ the orthocenter $H$ and the center of the circumscribed circle $O$ were noted. The line $AO$ intersects the side $BC$ at the point $D$. A perpendicular drawn to the side $BC$ at the point $D$ intersects the heights from the vertices $B$ and $C$ of the triangle $ABC$ at the points $X$ and $Y$ respectively. Prove that the center of the circumscribed circle $\Delta HXY$ is equidistant from the points $B$ and $C$. (Danilo Hilko)
Prove that among any $10$ entries of the table $$0 \,\,\,\, 1 \,\,\,\, 2 \,\,\,\, 3 \,\,\,\, ... \,\,\,\, 9$$ $$9 \,\,\,\, 0 \,\,\,\, 1 \,\,\,\, 2 \,\,\,\, ... \,\,\,\, 8$$ $$8 \,\,\,\, 9 \,\,\,\, 0 \,\,\,\, 1 \,\,\,\, ... \,\,\,\, 7$$ $$1 \,\,\,\, 2 \,\,\,\, 3 \,\,\,\, 4 \,\,\,\, ... \,\,\,\, 0$$ standing in different rows and different columns, at least two are equal. (A Savin)
Determine the number of ordered quadruples $(x, y, z, u)$ of integers, such that \[\dfrac{x-y}{x+y}+\dfrac{y-z}{y+z}+\dfrac{z-u}{z+u}>0 \textrm{ and } 1\le x,y,z,u\le 10.\]
Define $ n_a!$ for $ n$ and $ a$ positive to be \[ n_a ! \equal{} n (n\minus{}a)(n\minus{}2a)(n\minus{}3a)...(n\minus{}ka)\] where $ k$ is the greatest integer for which $ n>ka$. Then the quotient $ 72_8!/18_2!$ is equal to $ \textbf{(A)}\ 4^5 \qquad \textbf{(B)}\ 4^6 \qquad \textbf{(C)}\ 4^8 \qquad \textbf{(D)}\ 4^9 \qquad \textbf{(E)}\ 4^{12}$
Let $\triangle ABC$ be a triangle with $\angle BAC>90^{\circ}$, $AB=5$ and $AC=7$. Points $D$ and $E$ lie on segment $BC$ such that $BD=DE=EC$. If $\angle BAC+\angle DAE=180^{\circ}$, compute $BC$.
Find all functions $f:\mathbb{Q}^{+}\rightarrow \mathbb{Q}^{+}$ which for all $x \in \mathbb{Q}^{+}$ fulfil \[f\left(\frac{1}{x}\right)=f(x) \ \ \text{and} \ \ \left(1+\frac{1}{x}\right)f(x)=f(x+1). \]
Let $G$ be a tournoment such that it's edges are colored either red or blue. Prove that there exists a vertex of $G$ like $v$ with the property that, for every other vertex $u$ there is a mono-color directed path from $v$ to $u$.
Find all polynomials $ p(x)$ satisfying the equation: $ (x\minus{}16)p(2x)\equal{}16(x\minus{}1)p(x)$ for all $ x$.
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that $$m+f(n) \mid f(m)^2 - nf(n)$$ for all positive integers $m$ and $n$. (Here, $f(m)^2$ denotes $\left(f(m)\right)^2$.)
The sum \[\displaystyle\sum_{i=0}^{1000} \dfrac{\dbinom{1000}{i}}{\dbinom{2019}{i}}\] can be expressed in the form $\dfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Compute $p+q$. [i]Proposed by James Lin[/i]