This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 15460

Mid-Michigan MO, Grades 10-12, 2023

[b]p1.[/b] There are $16$ students in a class. Each month the teacher divides the class into two groups. What is the minimum number of months that must pass for any two students to be in different groups in at least one of the months? [b]p2.[/b] Find all functions $f(x)$ defined for all real $x$ that satisfy the equation $2f(x) + f(1 - x) = x^2$. [b]p3.[/b] Arrange the digits from $1$ to $9$ in a row (each digit only once) so that every two consecutive digits form a two-digit number that is divisible by $7$ or $13$. [b]p4.[/b] Prove that $\cos 1^o$ is irrational. [b]p5.[/b] Consider $2n$ distinct positive Integers $a_1,a_2,...,a_{2n}$ not exceeding $n^2$ ($n>2$). Prove that some three of the differences $a_i- a_j$ are equal . PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2021 Belarusian National Olympiad, 8.6

For four pairwise different positive integers $a,b,c$ and $d$ six numbers are calculated: $ab+10$,$ac+10$,$ad+10$,$bc+10$,$bd+10$ and $cd+10$. Find the maximum amount of them which can be perfect squares.

2003 APMO, 3

Let $k\ge 14$ be an integer, and let $p_k$ be the largest prime number which is strictly less than $k$. You may assume that $p_k\ge 3k/4$. Let $n$ be a composite integer. Prove: (a) if $n=2p_k$, then $n$ does not divide $(n-k)!$; (b) if $n>2p_k$, then $n$ divides $(n-k)!$.

2018 Romania National Olympiad, 1

Prove that there are infinitely many sets of four positive integers so that the sum of the squares of any three elements is a perfect square.

2021 JBMO Shortlist, N2

The real numbers $x, y$ and $z$ are such that $x^2 + y^2 + z^2 = 1$. a) Determine the smallest and the largest possible values of $xy + yz - xz$. b) Prove that there does not exist a triple $(x, y, z)$ of rational numbers, which attains any of the two values in a).

MathLinks Contest 5th, 1.1

Find all pairs of positive integers $x, y$ such that $x^3 - y^3 = 2005(x^2 - y^2)$.

2022 VJIMC, 4

Let $g$ be the multiplicative function given by $$g(p^{\alpha}) = \alpha p^{\alpha-1},$$ for all $\alpha\in\mathbb Z^+$ and primes $p$. Prove that there exist infinitely many integers $n$ such that $$g(n+1) = g(n) + g(1).$$

2023 Malaysia IMONST 2, 1

Prove that there exist infinitely many positive integers with the following properties: - it can be written as the sum of $2001$ distinct positive integers, - it can be written as the sum of $2023$ distinct positive perfect cubes

2020 Switzerland - Final Round, 5

Find all the positive integers $a, b, c$ such that $$a! \cdot b! = a! + b! + c!$$

2017 China Team Selection Test, 5

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

2017 All-Russian Olympiad, 3

There are $n$ positive real numbers on the board $a_1,\ldots, a_n$. Someone wants to write $n$ real numbers $b_1,\ldots,b_n$,such that: $b_i\geq a_i$ If $b_i \geq b_j$ then $\frac{b_i}{b_j}$ is integer. Prove that it is possible to write such numbers with the condition $$b_1 \cdots b_n \leq 2^{\frac{n-1}{2}}a_1\cdots a_n.$$

1999 Spain Mathematical Olympiad, 4

A box contains $900$ cards, labeled from $100$ to $999$. Cards are removed one at a time without replacement. What is the smallest number of cards that must be removed to guarantee that the labels of at least three removed cards have equal sums of digits?

2010 Indonesia TST, 4

Prove that for all integers $ m$ and $ n$, the inequality \[ \dfrac{\phi(\gcd(2^m \plus{} 1,2^n \plus{} 1))}{\gcd(\phi(2^m \plus{} 1),\phi(2^n \plus{} 1))} \ge \dfrac{2\gcd(m,n)}{2^{\gcd(m,n)}}\] holds. [i]Nanang Susyanto, Jogjakarta [/i]

1987 China Team Selection Test, 2

Find all positive integer $n$ such that the equation $x^3+y^3+z^3=n \cdot x^2 \cdot y^2 \cdot z^2$ has positive integer solutions.

2012 CHMMC Fall, 1

Find the remainder when $5^{2012}$ is divided by $3$.

2015 Princeton University Math Competition, A5

Given that there are $24$ primes between $3$ and $100$, inclusive, what is the number of ordered pairs $(p, a)$ with $p$ prime, $3 \le p < 100$, and $1 \le a < p$ such that the sum \[a+a^2+a^3+\cdots+a^{(p-2)!} \]is not divisible by $p$?

1991 Bulgaria National Olympiad, Problem 3

Prove that for every prime number $p\ge5$, (a) $p^3$ divides $\binom{2p}p-2$; (b) $p^3$ divides $\binom{kp}p-k$ for every natural number $k$.

1987 IMO Longlists, 1

Let $x_1, x_2,\cdots, x_n$ be $n$ integers. Let $n = p + q$, where $p$ and $q$ are positive integers. For $i = 1, 2, \cdots, n$, put \[S_i = x_i + x_{i+1} +\cdots + x_{i+p-1} \text{ and } T_i = x_{i+p} + x_{i+p+1} +\cdots + x_{i+n-1}\] (it is assumed that $x_{i+n }= x_i$ for all $i$). Next, let $m(a, b)$ be the number of indices $i$ for which $S_i$ leaves the remainder $a$ and $T_i$ leaves the remainder $b$ on division by $3$, where $a, b \in \{0, 1, 2\}$. Show that $m(1, 2)$ and $m(2, 1)$ leave the same remainder when divided by $3.$

1997 Federal Competition For Advanced Students, Part 2, 2

A positive integer $K$ is given. Define the sequence $(a_n)$ by $a_1 = 1$ and $a_n$ is the $n$-th positive integer greater than $a_{n-1}$ which is congruent to $n$ modulo $K$. [b](a)[/b] Find an explicit formula for $a_n$. [b](b)[/b] What is the result if $K = 2$?

2020 China Northern MO, BP3

Are there infinitely many positive integers $n$ such that $19|1+2^n+3^n+4^n$? Justify your claim.

1992 ITAMO, 3

Prove that for each $n \ge 3$ there exist $n$ distinct positive divisors $d_1,d_2, ...,d_n$ of $n!$ such that $n! = d_1 +d_2 +...+d_n$.

2005 Romania National Olympiad, 3

Prove that for all positive integers $n$ there exists a single positive integer divisible with $5^n$ which in decimal base is written using $n$ digits from the set $\{1,2,3,4,5\}$.

2019 Peru IMO TST, 4

Let $k\geq 0$ an integer. The sequence $a_0,\ a_1,\ a_2, \ a_3, \ldots$ is defined as follows: [LIST] [*] $a_0=k$ [/*] [*] For $n\geq 1$, we have that $a_n$ is the smallest integer greater than $a_{n-1}$ so that $a_n+a_{n-1}$ is a perfect square. [/*] [/LIST] Prove that there are exactly $\left \lfloor{\sqrt{2k}} \right \rfloor$ positive integers that cannot be written as the difference of two elements of such a sequence. [i]Note.[/i] If $x$ is a real number, $\left \lfloor{x} \right \rfloor$ denotes the greatest integer smaller or equal than $x$.

2021 Czech and Slovak Olympiad III A, 4

Find all natural numbers $n$ for which equality holds $n + d (n) + d (d (n)) +... = 2021$, where $d (0) = d (1) = 0$ and for $k> 1$, $ d (k)$ is the [i]superdivisor [/i] of the number $k$ (i.e. its largest divisor of $d$ with property $d <k$). (Tomáš Bárta)

2009 AMC 12/AHSME, 22

A regular octahedron has side length $ 1$. A plane parallel to two of its opposite faces cuts the octahedron into the two congruent solids. The polygon formed by the intersection of the plane and the octahedron has area $ \frac {a\sqrt {b}}{c}$, where $ a$, $ b$, and $ c$ are positive integers, $ a$ and $ c$ are relatively prime, and $ b$ is not divisible by the square of any prime. What is $ a \plus{} b \plus{} c$? $ \textbf{(A)}\ 10\qquad \textbf{(B)}\ 11\qquad \textbf{(C)}\ 12\qquad \textbf{(D)}\ 13\qquad \textbf{(E)}\ 14$