Found problems: 85335
Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function.
[i]Proposed by James Rickards, Canada[/i]
[b]p1.[/b] What is $20\times 20 - 19\times 19$?
[b]p2.[/b] Andover has a total of $1440$ students and teachers as well as a $1 : 5$ teacher-to-student ratio (for every teacher, there are exactly $5$ students). In addition, every student is either a boarding student or a day student, and $70\%$ of the students are boarding students. How many day students does Andover have?
[b]p3.[/b] The time is $2:20$. If the acute angle between the hour hand and the minute hand of the clock measures $x$ degrees, find $x$.
[img]https://cdn.artofproblemsolving.com/attachments/b/a/a18b089ae016b15580ec464c3e813d5cb57569.png[/img]
[b]p4.[/b] Point $P$ is located on segment $AC$ of square $ABCD$ with side length $10$ such that $AP >CP$. If the area of quadrilateral $ABPD$ is $70$, what is the area of $\vartriangle PBD$?
[b]p5.[/b] Andrew always sweetens his tea with sugar, and he likes a $1 : 7$ sugar-to-unsweetened tea ratio. One day, he makes a $100$ ml cup of unsweetened tea but realizes that he has run out of sugar. Andrew decides to borrow his sister's jug of pre-made SUPERSWEET tea, which has a $1 : 2$ sugar-to-unsweetened tea ratio. How much SUPERSWEET tea, in ml,does Andrew need to add to his unsweetened tea so that the resulting tea is his desired sweetness?
[b]p6.[/b] Jeremy the architect has built a railroad track across the equator of his spherical home planet which has a radius of exactly $2020$ meters. He wants to raise the entire track $6$ meters off the ground, everywhere around the planet. In order to do this, he must buymore track, which comes from his supplier in bundles of $2$ meters. What is the minimum number of bundles he must purchase? Assume the railroad track was originally built on the ground.
[b]p7.[/b] Mr. DoBa writes the numbers $1, 2, 3,..., 20$ on the board. Will then walks up to the board, chooses two of the numbers, and erases them from the board. Mr. DoBa remarks that the average of the remaining $18$ numbers is exactly $11$. What is the maximum possible value of the larger of the two numbers that Will erased?
[b]p8.[/b] Nathan is thinking of a number. His number happens to be the smallest positive integer such that if Nathan doubles his number, the result is a perfect square, and if Nathan triples his number, the result is a perfect cube. What is Nathan's number?
[b]p9.[/b] Let $S$ be the set of positive integers whose digits are in strictly increasing order when read from left to right. For example, $1$, $24$, and $369$ are all elements of $S$, while $20$ and $667$ are not. If the elements of $S$ are written in increasing order, what is the $100$th number written?
[b]p10.[/b] Find the largest prime factor of the expression $2^{20} + 2^{16} + 2^{12} + 2^{8} + 2^{4} + 1$.
[b]p11.[/b] Christina writes down all the numbers from $1$ to $2020$, inclusive, on a whiteboard. What is the sum of all the digits that she wrote down?
[b]p12.[/b] Triangle $ABC$ has side lengths $AB = AC = 10$ and $BC = 16$. Let $M$ and $N$ be the midpoints of segments $BC$ and $CA$, respectively. There exists a point $P \ne A$ on segment $AM$ such that $2PN = PC$. What is the area of $\vartriangle PBC$?
[b]p13.[/b] Consider the polynomial $$P(x) = x^4 + 3x^3 + 5x^2 + 7x + 9.$$ Let its four roots be $a, b, c, d$. Evaluate the expression $$(a + b + c)(a + b + d)(a + c + d)(b + c + d).$$
[b]p14.[/b] Consider the system of equations $$|y - 1| = 4 -|x - 1|$$
$$|y| =\sqrt{|k - x|}.$$ Find the largest $k$ for which this system has a solution for real values $x$ and $y$.
[b]p16.[/b] Let $T_n = 1 + 2 + ... + n$ denote the $n$th triangular number. Find the number of positive integers $n$ less than $100$ such that $n$ and $T_n$ have the same number of positive integer factors.
[b]p17.[/b] Let $ABCD$ be a square, and let $P$ be a point inside it such that $PA = 4$, $PB = 2$, and $PC = 2\sqrt2$. What is the area of $ABCD$?
[b]p18.[/b] 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$. Let $$ S =\dfrac{1}{F_6 + \frac{1}{F_6}}+\dfrac{1}{F_8 + \frac{1}{F_8}}+\dfrac{1}{F_{10} +\frac{1}{F_{10}}}+\dfrac{1}{F_{12} + \frac{1}{F_{12}}}+ ... $$ Compute $420S$.
[b]p19.[/b] Let $ABCD$ be a square with side length $5$. Point $P$ is located inside the square such that the distances from $P$ to $AB$ and $AD$ are $1$ and $2$ respectively. A point $T$ is selected uniformly at random inside $ABCD$. Let $p$ be the probability that quadrilaterals $APCT$ and $BPDT$ are both not self-intersecting and have areas that add to no more than $10$. If $p$ can be expressed in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$.
Note: A quadrilateral is self-intersecting if any two of its edges cross.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Evaluate
\[\lim_{n\to\infty} \int_0^{\frac{\pi}{2}} \frac{[n\sin x]}{n}\ dx\]
where $ [x] $ is the integer equal to $ x $ or less than $ x $.
Find the largest positive integer $n$ of the form $n=p^{2\alpha}q^{2\beta}r^{2\gamma}$ for primes $p<q, r$ and positive integers $\alpha, \beta, \gamma$, such that $|r-pq|=1$ and $p^{2\alpha}-1, q^{2\beta}-1, r^{2\gamma}-1$ all divide $n$.
The first triangle number is $1$; the second is $1 + 2 = 3$; the third is $1 + 2 + 3 = 6$; and so on. Find the sum of the first $100$ triangle numbers.
Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$
A sequence of numbers $ a_1, a_2, a_3, ...$ satisfies
(i) $ a_1 \equal{} \frac{1}{2}$
(ii) $ a_1\plus{}a_2 \plus{} \cdots \plus{} a_n \equal{} n^2 a_n \ (n \geq 1)$
Determine the value of $ a_n \ (n \geq 1)$.
Let $K$ denote the circumference of a circular disk of radius $1$, and let $k$ denote a circular arc that joins two points
$a,b$ on $K$ and lies otherwise in the given circular disc. Suppose that $k$ divides the circular disk into two parts of equal area. Prove that the length of $k$ exceeds $2.$
Consider the Pascal's triangle in the figure where the binomial coefficients are arranged in the usual manner. Select any binomial coefficient from anywhere except the right edge of the triangle and labet it $C$. To the right of $C$, in the horizontal line, there are $t$ numbers, we denote them as $a_1,a_2,\cdots,a_t$, where $a_t = 1$ is the last number of the series. Consider the line parallel to the left edge of the triangle containing $C$, there will only be $t$ numbers diagonally above $C$ in that line. We successively name them as $b_1,b_2,\cdots,b_t$, where $b_t = 1$. Show that
\[b_ta_1-b_{t-1}a_2+b_{t-2}a_3-\cdots+(-1)^{t-1}b_1a_t = 1\].
For example, Suppose you choose $\binom41 = 4$ (see figure), then $t = 3$, $a_1 = 6, a_2 = 4, a_3 = 1$ and $b_1 = 3, b_2 = 2, b_3 = 1$.
\[\begin{array}{ccccccccccc} & & & & & 1 & & & & & \\
& & & & 1 & & \underset{b_3}{1} & & & & \\
& & & 1 & & \underset{b_2}{2} & & 1 & & & \\
& & 1 & & \underset{b_1}{3} & & 3 & & 1 & & \\
& 1 & & \boxed{4} & & \underset{a_1}{6} & & \underset{a_2}{4} & & \underset{a_3}{1} & \\
\ldots & & \ldots & & \ldots & & \ldots & & \ldots & & \ldots \\
\end{array}\]
For positive integers $ n,$ the numbers $ f(n)$ are defined inductively as follows: $ f(1) \equal{} 1,$ and for every positive integer $ n,$ $ f(n\plus{}1)$ is the greatest integer $ m$ such that there is an arithmetic progression of positive integers $ a_1 < a_2 < \ldots < a_m \equal{} n$ for which
\[ f(a_1) \equal{} f(a_2) \equal{} \ldots \equal{} f(a_m).\]
Prove that there are positive integers $ a$ and $ b$ such that $ f(an\plus{}b) \equal{} n\plus{}2$ for every positive integer $ n.$
Let $f:\mathbb{N} \rightarrow \mathbb{N},$ $f(n)=n^2-69n+2250$ be a function. Find the prime number $p$, for which the sum of the digits of the number $f(p^2+32)$ is as small as possible.
Consider a set $ A$ of positive integers such that the least element of $ A$ equals $ 1001$ and the product of all elements of $ A$ is a perfect square. What is the least possible value of the greatest element of $ A$?
Denote $f(m) =\sum_{k=1}^m (-1)^k cos \frac{k\pi}{2 m + 1}$
For which positive integers $m$ is $f(m)$ rational?
Let $\Gamma$ and $\Gamma'$ be two circles with centres $O$ and $O'$, such that $O$ belongs to $\Gamma'$. Let $M$ be a point on $\Gamma'$, outside of $\Gamma$. The tangents to $\Gamma$ that go through $M$ touch $\Gamma$ in two points $A$ and $B$, and cross $\Gamma'$ again in two points $C$ and $D$. Finally, let $E$ be the crossing point of the lines $AB$ and $CD$. Prove that the circumcircles of the triangles $CEO'$ and $DEO'$ are tangent to $\Gamma'$.
Here is a problem given at the mathematical test at some school:
[i]The hypotenuse of the right triangle is 12 inches. The height (distance from the opposite vertex to the hypotenuse) is 12 inches. Find the area of the triangle[/i]
Everybody in the class got the answer $42$ square inches, except for the two best students. Can you explain why the two best students could not get the same answer as the majority?
Let $\alpha ,\ \beta$ be the distinct positive roots of the equation of $2x=\tan x$.
Evaluate the following definite integral.
\[\int_{0}^{1}\sin \alpha x\sin \beta x\ dx \]
Let $A_1$, $B_1$ be two points on the base $AB$ of an isosceles triangle $ABC$, with $\angle C>60^{\circ}$, such that $\angle A_1CB_1=\angle ABC$. A circle externally tangent to the circumcircle of $\triangle A_1B_1C$ is tangent to the rays $CA$ and $CB$ at points $A_2$ and $B_2$, respectively. Prove that $A_2B_2=2AB$.
Show that there exists some [b]positive[/b] integer $k$ with $$\gcd(2012,2020)=\gcd(2012+k,2020)$$$$=\gcd(2012,2020+k)=\gcd(2012+k,2020+k).$$
Let $ABC$ be a triangle, and let $D$ and $E$ be the orthogonal projections of $A$ onto the internal bisectors from $B$ and $C$. Prove that $DE$ is parallel to $BC$.
For a permutation $\pi$ of $\{1,2,3,\ldots,n\}$, let $\text{Inv}(\pi)$ be the number of pairs $(i,j)$ with $1 \leq i < j \leq n$ and $\pi(i) > \pi(j)$.
[list=1]
[*] Given $n$, what is $\sum \text{Inv}(\pi)$ where the sum ranges over all permutations $\pi$ of $\{1,2,3,\ldots,n\}$?
[*] Given $n$, what is $\sum \left(\text{Inv}(\pi)\right)^2$ where the sum ranges over all permutations $\pi$ of $\{1,2,3,\ldots,n\}$?[/list]
[i]Brian Hamrick.[/i]
Let $\omega$ be the incircle of a triangle $ABC$. The line passing though the incenter $I$ and parallel to $BC$ meets $\omega$ at $A_b$ and $A_c$ ($A_b$ lies in the same semi plane with respect to $AI$ as $B$). The lines $BA_b$ and $CA_c$ meet at $A_1$. The points $B_1$ and $C_1$ are defined similarly. prove that $AA_1,BB_1,CC_1$ concur.
Consider a variable point $P$ inside a given triangle $ABC$. Let $D$, $E$, $F$ be the feet of the perpendiculars from the point $P$ to the lines $BC$, $CA$, $AB$, respectively. Find all points $P$ which minimize the sum \[ {BC\over PD}+{CA\over PE}+{AB\over PF}. \]
Some lottery is played as follows. A lottery participant buys a card with $10$ numbered cells. He has the right to cross out any $4$ of these $10$ cells. Then a drawing occurs, during which some $7$ out of $10$ cells become winning. The player wins when all $4$ squares he crosses out are winning. The question arises, what is the smallest number of cards that can be used so that, if filled out correctly, at least one of these cards will win in any case? We do not suggest that you answer this question (we ourselves do not know the answer), although, of course, we will be very glad if you do and will evaluate this achievement accordingly. The task is; to indicate a certain number $n$ and a method of filling n cards that guarantees at least one win. The smaller $n$, the higher the rating of the work.
Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.
Let $p$ be a prime number. A flea is staying at point $0$ of the real line. At each minute,
the flea has three possibilities: to stay at its position, or to move by $1$ to the left or to the right.
After $p-1$ minutes, it wants to be at $0$ again. Denote by $f(p)$ the number of its strategies to do this
(for example, $f(3) = 3$: it may either stay at $0$ for the entire time, or go to the left and then to the
right, or go to the right and then to the left). Find $f(p)$ modulo $p$.