Search is not available for this dataset
problem string | answer string | solution string | source string | difficulty string | mathnet_id string | country string | competition string | topics list | problem_type string | source_language string | detected_language string |
|---|---|---|---|---|---|---|---|---|---|---|---|
Problem:
In convex quadrilateral $ABCD$ with $AB = 11$ and $CD = 13$, there is a point $P$ for which $\triangle ADP$ and $\triangle BCP$ are congruent equilateral triangles. Compute the side length of these triangles. | 7 | Solution:
Evidently $ABCD$ is an isosceles trapezoid with $P$ as its circumcenter. Now, construct isosceles trapezoid $AB'BC$ (that is, $BB'$ is parallel to $AC$.) Then $AB'PD$ is a rhombus, so $\angle B'CD = \frac{1}{2} \angle B'PD = 60^{\circ}$ by the inscribed angle theorem. Also, $B'C = 11$ because the quadrilater... | MathNet | 0kq5 | United States | HMMT November 2022 | [
"Geometry > Plane Geometry > Transformations > Rotation",
"Geometry > Plane Geometry > Triangles > Triangle trigonometry",
"Geometry > Plane Geometry > Miscellaneous > Angle chasing",
"Geometry > Plane Geometry > Quadrilaterals"
] | final answer only | null | en | |
Find the smallest positive integer which has exactly $2015$ positive divisors. | 2^30 * 3^12 * 5^4 | The number of positive divisors of an integer $N$ with the prime factorization $p_1^{a_1} p_2^{a_2} \cdots p_n^{a_n}$ is $(a_1 + 1)(a_2 + 1) \cdots (a_n + 1)$. Since $2015 = 1 \cdot 2015 = 5 \cdot 403 = 13 \cdot 155 = 31 \cdot 65 = 5 \cdot 13 \cdot 31$, the required number has one of the following forms: $a = 2^{2014}$... | MathNet | 0bmx | Romania | 66th ROMANIAN MATHEMATICAL OLYMPIAD | [
"Number Theory > Number-Theoretic Functions > τ (number of divisors)",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | proof and answer | null | en | |
Solve in the real numbers the system
$$
x^3 = \frac{z}{y} - \frac{2y}{z}, \quad y^3 = \frac{x}{z} - \frac{2z}{x}, \quad z^3 = \frac{y}{x} - \frac{2x}{y}.
$$ | (-1, -1, -1), (1, 1, -1), (1, -1, 1), (-1, 1, 1) | For $x, y, z \in \mathbb{R}$, such that $xyz \neq 0$, the system is written:
$$
x^3 y z = z^2 - 2y^2 \quad (1), \quad y^3 z x = x^2 - 2z^2 \quad (2), \quad z^3 x y = y^2 - 2x^2 \quad (3)
$$
Using summation by parts we find:
$$
xyz(x^2 + y^2 + z^2) = -(x^2 + y^2 + z^2) \Leftrightarrow (x^2 + y^2 + z^2)(xyz + 1) = 0.
$$
... | MathNet | 067b | Greece | 31st Hellenic Mathematical Olympiad | [
"Algebra > Prealgebra / Basic Algebra > Simple Equations",
"Algebra > Algebraic Expressions > Polynomials > Symmetric functions"
] | proof and answer | English | en | |
Let $a, b, c, d, e, f$ be real numbers such that the polynomial
$$
p(x) = x^{8} - 4x^{7} + 7x^{6} + a x^{5} + b x^{4} + c x^{3} + d x^{2} + e x + f
$$
factorises into eight linear factors $x - x_{i}$, with $x_{i} > 0$ for $i = 1, 2, \ldots, 8$. Determine all possible values of $f$. | 1/256 | From
$$
x^{8} - 4x^{7} + 7x^{6} + a x^{5} + b x^{4} + c x^{3} + d x^{2} + e x + f = (x - x_{1})(x - x_{2}) \ldots (x - x_{8})
$$
we have
$$
\sum_{i=1}^{8} x_{i} = 4 \quad \text{and} \quad \sum x_{i} x_{j} = 7
$$
where the second sum is over all pairs $(i, j)$ of integers where $1 \leq i < j \leq 8$. Since this sum can ... | MathNet | 00g4 | Asia Pacific Mathematics Olympiad (APMO) | XV APMO | [
"Algebra > Algebraic Expressions > Polynomials > Vieta's formulas",
"Algebra > Algebraic Expressions > Polynomials > Symmetric functions",
"Algebra > Equations and Inequalities > Cauchy-Schwarz",
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean"
] | proof and answer | null | en | |
Let $q$ be a positive rational number. Two ants are initially at the same point $X$ in the plane. In the $n$-th minute ($n=1,2,3,\ldots$) each of them chooses whether to walk due north, east, south or west and then walks the distance of $q^n$ meter. After a whole number of minutes, they are at the same point in the pla... | 1 | Let $x_A^{(n)}$ (resp. $x_B^{(n)}$) be the $x$-coordinates of the first (resp. second) ant's position after $n$ minutes. Then $x_A^{(n)} - x_B^{(n)} \in \{q^n, -q^n, 0\}$, and so $x_A^{(n)}, x_B^{(n)}$ are given by polynomials in $q$ with coefficients in $\{-1, 1, 0\}$. So if the ants meet after $n$ minutes, then
$$
0 ... | MathNet | 0akb | North Macedonia | Balkan Mathematical Olympiad | [
"Geometry > Plane Geometry > Analytic / Coordinate Methods > Cartesian coordinates",
"Algebra > Algebraic Expressions > Polynomials > Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein",
"Geometry > Plane Geometry > Transformations > Homothety",
"Geometry > Plane Geometry > Miscellaneous > Dista... | proof and answer | English | en | |
Find all positive integers $n$ such that there are $k \ge 2$ positive rational numbers $a_1, a_2, \dots, a_k$ satisfying $a_1 + a_2 + \dots + a_k = a_1 \cdot a_2 \dots a_k = n$. | n = 4 or n ≥ 6 | The answer is $n = 4$ or $n \ge 6$.
I. First, we prove that each $n \in \{4, 6, 7, 8, 9, \dots\}$ satisfies the condition.
(1). If $n = 2k \ge 4$ is even, we set $(a_1, a_2, \dots, a_k) = (k, 2, 1, \dots, 1)$:
$$
a_1 + a_2 + \dots + a_k = k + 2 + 1 \cdot (k-2) = 2k = n,
$$
and
$$
a_1 \cdot a_2 \cdot \dots \cdot a_k =... | MathNet | 0ijk | United States | USAMO | [
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean",
"Algebra > Intermediate Algebra > Quadratic functions"
] | proof and answer | null | en | |
Let $n$ be a positive integer. What proportion of the non-empty subsets of $\{1, 2, \dots, 2n\}$ has a smallest element that is odd?
(Birgit Vera Schmidt) | 2/3 | The number of subsets of $\{1, 2, \dots, 2n\}$ that have $k$ as smallest element is $2^{2n-k}$ for $1 \le k \le 2n$ since each element bigger than $k$ is either contained in the subset or not.
The number $O$ of subsets with an odd smallest element is therefore equal to
$$
O = 2^{2n-1} + 2^{2n-3} + \dots + 2^3 + 2^1 = 2... | MathNet | 00nu | Austria | AUT_ABooklet_2023 | [
"Discrete Mathematics > Combinatorics > Counting two ways",
"Algebra > Algebraic Expressions > Sequences and Series > Sums and products"
] | proof and answer | English | en | |
Problem:
Let $A = 1 \cdot 4 \cdot 7 \cdot \ldots \cdot 2014$ be the product of the numbers less or equal to $2014$ that give remainder $1$ when divided by $3$. Find the last non-zero digit of $A$. | 2 | Solution:
Grouping the elements of the product by ten we get:
$$
\begin{aligned}
& (30k+1)(30k+4)(30k+7)(30k+10)(30k+13)(30k+16) \\
& (30k+19)(30k+22)(30k+25)(30k+28) = \\
& = (30k+1)(15k+2)(30k+7)(120k+40)(30k+13)(15k+8) \\
& (30k+19)(15k+11)(120k+100)(15k+14)
\end{aligned}
$$
(We divide all even numbers not divisible... | MathNet | 08of | JBMO | Junior Balkan Mathematical Olympiad | [
"Number Theory > Divisibility / Factorization > Factorization techniques",
"Number Theory > Other"
] | proof and answer | null | en | |
Problem:
A restricted path of length $n$ is a path of length $n$ such that for all $i$ between $1$ and $n-2$ inclusive, if the $i$th step is upward, the $i+1$st step must be rightward.
Find the number of restricted paths that start at $(0,0)$ and end at $(7,3)$. | 56 | Solution:
This is equal to the number of lattice paths from $(0,0)$ to $(7,3)$ that use only rightward and diagonal (upward+rightward) steps plus the number of lattice paths from $(0,0)$ to $(7,2)$ that use only rightward and diagonal steps, which is equal to the number of paths (as defined above) from $(0,0)$ to $(4,... | MathNet | 0i4x | United States | Harvard-MIT Math Tournament | [
"Discrete Mathematics > Combinatorics > Recursion, bijection"
] | final answer only | null | en | |
Problem:
The sets $M=\{1,2, \ldots, 27\}$ and $A=\{a_{1}, a_{2}, \ldots, a_{k}\} \subset \{1,2, \ldots, 14\}$ have the following property: every element of $M$ is either an element of $A$ or the sum of two (possibly identical) elements of $A$. Find the minimum value of $k$. | 8 | Solution:
The elements of $A$ give $\binom{k}{2}+k+k=\frac{k(k+3)}{2}$ sums of the required kind (with two different summands, two equal summands or one summand, respectively). Therefore $\frac{k(k+3)}{2} \geq 27$, whence $k \geq 6$.
If $k=6$ every element of $M$ has a unique representation. This consecutively implie... | MathNet | 038c | Bulgaria | Spring Mathematical Competition | [
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments",
"Discrete Mathematics > Combinatorics > Pigeonhole principle",
"Discrete Mathematics > Combinatorics > Counting two ways"
] | proof and answer | null | en | |
Let $1*2*3*4*5*6*7*8*9=0$ be a given equality. Is it possible to substitute some of the $*$ with $+$ and the others with $-$ to obtain a correct equality? | No | Sum or difference of two even or two odd numbers is an even number. Sum or difference of an even and an odd number, or an odd and an even number, is an odd number. On the left side of the equality there are $4$ even and $5$ odd numbers. Any combination of $+$ and $-$ will give an odd number, but $0$ is an even number. ... | MathNet | 0adb | North Macedonia | Macedonian Mathematical Competitions | [
"Algebra > Prealgebra / Basic Algebra > Integers",
"Discrete Mathematics > Combinatorics > Invariants / monovariants"
] | proof and answer | null | en | |
There is a $20 \times 20$ table and $400$ cards printed with the numbers $1$ to $400$. The cards are then distributed to the cells of the table so that there is one card in each cell. After that, we put a red sticker on the card in each row with the largest number, and a blue sticker on the card in each column with the... | 362 | Answer: $362$
For convenience we shall use the term 'red number' to the number on a card with a red sticker, and similarly for 'blue number'. Clearly, a red number, being a row maximum, is at least $20$. Also, since $A$ is the smallest red number, there are $19$ other red numbers greater than $A$, so $A$ is at most $3... | MathNet | 06nw | Hong Kong | IMO Preliminary Selection Contest — Hong Kong | [
"Discrete Mathematics > Combinatorics > Pigeonhole principle",
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments"
] | proof and answer | null | en | |
Problem:
Find all positive integers $d$ for which there exists a degree $d$ polynomial $P$ with real coefficients such that there are at most $d$ different values among $P(0), P(1), \ldots, P\left(d^{2}-d\right)$. | {1, 2, 3} | Solution:
We claim that such polynomials exist if and only if $d \leq 3$. The following examples show that such polynomials do exist for $d \leq 3$:
$$
\begin{array}{lll}
d=1: & d^{2}-d=0, & P_{1}(x)=x, \\
\end{array} \begin{array}{ll}
& P(0)=0 ;
\end{array}
$$
We can make more examples by adding constants.
Now we wi... | MathNet | 05e9 | European Girls' Mathematical Olympiad (EGMO) | EGMO 2024 | [
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations",
"Algebra > Algebraic Expressions > Polynomials > Polynomial interpolation: Newton, Lagrange"
] | proof and answer | null | en | |
Consider all polynomials with the leading coefficient $1$ that give the remainder of $1$ when divided by $x + 1$ and the remainder $2$ when divided by $x^2 + 1$. Among these, find the polynomial of the lowest degree. | x^3 + (1/2)x^2 + x + 5/2 | Obviously, the degree of such a polynomial must be at least $2$. If the degree were equal to $2$, this polynomial would have the form of
$$
p(x) = x^2 + a x + b = (x^2 + 1) + a x + (b - 1).
$$
When dividing by $x^2 + 1$ the remainder is $2$, and $a x + (b - 1) = 2$ implies $a = 0$ and $b = 3$. But when we divide $p(x) ... | MathNet | 0e06 | Slovenia | National Math Olympiad | [
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations"
] | proof and answer | null | en | |
Problem:
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\left(\alpha^{2}\right)^{2}$. | 2020*2^{2019} | Solution:
Let $P(x)$ have degree $n = 2020$ with roots $r_{1}, \ldots, r_{n}$. Let $R(x) = \prod_{i} \left(x - r_{i}^{2}\right)$. Then
$$
\prod_{i} r_{i}^{n} P\left(\frac{x}{r_{i}}\right) = \prod_{i} \prod_{j} \left(x - r_{i} r_{j}\right) = Q(x)^{2} R(x)
$$
Using $R\left(x^{2}\right) = (-1)^{n} P(x) P(-x)$ and Vieta, w... | MathNet | 0kfj | United States | HMMT February 2020 | [
"Algebra > Algebraic Expressions > Polynomials > Vieta's formulas",
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations",
"Algebra > Algebraic Expressions > Polynomials > Symmetric functions"
] | proof and answer | null | en | |
Problem:
For a point $P=(x, y)$ in the Cartesian plane, let $f(P)=\left(x^{2}-y^{2}, 2 x y-y^{2}\right)$. If $S$ is the set of all $P$ so that the sequence $P, f(P), f(f(P)), f(f(f(P))), \ldots$ approaches $(0,0)$, then the area of $S$ can be expressed as $\pi \sqrt{r}$ for some positive real number $r$. Compute $\lflo... | 133 | Solution:
For a point $P=(x, y)$, let $z(P)=x+y \omega$, where $\omega$ is a nontrivial third root of unity. Then
$$
\begin{aligned}
z(f(P))=\left(x^{2}-y^{2}\right)+\left(2 x y-y^{2}\right) \omega=x^{2}+2 x y \omega+y^{2}( -1-\omega) \\
& =x^{2}+2 x y \omega+y^{2} \omega^{2}=(x+y \omega)^{2}=z(P)^{2}
\end{aligned}
$$
... | MathNet | 0kqz | United States | HMMT February | [
"Geometry > Plane Geometry > Analytic / Coordinate Methods > Complex numbers in geometry",
"Algebra > Linear Algebra > Linear transformations",
"Algebra > Linear Algebra > Determinants",
"Algebra > Algebraic Expressions > Polynomials > Roots of unity"
] | final answer only | null | en | |
Problem:
A number is upwards if its digits in base 10 are nondecreasing when read from left to right. Compute the number of positive integers less than $10^{6}$ that are both upwards and multiples of 11. | 219 | Solution:
For a number $d_{5}d_{4}d_{3}d_{2}d_{1}d_{0}$ (allowing leading 0s) to be upwards and a multiple of 11, we must have
$$d_{5} \leq d_{4} \leq d_{3} \leq d_{2} \leq d_{1} \leq d_{0},$$
$$d_{0} - d_{1} + d_{2} - d_{3} + d_{4} - d_{5} \equiv 0 \pmod{11}.$$
Note that $d_{0} - d_{1}$, $d_{2} - d_{3}$, and $d_{4} -... | MathNet | 0l56 | United States | HMMT February | [
"Number Theory > Modular Arithmetic",
"Discrete Mathematics > Combinatorics"
] | final answer only | null | en | |
Let $x$, $y$, $z$ be positive real numbers satisfying the following conditions:
$$
\frac{1}{\sqrt{2}} \leq z < \frac{1}{2} \min \{x\sqrt{2},\ y\sqrt{3}\}, \\
x + z\sqrt{3} \geq \sqrt{6}, \\
y\sqrt{3} + z\sqrt{10} \geq 2\sqrt{5}.
$$
Find the greatest value of the expression:
$$
P(x, y, z) = \frac{1}{x^2} + \frac{2}{y^... | 118/15 | By denoting $\frac{1}{x\sqrt{2}} = a$, $\frac{1}{y\sqrt{3}} = b$, $\frac{1}{2z} = c$, the problem becomes:
Find the greatest value of the expression
$$
Q(a, b, c) = 2a^2 + 6b^2 + 12c^2
$$
where $a$, $b$, $c$ are positive numbers satisfying the conditions:
$$
\max\{a, b\} < c \leq \frac{1}{\sqrt{2}} \quad (1)
$$
$$
c\sq... | MathNet | 0l8o | Vietnam | VIETNAMESE MATHEMATICAL OLYMPIAD | [
"Algebra > Equations and Inequalities > Cauchy-Schwarz",
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean"
] | proof and answer | null | en | |
Problem:
On the Cartesian plane $\mathbb{R}^{2}$, a circle is said to be nice if its center is at the origin $(0,0)$ and it passes through at least one lattice point (i.e. a point with integer coordinates). Define the points $A=(20,15)$ and $B=(20,16)$. How many nice circles intersect the open segment $AB$?
For refer... | 10 | Solution:
The square of the radius of a nice circle is the sum of the square of two integers.
The nice circle of radius $r$ intersects (the open segment) $\overline{AB}$ if and only if a point on $\overline{AB}$ is a distance $r$ from the origin. $\overline{AB}$ consists of the points $(20, t)$ where $t$ ranges over $... | MathNet | 0jt8 | United States | HMMT February | [
"Geometry > Plane Geometry > Analytic / Coordinate Methods > Cartesian coordinates",
"Geometry > Plane Geometry > Miscellaneous > Distance chasing",
"Number Theory > Divisibility / Factorization > Factorization techniques",
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order anal... | proof and answer | null | en | |
Problem:
How many real triples $(a, b, c)$ are there such that the polynomial $p(x)=x^{4}+a x^{3}+b x^{2}+a x+c$ has exactly three distinct roots, which are equal to $\tan y, \tan 2 y$, and $\tan 3 y$ for some real $y$? | 18 | Solution:
Answer: 18
Let $p$ have roots $r, r, s, t$. Using Vieta's on the coefficient of the cubic and linear terms, we see that $2 r + s + t = r^{2} s + r^{2} t + 2 r s t$. Rearranging gives $2 r(1 - s t) = (r^{2} - 1)(s + t)$.
If $r^{2} - 1 = 0$, then since $r \neq 0$, we require that $1 - s t = 0$ for the equati... | MathNet | 0jcv | United States | Harvard-MIT Mathematics Tournament | [
"Algebra > Algebraic Expressions > Polynomials > Vieta's formulas"
] | proof and answer | null | en | |
Problem:
Count the number of functions $f: \mathbb{Z} \rightarrow\{\text{'green'}, \text{'blue'}\}$ such that $f(x)=f(x+22)$ for all integers $x$ and there does not exist an integer $y$ with $f(y)=f(y+2)=\text{'green'}$. | 39601 | Solution:
Answer: $39601$
It is clear that $f$ is determined by $f(0), \ldots, f(21)$. The colors of the 11 even integers are independent of those of the odd integers because evens and odds are never exactly 2 apart.
First, we count the number of ways to "color" the even integers. $f(0)$ can either be 'green' or 'bl... | MathNet | 0jqi | United States | HMMT February 2015 | [
"Discrete Mathematics > Combinatorics > Recursion, bijection",
"Algebra > Algebraic Expressions > Sequences and Series > Recurrence relations"
] | proof and answer | null | en | |
Jerry likes to play with numbers. One day, he wrote all the integers from $1$ to $2024$ on the whiteboard. Then he repeatedly chose four numbers on the whiteboard, erased them, and replaced them by either their sum or their product. (For example, Jerry's first step might have been to erase $1$, $2$, $3$, and $5$, and t... | A | Each time this operation was performed, the number of even integers on the whiteboard was reduced by at most $3$. There were $\frac{2024}{2} = 1012$ even integers on the whiteboard initially. Because $\frac{1011}{3} = 337$ and $\frac{1014}{3} = 338$, Jerry needed at least $338$ operations to eliminate all of them. Afte... | MathNet | 0kzn | United States | AMC 10 B | [
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Algebra > Prealgebra / Basic Algebra > Integers"
] | MCQ | null | en | |
Determine the integers $n \ge 2$ such that $a^2 - a + 2 = 0$ in $\mathbb{Z}_n$ for a unique $a$ in $\mathbb{Z}_n$. | 7 | We show that $7$ is the sole integer satisfying the required conditions. If $a \in \mathbb{Z}_n$ and $a^2 - a + 2 = 0$ in $\mathbb{Z}_n$, then $(1-a)^2 - (1-a) + 2 = a^2 - a + 2 = 0$ in $\mathbb{Z}_n$, so uniqueness forces $a = 1-a$, i.e., $2a = 1$. In particular, $2$ is invertible in $\mathbb{Z}_n$ and $a = 2^{-1}$. H... | MathNet | 0blq | Romania | 66th ROMANIAN MATHEMATICAL OLYMPIAD | [
"Number Theory > Modular Arithmetic > Inverses mod n",
"Number Theory > Modular Arithmetic > Polynomials mod p",
"Number Theory > Divisibility / Factorization > Prime numbers"
] | proof and answer | null | en | |
Problem:
Let $f(x) = x^{3} + a x + b$, with $a \neq b$, and suppose the tangent lines to the graph of $f$ at $x = a$ and $x = b$ are parallel. Find $f(1)$. | 1 | Solution:
Since $f'(x) = 3x^{2} + a$, we must have $3a^{2} + a = 3b^{2} + a$. Then $a^{2} = b^{2}$, and since $a \neq b$, $a = -b$. Thus $f(1) = 1 + a + b = 1$.
Final answer: 1 | MathNet | 0ie4 | United States | Harvard-MIT Mathematics Tournament | [
"Calculus > Differential Calculus > Derivatives",
"Calculus > Differential Calculus > Applications"
] | proof and answer | null | en | |
Problem:
Positive real numbers $x$ and $y$ satisfy
$$
||\cdots|||x|-y|-x| \cdots-y|-x|=||\cdots|||y|-x|-y| \cdots-x|-y|
$$
where there are 2019 absolute value signs $|\cdot|$ on each side. Determine, with proof, all possible values of $\frac{x}{y}$. | 1/3, 1, 3 | Solution:
Clearly $x = y$ works.
Else, WLOG $x < y$, define $d = y - x$, and define $f(z) := ||z - y| - x|$ so our expression reduces to
$$
f^{1009}(x) = \left|f^{1009}(0) - y\right|
$$
Now note that for $z \in [0, y]$, $f(z)$ can be written as
$$
f(z) = \begin{cases} d - z, & 0 \leq z \leq d \\ z - d, & d < z \leq y... | MathNet | 0kf4 | United States | HMMT February 2020 | [
"Algebra > Algebraic Expressions > Functional Equations"
] | proof and answer | null | en | |
In how many ways can the number $\frac{2011}{2010}$ be represented as a product of two fractions of the form $\frac{n+1}{n}$, where $n$ is a positive integer? (Order of the factors is not important.) | 16 | Let $p$ and $q$ be positive integers such that $\frac{2011}{2010} = \frac{p+1}{p} \cdot \frac{q+1}{q}$.
Then $2011pq = 2010(pq + p + q + 1)$ i.e. $pq = 2010(p + q + 1)$.
From the last equation we find
$$
p = \frac{2010(q+1)}{q-2010} = \frac{2010(q-2010)+2010 \cdot 2011}{q-2010} = 2010 + \frac{2010 \cdot 2011}{q-2010}.... | MathNet | 04a8 | Croatia | CroatianCompetitions2011 | [
"Number Theory > Divisibility / Factorization > Factorization techniques",
"Number Theory > Number-Theoretic Functions > τ (number of divisors)"
] | proof and answer | null | en | |
Determine all pairs $(m, n)$ of non-negative integers such that
$$
2n! = m!(m! + 2).
$$ | (3, 4) | The answer is $(3, 4)$.
For $m = 0, 1$ or $2$, we obtain the impossible $2n! = 3$ and $2n! = 8$. However, $m = 3$ works with $n = 4$.
Now let $m \ge 4$. Clearly, $2n! > 2m!$, which implies $n > m$, so we can write $n = m + a$ for some positive integer $a$. The equation transforms into
$$
2(m + 1)(m + 2)(m + a) = m! +... | MathNet | 0dla | Saudi Arabia | Saudi Booklet | [
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities"
] | proof and answer | null | en | |
Problem:
Let $ABCD$ be a convex quadrilateral whose diagonals $AC$ and $BD$ meet at $P$. Let the area of triangle $APB$ be $24$ and let the area of triangle $CPD$ be $25$. What is the minimum possible area of quadrilateral $ABCD$? | 49 + 20*sqrt(6) | Solution:
Note that $\angle APB = 180^{\circ} - \angle BPC = \angle CPD = 180^{\circ} - \angle DPA$ so $4[ BPC ][ DPA ] = (PB \cdot PC \cdot \sin BPC)(PD \cdot PA \cdot \sin DPA) = (PA \cdot PB \cdot \sin APB)(PC \cdot PD \cdot \sin CPD) = 4[ APB ][ CPD ] = 2400 \Longrightarrow [ BPC ][ DPA ] = 600$. Hence by AM-GM we... | MathNet | 0jqw | United States | HMMT November 2015 | [
"Geometry > Plane Geometry > Quadrilaterals",
"Geometry > Plane Geometry > Triangles > Triangle trigonometry",
"Geometry > Plane Geometry > Miscellaneous > Angle chasing",
"Geometry > Plane Geometry > Geometric Inequalities > Optimization in geometry",
"Algebra > Equations and Inequalities > QM-AM-GM-HM / P... | proof and answer | null | en | |
Problem:
Find all ordered pairs $(a, b)$ of positive integers such that $2a + 1$ divides $3b - 1$ and $2b + 1$ divides $3a - 1$. | (2, 2), (12, 17), (17, 12) | Solution:
This is equivalent to the existence of nonnegative integers $c$ and $d$ such that $3b - 1 = c(2a + 1)$ and $3a - 1 = d(2b + 1)$. Then
$$
c d = \frac{(3b - 1)(3a - 1)}{(2a + 1)(2b + 1)} = \frac{3a - 1}{2a + 1} \cdot \frac{3b - 1}{2b + 1} < \frac{3}{2} \cdot \frac{3}{2} = 2.25.
$$
Neither $c$ nor $d$ can equal... | MathNet | 0k97 | United States | HMMT November 2019 | [
"Number Theory > Divisibility / Factorization",
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities"
] | proof and answer | null | en | |
Problem:
Let $ABCD$ be a quadrilateral with $\angle BAD = \angle ABC = 90^{\circ}$, and suppose $AB = BC = 1$, $AD = 2$. The circumcircle of $ABC$ meets $\overline{AD}$ and $\overline{BD}$ at points $E$ and $F$, respectively. If lines $AF$ and $CD$ meet at $K$, compute $EK$. | √2/2 | Solution:
Answer: $\frac{\sqrt{2}}{2}$
Assign coordinates such that $B$ is the origin, $A$ is $(0,1)$, and $C$ is $(1,0)$. Clearly, $E$ is the point $(1,1)$. Since the circumcenter of $ABC$ is $\left(\frac{1}{2}, \frac{1}{2}\right)$, the equation of the circumcircle of $ABC$ is $\left(x-\frac{1}{2}\right)^{2}+\left(y... | MathNet | 0jp5 | United States | HMMT February 2015 | [
"Geometry > Plane Geometry > Analytic / Coordinate Methods > Cartesian coordinates",
"Geometry > Plane Geometry > Triangles > Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle",
"Geometry > Plane Geometry > Circles",
"Geometry > Plane Geometry > Quadrilaterals"
] | proof and answer | null | en | |
Find a triple $(l, m, n)$ ($1 < l < m < n$) of positive integers such that $\sum_{k=1}^{l} k$, $\sum_{k=l+1}^{m} k$, $\sum_{k=m+1}^{n} k$ form a geometric sequence in order. (posed by Tao Pingsheng) | (3, 11, 36) | $\sum_{k=1}^{l} k = S_{l}$, $\sum_{k=l+1}^{m} k = S_{m} - S_{l}$, $\sum_{k=m+1}^{n} k = S_{n} - S_{m}$,
form a geometric sequence in order. Then
$$
S_{l}(S_{n} - S_{m}) = (S_{m} - S_{l})^2, \qquad \textcircled{1}
$$
that is $S_{l}(S_{n} + S_{m} - S_{l}) = S_{m}^2$. Thus, $S_{l} \mid S_{m}^2$, that is
$$
2l(l + 1) \mid ... | MathNet | 03zv | China | China Southeastern Mathematical Olympiad | [
"Algebra > Algebraic Expressions > Sequences and Series > Sums and products",
"Number Theory > Divisibility / Factorization"
] | proof and answer | English | en | |
Problem:
Let $P(x) = x^{3} + x^{2} - r^{2} x - 2020$ be a polynomial with roots $r, s, t$. What is $P(1)$? | -4038 | Solution:
Plugging in $x = r$ gives $r^{2} = 2020$. This means $P(1) = 2 - r^{2} - 2020 = -4038$.
Final answer: -4038 | MathNet | 0kbi | United States | HMMT February 2020 | [
"Algebra > Algebraic Expressions > Polynomials > Vieta's formulas"
] | final answer only | null | en | |
Problem:
If $f(x)$ is a monic quartic polynomial such that $f(-1) = -1$, $f(2) = -4$, $f(-3) = -9$, and $f(4) = -16$, find $f(1)$. | 23 | Solution:
The given data tells us that the roots of $f(x) + x^{2}$ are $-1$, $2$, $-3$, and $4$. Combining with the fact that $f$ is monic and quartic, we get
$$
f(x) + x^{2} = (x + 1)(x - 2)(x + 3)(x - 4).
$$
Hence
$$
f(1) = (1 + 1)(1 - 2)(1 + 3)(1 - 4) - 1 = (2)(-1)(4)(-3) - 1 = 2 \times (-1) \times 4 \times (-3) - ... | MathNet | 0hz2 | United States | Harvard-MIT Math Tournament | [
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations"
] | proof and answer | null | en | |
Find the smallest positive integer of the form $\overline{30x070y03}$, which is divisible by $37$, where $x$, $y$ are digits. | 300070703 | Let us rewrite this number as follows:
$$
\overline{30x070y03} = 300070003 + 10^6x + 10^2y = 37 \cdot (8110000 + 27027x + 3y) + (3 + x - 11y).
$$
Thus, $3 + x - 11y$ must be divisible by $37$ for the smallest $x$. Since $x$, $y$ are digits, then this expression can only take values $0$, $-37$, $-74$. For each, we have ... | MathNet | 0hc1 | Ukraine | 59th Ukrainian National Mathematical Olympiad | [
"Number Theory > Modular Arithmetic > Polynomials mod p"
] | proof and answer | English | en | |
In how many ways can 6 juniors and 6 seniors form 3 disjoint teams of 4 people so that each team has 2 juniors and 2 seniors?
(A) 720 (B) 1350 (C) 2700 (D) 3280 (E) 8100 | B | Select the first junior and call this person $A$. There are 5 other juniors and $\binom{6}{2} = 15$ pairs of seniors who could team up with $A$. Select the next junior not yet on a team, say $B$. There are 3 other juniors and $\binom{4}{2} = 6$ pairs of seniors who could team up with $B$. The third team consists of the... | MathNet | 0l47 | United States | AMC 10 A | [
"Discrete Mathematics > Combinatorics > Enumeration with symmetry",
"Discrete Mathematics > Combinatorics > Counting two ways"
] | MCQ | null | en | |
Given three pairwise distinct positive integers $a$, $b$, $c$, whose product is $320$. Determine the smallest possible prime sum of these numbers. | 37 | Clearly, their sum is greater than $2$, so the prime sum has to be odd. Since all three numbers can't be odd simultaneously, since their product is $320$, then two numbers are even and one is odd. There are exactly two odd divisors of $320 = 2^6 \cdot 5$: $1$ and $5$. Consider these cases.
$c = 1$, the following is po... | MathNet | 0h8g | Ukraine | 58th Ukrainian National Mathematical Olympiad | [
"Number Theory > Divisibility / Factorization > Prime numbers",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | proof and answer | English | en | |
Five points $A$, $B$, $C$, $D$, $E$, $P$ lie on a plane. Points $A$, $B$, $C$, $D$ lie on a straight line in this order. Furthermore, it is known that $AB = BC = CD = 6$, $PB = 5$ and $PC = 7$ are satisfied. Here we denote the length of the line segment $XY$ also by $XY$. Let $Q$ be the point of intersection, different... | 55√7/14 | $\frac{55\sqrt{7}}{14}$
Let $M$ be the point of intersection of line segments $BC$ and $PQ$. By using the well-known theorem on the power of a point with respect to a circle for the point $M$ and the two given circles, we get $AM \cdot CM = PM \cdot QM = DM \cdot BM$. Combining this with the fact $AM + CM = BM + DM = ... | MathNet | 08y6 | Japan | Japan 2015 | [
"Geometry > Plane Geometry > Circles > Radical axis theorem",
"Geometry > Plane Geometry > Miscellaneous > Distance chasing",
"Geometry > Plane Geometry > Triangles"
] | proof and answer | null | en | |
Problem:
Let $A$, $B$ be two sets of $N$ consecutive integers. If $N=2003$, can we form $N$ pairs $(a,b)$ with $a \in A$, $b \in B$ such that the sums of the pairs are $N$ consecutive integers? What about $N=2004$? | Yes for N equals 2003; No for N equals 2004. | Solution:
Without loss of generality, let $A = B = \{1, 2, \ldots, N\}$—if we have a solution for $A = \{a+1, a+2, \ldots, a+N\}$ and $B = \{b+1, b+2, \ldots, b+N\}$, then subtracting $a$ from every element of $A$ and $b$ from every element of $B$ gives a solution for $A = B = \{1, 2, \ldots, N\}$.
Suppose the sum set... | MathNet | 071d | Ibero-American Mathematical Olympiad | Iberoamerican Mathematical Olympiad | [
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Discrete Mathematics > Combinatorics > Recursion, bijection"
] | proof and answer | null | en | |
Konstantin had two sets of 17 coins: the first set consists of 17 genuine coins, while the second set consists of 12 genuine and 5 false coins. (All the coins look equally; the genuine coins have equal weights, and the false coins have equal weights different from the weight of genuine ones; but it is not known if the ... | Yes | Назовем набор из 17 настоящих монет хорошим, а набор из 12 настоящих и 5 фальшивых монет — плохим. Опишем возможные действия Кости.
Разобьем 17 монет из оставшегося у него набора на четыре группы $A, B, C, D$, содержащие 2, 3, 5, и 7 монет соответственно. При первом взвешивании на одну чашу весов положим группы $A$ и ... | MathNet | 0cmk | Russia | Russian mathematical olympiad | [
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Algebra > Prealgebra / Basic Algebra > Simple Equations"
] | proof and answer | English; Russian | en | |
Problem:
Find a number $N$ with five digits, all different and none zero, which equals the sum of all distinct three digit numbers whose digits are all different and are all digits of $N$. | 35964 | Solution:
There are $4 \times 3 = 12$ numbers with a given digit of $n$ in the units place. Similarly, there are $12$ with it in the tens place and $12$ with it in the hundreds place. So the sum of the 3 digit numbers is $12 \times 111(a+b+c+d+e)$, where $n=abcde$. So $8668a=332b+1232c+1322d+1331e$. We can easily see t... | MathNet | 06zj | Ibero-American Mathematical Olympiad | Iberoamerican Mathematical Olympiad | [
"Discrete Mathematics > Combinatorics > Counting two ways",
"Number Theory > Other"
] | proof and answer | null | en | |
Problem:
Two dice are loaded so that the numbers $1$ through $6$ come up with various (possibly different) probabilities on each die. Is it possible that, when both dice are rolled, each of the possible totals $2$ through $12$ has an equal probability of occurring? | No | Solution:
The answer is no. Suppose that each of the totals from $2$ to $12$ has an equal probability, which must be $1/11$ since the sum of all probabilities is $1$. Let $a$ and $b$ be the probabilities of a $1$ and a $6$, respectively, on the first die, and let $c$ and $d$ be the corresponding probabilities on the s... | MathNet | 0huv | United States | Berkeley Math Circle Monthly Contest 7 | [
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean"
] | proof and answer | null | en | |
Turbo the snail is in the lower left cell of an $n \times n$ array, $n \ge 2$, and aims to reach the upper right cell by moving one cell rightwards or one cell upwards. Some cells contain monsters, visible to Turbo, and they must be avoided. Assume there is a unique way for Turbo to achieve his goal. In terms of $n$, d... | n-1 | Let $(i, j)$ denote the cell on the $i$-th row and the $j$-th column, where $(1, 1)$ is the lower left cell. The required minimum is $n-1$ and is achieved by placing the monsters in the cells $(k, n-k+1), k=2, \dots, n$, to force Turbo move rightwards from $(1, 1)$ to $(1, n)$ and thence upwards to $(n, n)$.
To prove ... | MathNet | 0cjq | Romania | 75th NMO Selection Tests | [
"Discrete Mathematics > Combinatorics > Induction / smoothing",
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments"
] | proof and answer | English | en | |
Problem:
Let $ABCD$ be an isosceles trapezoid with $AD = BC = 255$ and $AB = 128$. Let $M$ be the midpoint of $CD$ and let $N$ be the foot of the perpendicular from $A$ to $CD$. If $\angle MBC = 90^{\circ}$, compute $\tan \angle NBM$. | 120/353 | Solution:
Construct $P$, the reflection of $A$ over $CD$. Note that $P$, $M$, and $B$ are collinear. As $\angle PNC = \angle PBC = 90^{\circ}$, $PNBC$ is cyclic. Thus, $\angle NBM = \angle NCP$, so our desired tangent is $\tan \angle ACN = \frac{AN}{CN}$. Note that $NM = \frac{1}{2} AB = 64$. Since $\triangle AND \sim... | MathNet | 0ka4 | United States | HMMT November 2019 | [
"Geometry > Plane Geometry > Quadrilaterals > Cyclic quadrilaterals",
"Geometry > Plane Geometry > Triangles > Triangle trigonometry",
"Geometry > Plane Geometry > Miscellaneous > Angle chasing",
"Geometry > Plane Geometry > Miscellaneous > Constructions and loci",
"Geometry > Plane Geometry > Miscellaneous... | proof and answer | null | en | |
Find all real values of $k$, such that all solutions of the equation $k(2-k)x^2 - (k+4)x + 6 = 0$ are positive integers. | k = 1/2, 1, 2 | First, we go through cases when this equation is not quadratic.
For $k=0$, equation becomes $-4x+6=0$, and has a non-integer solution.
For $k=2$, equation becomes $-6x+6=0$, and has a single solution $x=1$, which satisfies the statement.
Now, suppose $k(2-k) \neq 0$. We find the discriminant of this quadratic equation... | MathNet | 0hax | Ukraine | 59th Ukrainian National Mathematical Olympiad | [
"Algebra > Intermediate Algebra > Quadratic functions",
"Number Theory > Divisibility / Factorization > Greatest common divisors (gcd)"
] | proof and answer | English | en | |
Find all positive integers $n$ for which we can fill in the entries of an $n \times n$ table with the following properties:
- each entry can be one of $I$, $M$ and $O$;
- in each row and each column, the letters $I$, $M$ and $O$ occur the same number of times; and
- in any diagonal whose number of entries is a multiple... | All positive integers divisible by 9 | We first show that such a table exists when $n$ is a multiple of $9$. Consider the following $9 \times 9$ table.
$$
\left(\begin{array}{ccccccccc}
I & I & I & M & M & M & O & O & O \\
M & M & M & O & O & O & I & I & I \\
O & O & O & I & I & I & M & M & M \\
I & I & I & M & M & M & O & O & O \\
M & M & M & O & O & O & ... | MathNet | 06ts | IMO | IMO 2016 Shortlisted Problems | [
"Discrete Mathematics > Combinatorics > Counting two ways",
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments"
] | proof and answer | English | en | |
Problem:
Let $a$, $b$, and $c$ be the side lengths of a triangle, and assume that $a \leq b$ and $a \leq c$. Let $x=\frac{b+c-a}{2}$. If $r$ and $R$ denote the inradius and circumradius, respectively, find the minimum value of $\frac{a x}{r R}$. | 3 | Solution:
It is well-known that both $\frac{a b c}{4 R}$ and $\frac{r(a+b+c)}{2}$ are equal to the area of triangle $A B C$. Thus $\frac{a b c}{4 R}=\frac{r(a+b+c)}{2}$, and
$$
R r=\frac{a b c}{2(a+b+c)}
$$
Since $a \leq b$ and $a \leq c$, we have $\frac{a^{2}}{b c} \leq 1$. We thus obtain that
$$
\begin{aligned}
\frac... | MathNet | 0j50 | United States | Harvard-MIT Mathematics Tournament | [
"Geometry > Plane Geometry > Triangles > Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle",
"Geometry > Plane Geometry > Geometric Inequalities > Optimization in geometry",
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean"
] | proof and answer | null | en | |
Problem:
Let $\otimes$ be a binary operation that takes two positive real numbers and returns a positive real number. Suppose further that $\otimes$ is continuous, commutative $(a \otimes b = b \otimes a)$, distributive across multiplication $(a \otimes (b c) = (a \otimes b)(a \otimes c))$, and that $2 \otimes 2 = 4$.... | y = sqrt(2) | Solution:
Answer: $y = \sqrt{2}$
We note that $\left(a \otimes b^{k}\right) = (a \otimes b)^{k}$ for all positive integers $k$. Then for all rational numbers $\frac{p}{q}$ we have $a \otimes b^{\frac{p}{q}} = \left(a \otimes b^{\frac{1}{q}}\right)^{p} = (a \otimes b)^{\frac{p}{q}}$. So by continuity, for all real num... | MathNet | 0jc8 | United States | Harvard-MIT Mathematics Tournament | [
"Algebra > Algebraic Expressions > Functional Equations",
"Algebra > Intermediate Algebra > Exponential functions",
"Algebra > Intermediate Algebra > Logarithmic functions"
] | proof and answer | null | en | |
The teacher ordered 20 students from one class in a row and gave 800 candies to them. Every student had to calculate the ratio $\frac{x}{x+2k-1}$, where $x$ is the number of candies that he got and $k$ is the number of his position in the row, counting from left to right. After calculating they all got the same result.... | 46 | Let the first student received $x_1$ candies, the second $x_2$ candies, ..., and the twentieth received $x_{20}$ candies. So $x_1 + x_2 + \dots + x_{20} = 800$. Let $\frac{x_k}{x_k + 2k-1} = M$ from where $x_k = (2k-1)\frac{M}{1-M}$. For the sum $x_1 + x_2 + \dots + x_{20}$ we obtain
$$
x_1 + x_2 + \dots + x_{20} = \fr... | MathNet | 0acd | North Macedonia | Macedonian Mathematical Competitions | [
"Algebra > Prealgebra / Basic Algebra > Simple Equations",
"Algebra > Prealgebra / Basic Algebra > Fractions",
"Algebra > Algebraic Expressions > Sequences and Series > Sums and products"
] | proof and answer | null | en | |
Problem:
Three of the roots of $x^{4} + a x^{2} + b x + c = 0$ are $3$, $-2$, and $5$. Find the value of $a + b + c$. | 167 | Solution:
The coefficient of $x^{3}$ is $0$, so by Vieta's formula, the sum of the roots must be $0$, and the fourth root must be $-6$. Therefore, the polynomial factors as $(x-3)(x+2)(x-5)(x+6)$. Setting $x=1$ gives $1 + a + b + c = (1-3)(1+2)(1-5)(1+6) = 168$, so $a + b + c = 167$.
Final answer: 167 | MathNet | 0axv | Philippines | Philippine Mathematical Olympiad | [
"Algebra > Algebraic Expressions > Polynomials > Vieta's formulas",
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations"
] | final answer only | null | en | |
Problem:
The expression $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. Find the value of
$$
\left\lfloor\frac{2002!}{2001!+2000!+1999!+\cdots+1!}\right\rfloor .
$$ | 2000 | Solution:
2000
We break up $2002! = 2002 \cdot 2001!$ as
$$
\begin{gathered}
2000(2001!)+2 \cdot 2001(2000!)=2000(2001!)+2000(2000!)+2002 \cdot 2000(1999!) \\
>2000(2001!+2000!+1999!+\cdots+1!)
\end{gathered}
$$
On the other hand,
$$
2001(2001!+2000!+\cdots+1!)>2001(2001!+2000!)=2001(2001!)+2001!=2002!
$$
Thus we hav... | MathNet | 0i5e | United States | Harvard-MIT Math Tournament | [
"Algebra > Prealgebra / Basic Algebra > Integers",
"Algebra > Algebraic Expressions > Sequences and Series > Sums and products"
] | final answer only | null | en | |
Determine all triples $(x, y, z)$ of real numbers satisfying:
$$
\begin{aligned}
x^2 - yz &= |y - z| + 1, \\
y^2 - zx &= |z - x| + 1, \\
z^2 - xy &= |x - y| + 1.
\end{aligned}
$$ | All permutations of (4/3, 4/3, -5/3) and (5/3, -4/3, -4/3). | The system of equations is symmetric: if you swap $x$ and $y$, for example, then the third equation stays the same and the first two equations are swapped. Hence, we can assume without loss of generality that $x \ge y \ge z$. Then the system of equations becomes:
$$
\begin{aligned}
x^2 - yz &= y - z + 1, \\
y^2 - zx &=... | MathNet | 09xc | Netherlands | BxMO Team Selection Test | [
"Algebra > Prealgebra / Basic Algebra > Simple Equations",
"Algebra > Intermediate Algebra > Quadratic functions"
] | proof and answer | English | en | |
Find all pairs $(p,q)$, $p,q \in \mathbb{N}$ such that
$$
(p+1)^{p-1} + (p-1)^{p+1} = q^q.
$$ | [(1,1), (2,2)] | First, we have
$$
(p+1)^{p-1} + (p-1)^{p+1} \ge (p+1)^{p-1} \ge (p-1)^{p-1} \quad (1)
$$
$$
(p+1)^{p-1} + (p-1)^{p+1} < (p+1)^{p+1} + (p+1)^{p-1} = 2(p+1)^{p+1} < (p+2)^{p+2} \quad (2)
$$
From (1) and (2) follows
$$
(p-1)^{p-1} \le q^q < (p+2)^{p+2}.
$$
1) Let
$$
q = p-1, \quad (p+1)^{p-1} + (p-1)^{p+1} = (p-1)^{p-1}.
... | MathNet | 0akk | North Macedonia | Junior Mathematical Olympiad | [
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities",
"Number Theory > Divisibility / Factorization > Greatest common divisors (gcd)"
] | proof and answer | English | en | |
Problem:
Define $\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the remainder when
$$
\sum_{\substack{2 \leq n \leq 50 \\ \operatorname{gcd}(n, 50)=1}} \phi^{!}(n)
$$
is divided by $50$. | 12 | Solution:
First, $\phi^{!}(n)$ is even for all odd $n$, so it vanishes modulo $2$.
To compute the remainder modulo $25$, we first evaluate $\phi^{!}(3) + \phi^{!}(7) + \phi^{!}(9) \equiv 2 + 5 \cdot 4 + 5 \cdot 3 \equiv 12$ $ (\bmod 25) $. Now, for $n \geq 11$ the contribution modulo $25$ vanishes as long as $5 \nmid ... | MathNet | 0jsa | United States | HMMT February | [
"Number Theory > Modular Arithmetic",
"Number Theory > Modular Arithmetic > Chinese remainder theorem",
"Number Theory > Divisibility / Factorization > Greatest common divisors (gcd)"
] | final answer only | null | en | |
Problem:
In how many ways can Alex, Billy, and Charles split $7$ identical marbles among themselves so that no two have the same number of marbles? It is possible for someone not to get any marbles. | 24 | Solution:
Let the numbers of marbles that Alex, Billy, and Charles get be $a$, $b$, and $c$, respectively, with $a$, $b$, $c \geq 0$ and $a + b + c = 7$. We require that $a$, $b$, and $c$ are all distinct (no two are equal).
Since the marbles are identical and the people are distinguishable, we are counting ordered t... | MathNet | 0au7 | Philippines | 17th Philippine Mathematical Olympiad Area Stage | [
"Discrete Mathematics > Combinatorics > Enumeration with symmetry"
] | proof and answer | null | en | |
Alexia has several marbles and her friend, Cristina, has none. Each day of one week, starting on Monday, Alexia gave Cristina some of her marbles, so that each day Alexia gave more marbles than the day before. On Monday Alexia gave five times less marbles than on Friday, on Tuesday she gave six times less marbles than ... | 7 | Denote $a_1, a_2, \dots, a_7$ the number of marbles given by Alexia from Monday until Sunday, where $1 \le a_1 < a_2 < a_3 < a_4 < a_5 < a_6 < a_7$ and $a_1 + a_2 + a_3 + a_4 + a_5 + a_6 + a_7 = 72$. Then $a_5 = 5a_1$, $a_6 = 6a_2$, $a_7 = 7a_3$, hence $6a_1 + 7a_2 + 8a_3 + a_4 = 72$ (1).
If $a_1 \ge 3$, then $6a_1 + ... | MathNet | 0ck8 | Romania | 75th Romanian Mathematical Olympiad | [
"Algebra > Prealgebra / Basic Algebra > Integers",
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities",
"Algebra > Equations and Inequalities > Linear and quadratic inequalities"
] | proof and answer | English | en | |
Problem:
Determine the largest real number $c$ such that for any $2017$ real numbers $x_{1}, x_{2}, \ldots, x_{2017}$, the inequality
$$
\sum_{i=1}^{2016} x_{i}\left(x_{i}+x_{i+1}\right) \geq c \cdot x_{2017}^{2}
$$
holds. | -1008/2017 | Solution:
Let $n=2016$. Define a sequence of real numbers $\{p_{k}\}$ by $p_{1}=0$, and for all $k \geq 1$,
$$
p_{k+1}=\frac{1}{4\left(1-p_{k}\right)}
$$
Note that, for every $i \geq 1$,
$$
\left(1-p_{i}\right) \cdot x_{i}^{2}+x_{i} x_{i+1}+p_{i+1} x_{i+1}^{2}=\left(\frac{x_{i}}{2 \sqrt{p_{i+1}}}+\sqrt{p_{i+1}} x_{i+1}... | MathNet | 0jzx | United States | February 2017 | [
"Algebra > Equations and Inequalities > Linear and quadratic inequalities",
"Algebra > Algebraic Expressions > Sequences and Series > Recurrence relations"
] | proof and answer | null | en | |
Suppose all the edges of regular triangular pyramid $P$-$ABC$ have length $1$ and $L$, $M$, $N$ are the midpoints of edges $PA$, $PB$ and $PC$, respectively. The area of the cross section of the circumscribed sphere of this regular triangular pyramid intercepted by plane $LMN$ is ______. | π/3 | The given conditions show that plane $LMN$ is parallel to plane $ABC$ and the ratio of the distances from point $P$ to planes $LMN$ and $ABC$ is $1 : 2$. Let $H$ be the centroid of face $ABC$ in regular triangular pyramid $P$-$ABC$ and $PH$ intersects plane $LMN$ at point $K$. Then $PH \perp ABC$ and $PK \perp LMN$, an... | MathNet | 042z | China | China Mathematical Competition | [
"Geometry > Solid Geometry > Other 3D problems",
"Geometry > Plane Geometry > Triangles > Triangle centers: centroid, incenter, circumcenter, Euler line, nine-point circle",
"Geometry > Plane Geometry > Triangles > Triangle trigonometry"
] | final answer only | null | en | |
Andriiko has unlimited amount of chips painted in 6 colours. He wants to put some of the chips in one row so that for any two different colours in that row there are two adjacent chips of those colours. What is the minimum amount of chips he can put in a row?
**Answer:** 18. | 18 | The chip of each colour has to be adjacent at least 5 times, to each of other colour. But any chip has maximum 2 neighbours, thus there is at least 3 chips of each colour in a row. Here is an example that 18 is a correct answer: 123456246325164135.
Final answer: 18 | MathNet | 0h6j | Ukraine | UkraineMO | [
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments"
] | proof and answer | null | en | |
Problem:
For any integer $x$, let
$$
f(x) = 100! \left(1 + x + \frac{x^{2}}{2!} + \frac{x^{3}}{3!} + \dots + \frac{x^{100}}{100!}\right).
$$
A positive integer $a$ is chosen such that $f(a) - 20$ is divisible by $101^{2}$. Compute the remainder when $f(a + 101)$ is divided by $101^{2}$. | 1939 | Solution:
By the binomial theorem,
$$
(a + 101)^{n} \equiv a^{n} + \binom{n}{1} a^{n - 1}101 = a^{n} + 101n a^{n - 1} \pmod {101^{2}}.
$$
Using this gives (all congruences are modulo $101^{2}$)
$$
\begin{align*}
f(a + 101) &= 100!\sum_{n = 0}^{100}\frac{(a + 101)^{n}}{n!} \\
&\equiv 100!\sum_{n = 0}^{100}\left(\frac{a... | MathNet | 0l5r | United States | HMMT February | [
"Number Theory > Modular Arithmetic > Polynomials mod p",
"Algebra > Algebraic Expressions > Sequences and Series > Sums and products"
] | proof and answer | null | en | |
Problem:
Find all ordered pairs $(a, b)$ of positive integers such that $a^{2}+b^{2}+25=15 a b$ and $a^{2}+a b+b^{2}$ is prime. | [(1,2), (2,1)] | Solution:
The only solutions are $(1,2)$ and $(2,1)$.
First, note that $a \neq b$; otherwise we have $13 a^{2}=25$ which is impossible. We can assume without loss of generality that $1 \leq a < b$; we then take $(b, a)$ as well.
If $a=1$, we get $b^{2}+26=15 b$ which yields $b=2$ or $b=13$. For $b=2$ we get $a^{2}+a ... | MathNet | 0b48 | Philippines | 25th Philippine Mathematical Olympiad | [
"Number Theory > Divisibility / Factorization > Factorization techniques",
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities"
] | proof and answer | null | en | |
Problem:
Find the number of positive divisors $d$ of $15! = 15 \cdot 14 \cdots 2 \cdot 1$ such that $\operatorname{gcd}(d, 60) = 5$. | 36 | Solution:
Since $\operatorname{gcd}(d, 60) = 5$, we know that $d = 5^{i} d^{\prime}$ for some integer $i > 0$ and some integer $d^{\prime}$ which is relatively prime to $60$. Consequently, $d^{\prime}$ is a divisor of $(15!) / 5$; eliminating common factors with $60$ gives that $d^{\prime}$ is a factor of $\left(7^{2}\... | MathNet | 0jht | United States | HMMT 2013 | [
"Number Theory > Divisibility / Factorization > Greatest common divisors (gcd)",
"Number Theory > Number-Theoretic Functions > τ (number of divisors)"
] | final answer only | null | en | |
$$
x^2(2 - x)^2 = 1 + 2(1 - x)^2.
$$ | -1, 1, 3 | Let $y = 1 - x$. Then $x(2 - x) = (1 - y)(1 + y) = 1 - y^2$, and so an equivalent version of the equation is $(1 - y^2)^2 = 1 + 2y^2$, i.e., $y^4 = 4y^2$. Thus $y = 0, \pm 2$ and $x = -1, 1, 3$.
Alternatively, the given equation could be written as $x^2(2 - x)^2 - 1 = 2(1 - x)^2$.
Using the difference of two squares, ... | MathNet | 07r9 | Ireland | Ireland_2017 | [
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations",
"Algebra > Prealgebra / Basic Algebra > Simple Equations",
"Algebra > Intermediate Algebra > Quadratic functions"
] | proof and answer | English | en | |
a) Let $a$, $b$ and $c$ be real numbers that satisfy $a^2 + b^2 + c^2 = 1$. Prove that
$$
|a - b| + |b - c| + |c - a| \le 2\sqrt{2}.
$$
b) Given 2019 real numbers $a_1, a_2, \dots, a_{2019}$ such that $a_1^2 + a_2^2 + \dots + a_{2019}^2 = 1$. Find the maximum value of
$$
S = |a_1 - a_2| + |a_2 - a_3| + \dots + |a_{201... | a) 2√2; b) 2√2018 | Using Cauchy-Schwarz inequality, we get
$$
x_1 + x_2 + \dots + x_n \le |x_1| + |x_2| + \dots + |x_n| \\
\le \sqrt{n(x_1^2 + x_2^2 + \dots + x_n^2)}.
$$
a) Without loss of generality, we can assume $a \le b \le c$ and the inequality turns out to
$$
|a - b| + |b - c| + |c - a| = (a - b) + (b - c) + (c - a) \\
= 2(a - c)... | MathNet | 0le9 | Vietnam | VMO | [
"Algebra > Equations and Inequalities > Cauchy-Schwarz",
"Algebra > Equations and Inequalities > Linear and quadratic inequalities"
] | proof and answer | English | en | |
Problem:
There are 2017 jars in a row on a table, initially empty. Each day, a nice man picks ten consecutive jars and deposits one coin in each of the ten jars. Later, Kelvin the Frog comes back to see that $N$ of the jars all contain the same positive integer number of coins (i.e. there is an integer $d>0$ such that... | 2014 | Solution:
Answer: 2014
Label the jars $1,2, \ldots, 2017$. I claim that the answer is 2014. To show this, we need both a construction and an upper bound.
For the construction, for $1 \leq i \leq 201$, put a coin in the jars $10i+1, 10i+2, \ldots, 10i+10$. After this, each of the jars $1,2, \ldots, 2010$ has exactly ... | MathNet | 0jye | United States | February 2017 | [
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Discrete Mathematics > Combinatorics > Pigeonhole principle"
] | proof and answer | null | en | |
Let $N$ be a positive integer. A cube $(2N+1) \times (2N+1) \times (2N+1)$ is made of $(2N+1)^3$ unit cubes; each unit cube is either black or white. It turned out that among any 8 unit cubes which form a cube $2 \times 2 \times 2$ the number of black unit cubes is not greater than 4. Find the greatest possible total n... | (N+1)^2(4N+1) | **Ответ.** $(N+1)^2(4N+1)$.
Let $k = (N+1)^2(4N+1)$. Introduce a coordinate system where all vertices of unit cubes have integer coordinates from $0$ to $2N+1$.
First, we present an example showing that the number of black cubes can indeed be $k$. For each cube, consider its vertex closest to the origin (its coordina... | MathNet | 0cwp | Russia | LI Всероссийская математическая олимпиада школьников | [
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments",
"Discrete Mathematics > Combinatorics > Counting two ways",
"Geometry > Solid Geometry > 3D Shapes"
] | proof and answer | Russian | en | |
Problem:
A bird thinks the number $2 n^{2}+29$ is prime for every positive integer $n$. Find a counterexample to the bird's conjecture. | 29 | Solution:
Simply taking $n=29$ works, since $2 \cdot 29^{2}+29=29(2 \cdot 29+1)=29 \cdot 59$.
Final answer: 29 | MathNet | 0jw5 | United States | Berkeley Math Circle: Monthly Contest 5 | [
"Number Theory > Divisibility / Factorization > Prime numbers",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | proof and answer | null | en | |
An $8 \times 8$ array is divided into 64 unit squares. In some of the unit squares a diagonal is drawn, such that no two diagonals share a common point – not even an endpoint. Find the maximum number of diagonals that can be drawn under these circumstances. | 36 | Look at two contiguous rows of a $2n \times 2n$ array, containing $k$ diagonals in the cells of row $A$ and $\ell$ diagonals in the cells of row $B$. The ends of these diagonals on the separating line of the two rows have to be distinct points, and they can only occupy at most the $2n + 1$ available positions, therefor... | MathNet | 0b87 | Romania | NMO Selection Tests for the Junior Balkan Mathematical Olympiad | [
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments",
"Discrete Mathematics > Combinatorics > Pigeonhole principle"
] | proof and answer | English | en | |
Problem:
Let $D$ be the set of divisors of $100$. Let $Z$ be the set of integers between $1$ and $100$, inclusive. Mark chooses an element $d$ of $D$ and an element $z$ of $Z$ uniformly at random. What is the probability that $d$ divides $z$? | 217/900 | Solution:
The answer is $\frac{217}{900}$.
As $100 = 2^{2} \cdot 5^{2}$, there are $3 \cdot 3 = 9$ divisors of $100$, so there are $900$ possible pairs of $d$ and $z$ that can be chosen.
If $d$ is chosen, then there are $\frac{100}{d}$ possible values of $z$ such that $d$ divides $z$, so the total number of valid pa... | MathNet | 0jld | United States | HMMT 2014 | [
"Number Theory > Number-Theoretic Functions > σ (sum of divisors)",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | proof and answer | null | en | |
Alice and Bob are given an integer $n \ge 2$ and a token to play the following game. Initially, Alice chooses an order of the numbers $1, 2, \dots, n$, and writes them down in a row, in that order, on a sheet of paper. Next, Bob chooses one of these numbers and places the token on that number. Continuing, Alice moves t... | n ≡ 0 or 3 (mod 4) | Alice has a winning strategy if and only if $n$ is congruent to $0$ or $-1$ modulo $4$.
Looking upon placing the token on a number as a one unit drop of that number, a move is possible if and only if the current position of the token is not flanked by two zeroes. Notice that each player places the token on positions o... | MathNet | 0c66 | Romania | SELECTION TESTS FOR THE 2019 BMO AND IMO | [
"Discrete Mathematics > Combinatorics > Games / greedy algorithms",
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Discrete Mathematics > Combinatorics > Counting two ways",
"Algebra > Algebraic Expressions > Sequences and Series > Recurrence relations"
] | proof and answer | English | en | |
Find the smallest value of
$$
xy + yz + zx + \frac{1}{x} + \frac{2}{y} + \frac{5}{z},
$$
where $x, y, z$ are positive real numbers. | 3*36^(1/3) | Answer: $3 \cdot \sqrt[3]{36}$.
Using AM-GM inequality, we get
$$
\begin{aligned}
yx + \frac{1}{3x} + \frac{1}{2y} &\ge 3\sqrt[3]{\frac{1}{6}}, \\
yz + \frac{3}{2y} + \frac{3}{z} &\ge 3\sqrt[3]{\frac{9}{2}}, \\
zx + \frac{2}{z} + \frac{2}{3x} &\ge 3\sqrt[3]{\frac{4}{3}}.
\end{aligned}
$$
Side by side sum of these three... | MathNet | 0gtj | Turkey | Team Selection Test | [
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean"
] | proof and answer | null | en | |
Find all integral solutions of the equation $x^3 - y^3 = 3xy + 1$. | All integer pairs (x, y) of the form (n+1, n) for any integer n, together with the pair (-1, 1). | First assume $x > y$. Then $3xy + 1 = x^3 - y^3 = (x-y)(x^2 + xy + y^2) \ge (x-y) \cdot 3xy$. Thus $3xy = x^3 - y^3 - 1 \ge 1 - 1 = 0$ because $x > y$. If $3xy > 0$, then $3xy \ge 3$, hence the inequality $3xy + 1 \ge (x-y) \cdot 3xy$ derived above implies $x-y = 1$. If $3xy = 0$, then either $x = 0$ or $y = 0$ and in ... | MathNet | 04zy | Estonia | Selected Problems from the Final Round of National Olympiad | [
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities",
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | proof and answer | English | en | |
Problem:
Andrea flips a fair coin repeatedly, continuing until she either flips two heads in a row (the sequence $H H$) or flips tails followed by heads (the sequence $T H$). What is the probability that she will stop after flipping $H H$? | 1/4 | Solution:
The only way that Andrea can ever flip $H H$ is if she never flips $T$, in which case she must flip two heads immediately at the beginning. This happens with probability $\frac{1}{4}$.
Final answer: 1/4 | MathNet | 0icq | United States | Harvard-MIT Mathematics Tournament | [
"Statistics > Probability > Counting Methods > Other"
] | proof and answer | null | en | |
Problem:
A classroom consists of a $5 \times 5$ array of desks, to be filled by anywhere from $0$ to $25$ students, inclusive. No student will sit at a desk unless either all other desks in its row or all others in its column are filled (or both). Considering only the set of desks that are occupied (and not which stude... | 962 | Solution:
The set of empty desks must be of the form (non-full rows) $\times$ (non-full columns): each empty desk is in a non-full column and a non-full row, and the given condition implies that each desk in such a position is empty. So if there are fewer than $25$ students, then both of these sets are nonempty; we hav... | MathNet | 0idy | United States | Harvard-MIT Mathematics Tournament | [
"Discrete Mathematics > Combinatorics > Recursion, bijection"
] | proof and answer | null | en | |
Three positive integers are written on a blackboard. Per move one replaces the set of these numbers by the new set in accordance with the following rule: each number of the set is replaced by the quotient of the sum of the squares of two other numbers and this number.
What is the maximum value of the sum of the initial... | 63 | Let $a_0, b_0, c_0$ be the initial numbers on the blackboard, and $a_i, b_i, c_i$ be the numbers written on the blackboard after the $i$-th move; let $S(a_0, b_0, c_0)$ and $S(a_i, b_i, c_i)$ be the sums of these numbers, respectively. Then after the $i+1$-th move we obtain the following numbers
$$
a_{i+1} = \frac{b_i^... | MathNet | 01tp | Belarus | 66th Belarusian Mathematical Olympiad | [
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean"
] | proof and answer | English | en | |
Problem:
Jacob rolls two fair six-sided dice. If the outcomes of these dice rolls are the same, he rolls a third fair six-sided die. Compute the probability that the sum of outcomes of all the dice he rolls is even. | 5/12 | Solution:
There's a $\frac{1}{2} - \frac{1}{6} = \frac{1}{3}$ probability that he rolls an even number without getting doubles: whatever the first roll is, there is a $\frac{1}{2}$ chance that the second roll is of opposite parity, and we subtract the $\frac{1}{6}$ chance that the second roll is the same.
There's a $... | MathNet | 0l66 | United States | HMMT February | [
"Statistics > Probability > Counting Methods > Other"
] | final answer only | null | en | |
Problem:
Let $R$ be the region in the Cartesian plane of points $(x, y)$ satisfying $x \geq 0$, $y \geq 0$, and $x+y+\lfloor x\rfloor+\lfloor y\rfloor \leq 5$. Determine the area of $R$. | 9/2 | Solution:
We claim that a point in the first quadrant satisfies the desired property if the point is below the line $x+y=3$ and does not satisfy the desired property if it is above the line.
To see this, for a point inside the region, $x+y<3$ and $\lfloor x\rfloor+\lfloor y\rfloor \leq x+y<3$. However, $\lfloor x\rflo... | MathNet | 0jh7 | United States | HMMT 2013 | [
"Algebra > Algebraic Expressions > Sequences and Series > Floors and ceilings",
"Algebra > Equations and Inequalities > Linear and quadratic inequalities",
"Geometry > Plane Geometry > Analytic / Coordinate Methods > Cartesian coordinates"
] | proof and answer | null | en | |
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that
$$
2 f(x) = f(x + y) + f(x + 2y)
$$
for all $x \in \mathbb{R}$ and for all $y \geq 0$. | All constant functions | Without loss of generality, we may assume that $f(0) = 0$. Let $y > 0$ and $n$ a positive integer. For $x = n y$ we get
$$
2 f(n y) = f((n + 1) y) + f((n + 2) y).
$$
The sequence $a_n = f(n y), n = 0, 1, 2, \ldots$, satisfies the second order linear recursive relation
$$
a_{n+2} = -a_{n+1} + 2 a_n
$$
with $a_0 = f(0) =... | MathNet | 0czk | Saudi Arabia | Saudi Arabia Mathematical Competitions | [
"Algebra > Algebraic Expressions > Functional Equations",
"Algebra > Algebraic Expressions > Sequences and Series > Recurrence relations"
] | proof and answer | English | en | |
If $4350$ is written as a product of its prime factors, then the largest prime factor is
(A) $5$ (B) $13$ (C) $19$ (D) $29$ (E) $31$ | D | Clearly $4350$ is divisible by $5$, since the last two digits are $50$. It is also divisible by $3$, since the sum of the digits is divisible by $3$. Dividing by $150$ gives a quotient of $29$, which is prime, so the prime factorization is $4350 = 2 \times 3 \times 5^2 \times 29$, and the largest prime factor is $29$.
... | MathNet | 0epr | South Africa | South African Mathematics Olympiad | [
"Number Theory > Divisibility / Factorization > Prime numbers",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | MCQ | English | en | |
Problem:
Let $m > 1$ be a fixed positive integer. For a nonempty string of base-ten digits $S$, let $c(S)$ be the number of ways to split $S$ into contiguous nonempty strings of digits such that the base-ten number represented by each string is divisible by $m$. These strings are allowed to have leading zeroes.
In term... | 0 and 2^n for all nonnegative integers n | Solution:
Answer: $0$ and $2^{n}$ for all nonnegative integer $n$
First, we note that $c(1) = 0$ and $c(00 \ldots 0) = 2^{n-1}$ if there are $n$ zeroes in the string. Now we show that these are the only possibilities. Note that a split can be added if and only if the string before this split (ignoring all other splits... | MathNet | 0k0z | United States | HMIC 2018 | [
"Number Theory > Divisibility / Factorization",
"Number Theory > Modular Arithmetic"
] | proof and answer | null | en | |
Let $\triangle ABC$ be a triangle with integer side lengths and the property that $\angle B = 2\angle A$. What is the least possible perimeter of such a triangle?
(A) 13 (B) 14 (C) 15 (D) 16 (E) 17 | C | Let $a$, $b$, and $c$ be the lengths of the sides opposite vertices $A$, $B$, and $C$, respectively. Note that $a < b$. Applying the Law of Sines in $\triangle ABC$, together with the identities $\sin B = \sin(2A) = 2 \sin A \cos A$ and
$$
\sin C = \sin(\pi - 3A) = \sin(3A) = (\sin A)(-1 + 4\cos^2 A),
$$
give
$$
\frac{... | MathNet | 0l0v | United States | 2024 AMC 12 B | [
"Geometry > Plane Geometry > Triangles > Triangle trigonometry",
"Geometry > Plane Geometry > Geometric Inequalities > Triangle inequalities",
"Number Theory > Divisibility / Factorization > Greatest common divisors (gcd)",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | MCQ | null | en | |
Problem:
Let $P(x)$ be a quadratic polynomial with real coefficients. Suppose that $P(1)=20$, $P(-1)=22$, and $P(P(0))=400$. Compute the largest possible value of $P(10)$. | 2486 | Solution:
Let $P(x) = a x^{2} + b x + c$. The given equations give us:
$$
\begin{aligned}
& a + b + c = 20 \\
& a - b + c = 22
\end{aligned}
$$
Hence $b = -1$, $a + c = 21$, and so the final equation gives us $a c^{2} = 400$. Substituting $a = 21 - c$ and solving the cubic in $c$, we get $c = -4, 5, 20$. Of these, the ... | MathNet | 0kpx | United States | HMMT November 2022 | [
"Algebra > Algebraic Expressions > Polynomials",
"Algebra > Intermediate Algebra > Quadratic functions"
] | proof and answer | null | en | |
Find all pairs $(a; b)$ of integers $a$ and $b$ satisfying the equality $(b^2 + 7(a - b))^2 = a^3 b$. | All pairs with a equal to b for any integer, plus the pairs (-18, -2), (12, 3), and (0, 7). | Answer: $a = b = t$, $t \in \mathbb{Z}$, $(a; b) = (-18; -2)$, $(a; b) = (0; 7)$, $(a; b) = (12; 3)$.
We rearrange the initial equation $(b^2 + 7(a-b))^2 = a^3 b$:
$$
\begin{align*}
(b^2 + 7(a-b))^2 &= a^3 b \Leftrightarrow b^4 + 14b^2(a-b) + 49(a-b)^2 = a^3 b \Leftrightarrow \\
&\qquad a^3 b - b^4 - 14b^2(a-b) - 49(a... | MathNet | 01qs | Belarus | Final Round | [
"Number Theory > Diophantine Equations > Techniques: modulo, size analysis, order analysis, inequalities",
"Algebra > Intermediate Algebra > Quadratic functions",
"Number Theory > Divisibility / Factorization > Factorization techniques"
] | proof and answer | English | en | |
Problem:
Let $n \geq 3$ be a positive integer and $M$ be the set of the first $n$ prime numbers. For every nonempty subset $X$ of $M$ denote by $P(X)$ the product of the elements of $X$. Let $N$ be a set of fractions of the form $\frac{P(A)}{P(B)}$, where $A \subset M$, $B \subset M$, $A \cap B = \varnothing$ such that... | Maximum size equals 3n−2 for n in {3, 4, 5, 6}, and equals 3n−3 for all n at least 7. | Solution:
Consider the following three element sets
$$
\begin{aligned}
N_{1} & = \left\{ \frac{p_{3} p_{4} \ldots p_{n-1}}{p_{1}}, \frac{p_{2} p_{3} \ldots p_{n-1}}{p_{1}}, \frac{p_{2} p_{3} \ldots p_{n-1} p_{n}}{p_{1}} \right\} \\
N_{2} & = \left\{ \frac{p_{1} p_{4} \ldots p_{n-1}}{p_{2}}, \frac{p_{1} p_{3} \ldots p_{... | MathNet | 0387 | Bulgaria | Team selection test for 47. IMO | [
"Number Theory > Divisibility / Factorization > Factorization techniques",
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments",
"Discrete Mathematics > Combinatorics > Pigeonhole principle"
] | proof and answer | null | en | |
Problem:
Let $ABC$ be an equilateral triangle of side length $1$. For a real number $0 < x < 0.5$, let $A_1$ and $A_2$ be the points on side $BC$ such that $A_1B = A_2C = x$, and let $T_A = \triangle AA_1A_2$. Construct triangles $T_B = \triangle BB_1B_2$ and $T_C = \triangle CC_1C_2$ similarly.
There exist positive ... | (8, 2) | Solution:
Notice that the given expression is defined and continuous not only on $0 < x < 0.5$, but also on $0 \leq x \leq 0.5$. Let $f(x)$ be the function representing the area of the (possibly degenerate) hexagon for $x \in [0, 0.5]$. Since $f(x)$ is equal to the given expression over $(0, 0.5)$, we can conclude tha... | MathNet | 0k4h | United States | HMMT February | [
"Geometry > Plane Geometry > Triangles",
"Geometry > Plane Geometry > Miscellaneous > Constructions and loci"
] | proof and answer | null | en | |
What is the number of ordered triples $(a, b, c)$ of positive integers, with $a \le b \le c \le 9$, such that there exists a (non-degenerate) triangle $\triangle ABC$ with an integer inradius for which $a, b$, and $c$ are the lengths of the altitudes from $A$ to $\overline{BC}$, $B$ to $\overline{AC}$, and $C$ to $\ove... | B | Let $x, y$, and $z$ be the lengths of $\overline{BC}$, $\overline{AC}$, and $\overline{AB}$, respectively. Let $r$ be the inradius of $\triangle ABC$. Then
$$
\text{Area}(\triangle ABC) = \frac{1}{2}xa = \frac{1}{2}yb = \frac{1}{2}zc = \frac{1}{2}(x + y + z)r.
$$
Therefore $x = \frac{2\text{Area}(\triangle ABC)}{a}$, $... | MathNet | 0l14 | United States | 2024 AMC 12 B | [
"Geometry > Plane Geometry > Triangles > Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle",
"Geometry > Plane Geometry > Triangles > Triangle inequalities",
"Algebra > Prealgebra / Basic Algebra > Fractions"
] | MCQ | null | en | |
Let $X$ be a set of 56 elements. Find the least positive integer $n$ such that for any 15 subsets of $X$, if the union of every 7 sets of these subsets contains at least $n$ elements, then there exist 3 of the 15 subsets whose intersection is nonempty. (posed by Leng Gangsong) | 41 | Suppose there exist 15 subsets of $X$, the union of every 7 of these 15 subsets contains at least 41 elements, and there exists no 3 of the 15 subsets whose intersection is nonempty.
Since every element of $X$ can only belong 2 of the 15 subsets, we can suppose that every element of $X$ belongs to exactly 2 of the 15 s... | MathNet | 03t6 | China | China Mathematical Olympiad | [
"Discrete Mathematics > Combinatorics > Pigeonhole principle",
"Discrete Mathematics > Combinatorics > Counting two ways",
"Discrete Mathematics > Combinatorics > Inclusion-exclusion",
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments"
] | proof and answer | English | en | |
Find the greatest real $K$ such that for every positive $u$, $v$ and $w$ with $u^2 > 4vw$, the inequality
$$
(u^2 - 4vw)^2 > K(2v^2 - uw)(2w^2 - uv)
$$
holds. Justify your claim. | 16 | The greatest $K$ is $16$.
We first prove the inequality when $K = 16$. Note that
$$
\begin{aligned}
u^2 - 4vw &= u^2 + 2vw - 6vw \\
&\ge u^2 + 2vw - 3(v^2 + w^2) \\
&= u^2 + (v+w)^2 - 4(v^2 + w^2) \\
&\ge 2u(v+w) - 4(v^2 + w^2) \\
&= 2(uw - 2v^2) + (uv - 2w^2).
\end{aligned}
$$
If $uw - 2v^2$ and $uv - 2w^2$ have diff... | MathNet | 06do | Hong Kong | CHKMO | [
"Algebra > Equations and Inequalities > QM-AM-GM-HM / Power Mean",
"Algebra > Equations and Inequalities > Linear and quadratic inequalities"
] | proof and answer | null | en | |
Five numbers $1$, $2$, $3$, $4$, $5$ are written on a blackboard. A student may erase any two of the numbers $a$ and $b$ on the board and write the numbers $a+b$ and $ab$ replacing them. If this operation is repeatedly performed, can the numbers $21$, $27$, $64$, $180$, $540$ ever appear on the board at the same time? | No | No. We consider the numbers modulo $3$.
* If $3 \mid a, b$, then $3 \mid a + b$ and $3 \mid ab$. The number of multiples of $3$ remains unchanged.
* If $3 \mid a$ and $3 \nmid b$, then $3 \nmid a + b$ and $3 \mid ab$. The number of multiples of $3$ remains unchanged.
* If $a \equiv b \equiv \pm 1 \pmod{3}$, then $3 \nm... | MathNet | 06bz | Hong Kong | IMO HK TST | [
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Number Theory > Modular Arithmetic"
] | proof and answer | null | en | |
Problem:
Find the largest integer $n$ such that $3^{512}-1$ is divisible by $2^{n}$. | 11 | Solution:
Write
$$
\begin{aligned}
3^{512}-1 & =\left(3^{256}+1\right)\left(3^{256}-1\right)=\left(3^{256}+1\right)\left(3^{128}+1\right)\left(3^{128}-1\right) \\
& =\cdots=\left(3^{256}+1\right)\left(3^{128}+1\right) \cdots(3+1)(3-1)
\end{aligned}
$$
Now each factor $3^{2^{k}}+1$, $k \geq 1$, is divisible by just one ... | MathNet | 0ibu | United States | Harvard-MIT Mathematics Tournament | [
"Number Theory > Divisibility / Factorization > Factorization techniques",
"Number Theory > Modular Arithmetic > Polynomials mod p"
] | proof and answer | null | en | |
How many integers $k$ are there for which $1 \le k \le n$ and the sum $1 + 2 + \dots + k$ is divisible by $n$, if
a) $n = 2023^{2024}$;
b) $n = 2024^{2023}$? | a) 4; b) 3 | Note that $1+2+\dots+k = \frac{k(k+1)}{2}$.
a) Since $n$ is odd, the number $\frac{k(k+1)}{2}$ is divisible by $n$ if and only if $k(k+1)$ is divisible by $n$.
Since $2023 = 7 \cdot 17^2$, the number $n$ can be expressed as $p_1^{\alpha_1} p_2^{\alpha_2}$, where $p_1 = 7$, $p_2 = 17$ and $\alpha_1, \alpha_2$ are posi... | MathNet | 05bk | Estonia | Estonian Mathematical Olympiad | [
"Number Theory > Modular Arithmetic > Chinese remainder theorem",
"Number Theory > Divisibility / Factorization > Greatest common divisors (gcd)",
"Algebra > Algebraic Expressions > Sequences and Series > Sums and products"
] | proof and answer | English | en | |
Find all possible values of a real number $a$ such that there exist pairwise distinct nonzero real numbers $x, y, z$ satisfying the equalities
$$
x - \frac{y}{z} - \frac{z}{y} = y - \frac{z}{x} - \frac{x}{z} = z - \frac{x}{y} - \frac{y}{x} = a.
$$ | 1 | Answer: $a = 1$.
Let $A = x - \frac{y}{z} - \frac{z}{y}$, $B = y - \frac{z}{x} - \frac{x}{z}$, and $C = z - \frac{x}{y} - \frac{y}{x}$. By condition, it follows that
$$
0 = A - B = (x - y) + \frac{x - y}{z} - \frac{z(x - y)}{xy} = (x - y) \left( 1 + \frac{1}{z} - \frac{z}{xy} \right) = \frac{(x - y)(xyz + xy - z^2)}{x... | MathNet | 01ub | Belarus | Belarusian Mathematical Olympiad | [
"Algebra > Prealgebra / Basic Algebra > Simple Equations",
"Algebra > Intermediate Algebra > Other"
] | proof and answer | English | en | |
Problem:
A positive integer is called sparkly if it has exactly 9 digits, and for any $n$ between $1$ and $9$ (inclusive), the $n^{\text{th}}$ digit is a positive multiple of $n$. How many positive integers are sparkly? | 216 | Solution:
For each $n = 1, 2, \ldots, 9$ there are $\lfloor 9 / n \rfloor$ different possibilities for the $n^{\mathrm{th}}$ digit. For example, there are $\lfloor 9 / 2 \rfloor = 4$ possible choices for the second digit (these being $2, 4, 6$ and $8$). Therefore the answer is
$$
\left\lfloor \frac{9}{1} \right\rfloor ... | MathNet | 0a4k | New Zealand | New Zealand Mathematical Olympiad | [
"Discrete Mathematics > Other",
"Algebra > Prealgebra / Basic Algebra > Integers"
] | proof and answer | null | en | |
Find the least $k$ satisfying the following condition: for any polynomial $f(x)$ of degree $100$ with real coefficients there exists a polynomial $g(x)$ of degree not greater than $k$ with real coefficients such that the graphs $y = f(x)$ and $y = g(x)$ have exactly $100$ common points. | 98 | **Answer.** $98$.
Set $n = 100$.
1. We will show how to construct a polynomial $g$ of degree at most $n-2$ for a given polynomial $f$ of degree $n$. Multiplying $f$ by a nonzero constant doesn't change the condition (we can multiply $g$ by the same constant), so we assume the leading coefficient of $f$ is $1$, i.e., ... | MathNet | 0cwk | Russia | LI Всероссийская математическая олимпиада школьников | [
"Algebra > Algebraic Expressions > Polynomials > Vieta's formulas",
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations"
] | proof and answer | Russian | en | |
Let $ABCDEF$ be a regular hexagon of side length $1$, and $O$ be the centre of the hexagon. In addition to the sides of the hexagon, line segments are drawn from $O$ to each vertex, making a total of twelve unit line segments. Find the number of paths of length $2003$ along these line segments that start at $O$ and ter... | (7 - sqrt(7))/14 * (1 + sqrt(7))^2003 + (7 + sqrt(7))/14 * (1 - sqrt(7))^2003 | The answer is $\frac{7 - \sqrt{7}}{14}(1 + \sqrt{7})^{2003} + \frac{7 + \sqrt{7}}{14}(1 - \sqrt{7})^{2003}$.
For each integer $n \ge 0$, let $a_n$ be the number of paths of length $n$ starting at $O$ and terminating at $O$. Also, let $b_n$ be the number of paths of length $n$ starting at $O$ and terminating at $A$. By... | MathNet | 06dp | Hong Kong | CHKMO | [
"Discrete Mathematics > Combinatorics > Recursion, bijection",
"Algebra > Algebraic Expressions > Sequences and Series > Recurrence relations"
] | proof and answer | null | en | |
Problem:
Suppose $P(x)$ is a monic polynomial of degree $2023$ such that
$$
P(k) = k^{2023} P\left(1 - \frac{1}{k}\right)
$$
for every positive integer $1 \leq k \leq 2023$. Then $P(-1) = \frac{a}{b}$, where $a$ and $b$ are relatively prime integers. Compute the unique integer $0 \leq n < 2027$ such that $b n - a$ is ... | 406 | Solution:
Let $n = 2023$. If $P(x) = x^{n} + a_{n-1} x^{n-1} + \cdots + a_{0}$, then let
$$
R(x) = x^{n} P\left(1 - \frac{1}{x}\right) = (x-1)^{n} + a_{n-1}(x-1)^{n} x + \cdots + a_{0} x^{n}
$$
Then, note that $Q(x) = P(x) - R(x)$ is a polynomial of degree at most $n$, and it has roots $1, 2, \ldots, n$, so we have $Q... | MathNet | 0kto | United States | HMMT February 2022 | [
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations",
"Number Theory > Modular Arithmetic > Fermat / Euler / Wilson theorems"
] | proof and answer | null | en | |
Determine the largest positive integer $n$ such that
$$
n + 5 \mid n^4 + 1395.
$$ | 2015 | Let $d = n + 5$. Then $d \mid n^4 + 1395$.
We have $n = d - 5$, so
$$
n^4 + 1395 = (d - 5)^4 + 1395.
$$
Expand $(d - 5)^4$:
$$
(d - 5)^4 = d^4 - 4d^3 \cdot 5 + 6d^2 \cdot 25 - 4d \cdot 125 + 625 = d^4 - 20d^3 + 150d^2 - 500d + 625.
$$
So
$$
n^4 + 1395 = d^4 - 20d^3 + 150d^2 - 500d + 625 + 1395 = d^4 - 20d^3 + 150d^2 -... | MathNet | 04iz | Croatia | Croatia Mathematical Competitions | [
"Number Theory > Divisibility / Factorization",
"Algebra > Algebraic Expressions > Polynomials > Polynomial operations"
] | proof and answer | null | en | |
Problem:
On a $3 \times 3$ chessboard, each square contains a knight with $\frac{1}{2}$ probability. What is the probability that there are two knights that can attack each other? (In chess, a knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular... | 209/256 | Solution:
Notice that a knight on the center square cannot attack any other square on the chessboard, so whether it contains a knight or not is irrelevant.
For ease of reference, we label the other eight squares as follows:
| 0 | 5 | 2 |
| :---: | :---: | :---: |
| 3 | X | 7 |
| 6 | 1 | 4 |
Notice that a knight in ... | MathNet | 0jwx | United States | HMMT November | [
"Discrete Mathematics > Combinatorics > Enumeration with symmetry"
] | proof and answer | null | en | |
If $m$ and $n$ are positive integers, can the number $m^4 + 2mn + n^2 - 2021$ be the product of three or more consecutive integers? | No | Answer: No.
Suppose that $N = m^4 + 2mn + n^2 - 2021$ is the product of three or more consecutive integers. Then $N$ and $m^4 - m^2 = m[(m-1)m(m+1)]$ are divisible by $3$. Thus $(m+n)^2 \equiv N - (m^4 - m^2) + 2021 \equiv 2 \pmod{3}$, which is a contradiction, since $2$ is not a quadratic residue modulo $3$.
Final an... | MathNet | 09ho | Mongolia | Round 3 | [
"Number Theory > Residues and Primitive Roots > Quadratic residues",
"Number Theory > Divisibility / Factorization"
] | proof and answer | null | en | |
2012 people stand in a line. Each of them is either a knight (and always tells truth) or a knave (and always lies). Each of the people announced: «There are more knaves on my left than knights on my right». How many knaves are in the line? | 1006 | Нехай у шерензі стоять $b$ брехунів та $r$ лицарів. Оскільки найлівіший з лицарів сказав правду, маємо $b > r - 1$. Оскільки найправіший з брехунів збрехав, то маємо $b - 1 \le r$. Отже, $r = b$ або $r = b - 1$. Другий випадок неможливий, оскільки загальна кількість людей парна. Тому $r = b = 1006$.
*Відповідь:* 1006 ... | MathNet | 0h3e | Ukraine | Ukrainian Mathematical Olympiad | [
"Discrete Mathematics > Combinatorics > Coloring schemes, extremal arguments",
"Discrete Mathematics > Combinatorics > Invariants / monovariants",
"Discrete Mathematics > Logic"
] | proof and answer | English | en |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 37