Found problems: 85335
Let $S$ be a set of integers such that [list][*] there exist $a, b \in S$ with $\gcd(a, b)=\gcd(a-2,b-2)=1$, [*] if $x,y\in S$, then $x^2 -y\in S$.[/list] Prove that $S=\mathbb{Z}$.
Georg has a circular game board with 100 squares labelled $1, 2, . . . , 100$. Georg chooses three numbers $a, b, c$ among the numbers $1, 2, . . . , 99$. The numbers need not be distinct. Initially there is a piece on the square labelled $100$. First, Georg moves the piece $a$ squares forward $33$ times and puts a caramel on each of the squares the piece lands on. Then he moves the piece $b$ squares forward $33$ times and puts a caramel on each of the squares the piece lands on. Finally, he moves the piece $c$ squares forward $33$ times and puts a caramel on each of the squares the piece lands on. Thus he puts a total of $99$ caramels on the board. Georg wins all the caramels on square number $1$. How many caramels can Georg win, at most?
[img]https://cdn.artofproblemsolving.com/attachments/d/c/af438e5feadca5b1bfc98ae427f6fc24655e29.png[/img]
In a new school $40$ percent of the students are freshmen, $30$ percent are sophomores, $20$ percent are juniors, and $10$ percent are seniors. All freshmen are required to take Latin, and $80$ percent of the sophomores, $50$ percent of the juniors, and $20$ percent of the seniors elect to take Latin. The probability that a randomly chosen Latin student is a sophomore is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
There is a frog in every vertex of a regular 2n-gon with circumcircle($n \geq 2$). At certain time, all frogs jump to the neighborhood vertices simultaneously (There can be more than one frog in one vertex). We call it as $\textsl{a way of jump}$. It turns out that there is $\textsl{a way of jump}$ with respect to 2n-gon, such that the line connecting any two distinct vertice having frogs on it after the jump, does not pass through the circumcentre of the 2n-gon. Find all possible values of $n$.
Every cell of table $4 \times 4$ is colored into white. It is permitted to place the cross (pictured below) on the table such that its center lies on the table (the whole fi gure does not need to lie on the table) and change colors of every cell which is covered into opposite (white and black). Find all $n$ such that after $n$ steps it is possible to get the table with every cell colored black.
Let $P(x) = x^2 - 20x - 11$. If $a$ and $b$ are natural numbers such that $a$ is composite, $\gcd(a, b) = 1$, and $P(a) = P(b)$, compute $ab$.
Note: $\gcd(m, n)$ denotes the greatest common divisor of $m$ and $n$.
[i]Proposed by Aaron Lin
[/i]
At the same time, three beetles with identical speeds began to crawl along the heights of an acute-angled non-isosceles triangle from its vertices. At some point, it turned out that the first and second beetles were on a circle inscribed in a triangle. Prove that at this moment the third beetle is also on this circle.
[i]A. Kuznetsov[/i]
Let $P(x)=x^{2020}+x+2$, which has $2020$ distinct roots. Let $Q(x)$ be the monic polynomial of degree $\binom{2020}{2}$ whose roots are the pairwise products of the roots of $P(x)$. Let $\alpha$ satisfy $P(\alpha)=4$. Compute the sum of all possible values of $Q(\alpha^2)^2$.
[i]Proposed by Milan Haiman.[/i]
If in a quadrilateral $ABCD$ whose vertices lie on a circle of radius $1$, holds $$|AB| \cdot |BC| \cdot |CD|\cdot |DA| \ge 4$$, then $ABCD$ is a square. Prove it.
[hide=Hint given in contest] You can use Ptolemy's formula $|AB| \cdot |CD| + |BC|\cdot |AD|= |AC| \cdot|BD|$[/hide]
An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:
[list=]
[*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.)
[*]No two beams have intersecting interiors.
[*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam.
[/list]
What is the smallest positive number of beams that can be placed to satisfy these conditions?
[i]Proposed by Alex Zhai[/i]
We are given $64$ cubes, each with five white faces and one black face. One cube is placed on each square of a chessboard, with its edges parallel to the sides of the board. We are allowed to rotate a complete row of cubes about the axis of symmetry running through the cubes or to rotate a complete column of cubes about the axis of symmetry running through the cubes. Show that by a sequence of such rotations we can always arrange that each cube has its black face uppermost
A sequence of positive integers is defined by $a_0=1$ and $a_{n+1}=a_n^2+1$ for each $n\ge0$. Find $\text{gcd}(a_{999},a_{2004})$.
Let $ABC$ be a triangle with $m (\angle C) = 90^\circ$ and the points $D \in [AC], E\in [BC]$. Inside the triangle we construct the semicircles $C_1, C_2, C_3, C_4$ of diameters $[AC], [BC], [CD], [CE]$ and let $\{C, K\} = C_1 \cap C_2, \{C, M\} =C_3 \cap C_4, \{C, L\} = C_2 \cap C_3, \{C, N\} =C_1 \cap C_4$. Show that points $K, L, M, N$ are concyclic.
Let $A,B,C,D,E,F$ be points in space such that the quadrilaterals $ABDE,BCEF, CDFA$ are parallelograms.
Prove that the six midpoints of the sides $AB,BC,CD,DE,EF,FA$ are coplanar
Rodolfo and Gabriela have $9$ chips numbered from $1$ to $9$ and they have fun with the following game: They remove the chips one by one and alternately (until they have $3$ chips each), with the following rules:
$\bullet$ Rodolfo begins the game, choosing a chip and in the following moves he must remove, each time, a chip three units greater than the last chip drawn by Gabriela.
$\bullet$ Gabriela, on her turn, chooses a first chip and in the following times she must draw, each time, a chip two units smaller than the last chip that she herself drew.
$\bullet$ The game is won by whoever gets the highest number by adding up their three tokens.
$\bullet$ If the game cannot be completed, a tie is declared.
If they play without making mistakes, how should Rodolfo play to be sure he doesn't lose?
Given points $A,B,M,N$ on the circumference. Two chords $[MA_1]$ and $[MA_2]$ are orthogonal to lines $(NA)$ and $(NB)$ respectively. Prove that $(AA_1)$ and $(BB_1)$ lines are parallel.
In the $ xyz$ space with the origin $ O$, given a cuboid $ K: |x|\leq \sqrt {3},\ |y|\leq \sqrt {3},\ 0\leq z\leq 2$ and the plane $ \alpha : z \equal{} 2$. Draw the perpendicular $ PH$ from $ P$ to the plane. Find the volume of the solid formed by all points of $ P$ which are included in $ K$ such that $ \overline{OP}\leq \overline{PH}$.
In a quadrilateral ABCD, it is given that AB = AD = 13, BC = CD = 20, BD = 24. If r is the radius
of the circle inscribable in the quadrilateral, then what is the integer closest to r?
Define the sequence $\{a_n\}_{n=1}^\infty$ as
\[ a_1 = a_2 = 1,\quad a_{n+2} = 14a_{n+1} - a_n \; (n \geq 1) \]
Prove that if $p$ is prime and there exists a positive integer $n$ such that $\frac{a_n}p$ is an integer, then $\frac{p-1}{12}$ is also an integer.
We have three functions. The first one is $y=\phi(x)$. The second one is the inverse function of the first one. The figure of the third funcion is symmetrical to the second one about line $x+y=0$. Then, the third function is
$\text{(A)}y=-\phi(x)\qquad\text{(B)}y=-\phi(-x)\qquad\text{(C)}y=-\phi^{-1}(x)\qquad\text{(D)}y=-\phi^{-1}(x)$
Let $ n\ge 3$ be an integer. Let $ f(x)$ and $ g(x)$ be polynomials with real coefficients such that the points $ (f(1),g(1)),(f(2),g(2)),\dots,(f(n),g(n))$ in $ \mathbb{R}^2$ are the vertices of a regular $ n$-gon in counterclockwise order. Prove that at least one of $ f(x)$ and $ g(x)$ has degree greater than or equal to $ n\minus{}1.$
In the game of Colonel Blotto, you have 100 troops to distribute among 10 castles. Submit a 10-tuple $(x_1, x_2, \dots x_{10})$ of nonnegative integers such that $x_1 + x_2 + \dots + x_{10} = 100$, where each $x_i$ represent the number of troops you want to send to castle $i$. Your troop distribution will be matched up against each opponent's and you will win 10 points for each castle that you send more troops to (if you send the same number, you get 5 points, and if you send fewer, you get none). Your aim is to score the most points possible averaged over all opponents.
For example, if team $A$ submits $(90,10,0,\dots,0)$, team B submits $(11,11,11,11,11,11,11,11,11,1)$, and team C submits $(10,10,10,\dots 10)$, then team A will win 10 points against team B and 15 points against team C, while team B wins 90 points against team C. Team A averages 12.5 points, team B averages 90 points, and team C averages 47.5 points.
[i]2017 CCA Math Bonanza Lightning Round #5.4[/i]
Define $g(x)$ as the largest value of$ |y^2 - xy|$ for $y$ in $[0, 1]$. Find the minimum value of $g$ (for real $x$).
Let $ABC$ be an isosceles triangle with $AB=AC$. Consider a variable point $P$ on the extension of the segment $BC$ beyound $B$ (in other words, $P$ lies on the line $BC$ such that the point $B$ lies inside the segment $PC$). Let $r_{1}$ be the radius of the incircle of the triangle $APB$, and let $r_{2}$ be the radius of the $P$-excircle of the triangle $APC$. Prove that the sum $r_{1}+r_{2}$ of these two radii remains constant when the point $P$ varies.
[i]Remark.[/i] The $P$-excircle of the triangle $APC$ is defined as the circle which touches the side $AC$ and the [i]extensions[/i] of the sides $AP$ and $CP$.
Find all positive integers $n$ for which $n^n+1$ and $(2n)^{2n}+1$ are prime numbers.