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

1996 Polish MO Finals, 1

Find all pairs $(n,r)$ with $n$ a positive integer and $r$ a real such that $2x^2+2x+1$ divides $(x+1)^n - r$.

2016 Kosovo National Mathematical Olympiad, 3

Show that the sum $S=5+5^2+5^3+…+5^{2016}$ is divisible by $31$

2019 Czech and Slovak Olympiad III A, 3

Let $a,b,c,n$ be positive integers such that the following conditions hold (i) numbers $a,b,c,a+b+c$ are pairwise coprime, (ii) number $(a+b)(b+c)(c+a)(a+b+c)(ab+bc+ca)$ is a perfect $n$-th power. Prove, that the product $abc$ can be expressed as a difference of two perfect $n$-th powers.

2004 Junior Balkan Team Selection Tests - Moldova, 4

Different non-zero natural numbers a$_1, a_2,. . . , a_{12}$ satisfy the condition: all positive differences other than two numbers $a_i$ and $a_j$ form many $20$ consecutive natural numbers. a) Show that $\max \{a_1, a_2,. . . , a_{12}\} - \min \{a_1, a_2,. . . , a_{12}\} = 20$. b)Determine $12$ natural numbers with the property from the statement.

2009 Moldova Team Selection Test, 4

[color=darkred]Let $ p$ be a prime divisor of $ n\ge 2$. Prove that there exists a set of natural numbers $ A \equal{} \{a_1,a_2,...,a_n\}$ such that product of any two numbers from $ A$ is divisible by the sum of any $ p$ numbers from $ A$.[/color]

MMATHS Mathathon Rounds, 2019

[u]Round 1 [/u] [b]p1.[/b] A small pizza costs $\$4$ and has $6$ slices. A large pizza costs $\$9$ and has $14$ slices. If the MMATHS organizers got at least $400$ slices of pizza (having extra is okay) as cheaply as possible, how many large pizzas did they buy? [b]p2.[/b] Rachel flips a fair coin until she gets a tails. What is the probability that she gets an even number of heads before the tails? [b]p3.[/b] Find the unique positive integer $n$ that satisfies $n! \cdot (n + 1)! = (n + 4)!$. [u]Round 2 [/u] [b]p4.[/b] The Portland Malt Shoppe stocks $10$ ice cream flavors and $8$ mix-ins. A milkshake consists of exactly $1$ flavor of ice cream and between $1$ and $3$ mix-ins. (Mix-ins can be repeated, the number of each mix-in matters, and the order of the mix-ins doesn’t matter.) How many different milkshakes can be ordered? [b]p5.[/b] Find the minimum possible value of the expression $(x)^2 + (x + 3)^4 + (x + 4)^4 + (x + 7)^2$, where $x$ is a real number. [b]p6.[/b] Ralph has a cylinder with height $15$ and volume $\frac{960}{\pi}$ . What is the longest distance (staying on the surface) between two points of the cylinder? [u]Round 3 [/u] [b]p7.[/b] If there are exactly $3$ pairs $(x, y)$ satisfying $x^2 + y^2 = 8$ and $x + y = (x - y)^2 + a$, what is the value of $a$? [b]p8.[/b] If $n$ is an integer between $4$ and $1000$, what is the largest possible power of $2$ that $n^4 - 13n^2 + 36$ could be divisible by? (Your answer should be this power of $2$, not just the exponent.) [b]p9.[/b] Find the sum of all positive integers $n \ge 2$ for which the following statement is true: “for any arrangement of $n$ points in three-dimensional space where the points are not all collinear, you can always find one of the points such that the $n - 1$ rays from this point through the other points are all distinct.” [u]Round 4 [/u] [b]p10.[/b] Donald writes the number $12121213131415$ on a piece of paper. How many ways can he rearrange these fourteen digits to make another number where the digit in every place value is different from what was there before? [b]p11.[/b] A question on Joe’s math test asked him to compute $\frac{a}{b} +\frac34$ , where $a$ and $b$ were both integers. Because he didn’t know how to add fractions, he submitted $\frac{a+3}{b+4}$ as his answer. But it turns out that he was right for these particular values of $a$ and $b$! What is the largest possible value that a could have been? [b]p12.[/b] Christopher has a globe with radius $r$ inches. He puts his finger on a point on the equator. He moves his finger $5\pi$ inches North, then $\pi$ inches East, then $5\pi$ inches South, then $2\pi$ inches West. If he ended where he started, what is the largest possible value of $r$? PS. You should use hide for answers. Rounds 5-7 have be posted [url=https://artofproblemsolving.com/community/c4h2789002p24519497]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2022 Rioplatense Mathematical Olympiad, 6

A sequence of numbers is [i]platense[/i] if the first number is greater than $1$, and $a_{n+1}=\frac{a_n}{p_n}$ which $p_n$ is the least prime divisor of $a_n$, and the sequence ends if $a_n=1$. For instance, the sequences $864, 432,216,108,54,27,9,3,1$ and $2022,1011,337,1$ are both sequence platense. A sequence platense is [i]cuboso[/i] if some term is a perfect cube greater than $1$. For instance, the sequence $864$ is cuboso, because $27=3^3$, and the sequence $2022$ is not cuboso, because there is no perfect cube. Determine the number of sequences cuboso which the initial term is less than $2022$.

2014 Iran MO (2nd Round), 1

Find all positive integers $(m,n)$ such that \[n^{n^{n}}=m^{m}.\]

2018 VTRMC, 4

Let $m, n$ be integers such that $n \geq m \geq 1$. Prove that $\frac{\text{gcd} (m,n)}{n} \binom{n}{m}$ is an integer. Here $\text{gcd}$ denotes greatest common divisor and $\binom{n}{m} = \frac{n!}{m!(n-m)!}$ denotes the binomial coefficient.

2010 Denmark MO - Mohr Contest, 2

Prove that for any integer $n$ there exist integers $a, b$ and $c$ such that $n=a^2+b^2-c^2$.

2020 GQMO, 3

We call a set of integers $\textit{special}$ if it has $4$ elements and can be partitioned into $2$ disjoint subsets $\{ a,b \}$ and $\{ c, d \}$ such that $ab - cd = 1$. For every positive integer $n$, prove that the set $\{ 1, 2, \dots, 4n \}$ cannot be partitioned into $n$ disjoint special sets. [i]Proposed by Mohsen Jamali, Iran[/i]

2023 Peru MO (ONEM), 1

We define the set $M = \{1^2,2^2,3^2,..., 99^2, 100^2\}$. a) What is the smallest positive integer that divides exactly two elements of $M$? b) What is the largest positive integer that divides exactly two elements of $M$?

2018 Balkan MO Shortlist, N4

Let $P(x)=a_d x^d+\dots+a_1 x+a_0$ be a non-constant polynomial with non-negative integer coefficients having $d$ rational roots.Prove that $$\text{lcm} \left(P(m),P(m+1),\dots,P(n) \right)\geq m \dbinom{n}{m}$$ for all $n>m$ [i](Navid Safaei, Iran)[/i]

2001 Iran MO (2nd round), 1

Let $n$ be a positive integer and $p$ be a prime number such that $np+1$ is a perfect square. Prove that $n+1$ can be written as the sum of $p$ perfect squares.

2009 Indonesia TST, 1

Find the smallest odd integer $ k$ such that: for every $ 3\minus{}$degree polynomials $ f$ with integer coefficients, if there exist $ k$ integer $ n$ such that $ |f(n)|$ is a prime number, then $ f$ is irreducible in $ \mathbb{Z}[n]$.

2016 Ecuador Juniors, 1

A natural number of five digits is called [i]Ecuadorian [/i]if it satisfies the following conditions: $\bullet$ All its digits are different. $\bullet$ The digit on the far left is equal to the sum of the other four digits. Example: $91350$ is an Ecuadorian number since $9 = 1 + 3 + 5 + 0$, but $54210$ is not since $5 \ne 4 + 2 + 1 + 0$. Find how many Ecuadorian numbers exist.

1993 Kurschak Competition, 1

Let $a$ and $b$ be positive integers. Prove that the numbers $an^2+b$ and $a(n+1)^2+b$ are both perfect squares only for finitely many integers $n$.

2023 Middle European Mathematical Olympiad, 4

Let $n, m$ be positive integers. A set $S$ of positive integers is called $(n, m)$-good, if: (1) $m \in S$; (2) for all $a\in S$, all divisors of $a$ are also in $S$; (3) for all distinct $a, b \in S$, $a^n+b^n \in S$. For which $(n, m)$, the only $(n, m)$-good set is $\mathbb{N}$?

2019 India IMO Training Camp, P3

Let $f : \{ 1, 2, 3, \dots \} \to \{ 2, 3, \dots \}$ be a function such that $f(m + n) | f(m) + f(n) $ for all pairs $m,n$ of positive integers. Prove that there exists a positive integer $c > 1$ which divides all values of $f$.

2006 AIME Problems, 3

Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is $\frac{1}{29}$ of the original integer.

2018 ABMC, Team

[u]Round 1[/u] [b]1.1.[/b] What is the area of a circle with diameter $2$? [b]1.2.[/b] What is the slope of the line through $(2, 1)$ and $(3, 4)$? [b]1.3.[/b] What is the units digit of $2^2 \cdot 4^4 \cdot 6^6$ ? [u]Round 2[/u] [b]2.1.[/b] Find the sum of the roots of $x^2 - 5x + 6$. [b]2. 2.[/b] Find the sum of the solutions to $|2 - x| = 1$. [b]2.3.[/b] On April $1$, $2018$, Mr. Dospinescu, Mr. Phaovibul and Mr. Pohoata all go swimming at the same pool. From then on, Mr. Dospinescu returns to the pool every 4th day, Mr. Phaovibul returns every $7$th day and Mr. Pohoata returns every $13$th day. What day will all three meet each other at the pool again? Give both the month and the day. [u]Round 3[/u] [b]3. 1.[/b] Kendall and Kylie are each selling t-shirts separately. Initially, they both sell t-shirts for $\$ 33$ each. A week later, Kendall marks up her t-shirt price by $30 \%$, but after seeing a drop in sales, she discounts her price by $30\%$ the following week. If Kim wants to buy $360$ t-shirts, how much money would she save by buying from Kendall instead of Kylie? Write your answer in dollars and cents. [b]3.2.[/b] Richard has English, Math, Science, Spanish, History, and Lunch. Each class is to be scheduled into one distinct block during the day. There are six blocks in a day. How many ways could he schedule his classes such that his lunch block is either the $3$rd or $4$th block of the day? [b]3.3.[/b] How many lattice points does $y = 1 + \frac{13}{17}x$ pass through for $x \in [-100, 100]$ ? (A lattice point is a point where both coordinates are integers.) [u]Round 4[/u] [b]4. 1.[/b] Unsurprisingly, Aaron is having trouble getting a girlfriend. Whenever he asks a girl out, there is an eighty percent chance she bursts out laughing in his face and walks away, and a twenty percent chance that she feels bad enough for him to go with him. However, Aaron is also a player, and continues asking girls out regardless of whether or not previous ones said yes. What is the minimum number of girls Aaron must ask out for there to be at least a fifty percent chance he gets at least one girl to say yes? [b]4.2.[/b] Nithin and Aaron are two waiters who are working at the local restaurant. On any given day, they may be fired for poor service. Since Aaron is a veteran who has learned his profession well, the chance of him being fired is only $\frac{2}{25}$ every day. On the other hand, Nithin (who never paid attention during job training) is very lazy and finds himself constantly making mistakes, and therefore the chance of him being fired is $\frac{2}{5}$. Given that after 1 day at least one of the waiters was fired, find the probability Nithin was fired. [b]4.3.[/b] In a right triangle, with both legs $4$, what is the sum of the areas of the smallest and largest squares that can be inscribed? An inscribed square is one whose four vertices are all on the sides of the triangle. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784569p24468582]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

PEN N Problems, 9

Let $ q_{0}, q_{1}, \cdots$ be a sequence of integers such that a) for any $ m > n$, $ m \minus{} n$ is a factor of $ q_{m} \minus{} q_{n}$, b) item $ |q_n| \le n^{10}$ for all integers $ n \ge 0$. Show that there exists a polynomial $ Q(x)$ satisfying $ q_{n} \equal{} Q(n)$ for all $ n$.

1972 Swedish Mathematical Competition, 1

Find the largest real number $a$ such that \[\left\{ \begin{array}{l} x - 4y = 1 \\ ax + 3y = 1\\ \end{array} \right. \] has an integer solution.

2007 Romania Team Selection Test, 3

Let $a_{i}$, $i = 1,2, \dots ,n$, $n \geq 3$, be positive integers, having the greatest common divisor 1, such that \[a_{j}\textrm{ divide }\sum_{i = 1}^{n}a_{i}\] for all $j = 1,2, \dots ,n$. Prove that \[\prod_{i = 1}^{n}a_{i}\textrm{ divides }\Big{(}\sum_{i = 1}^{n}a_{i}\Big{)}^{n-2}.\]

2007 Indonesia TST, 3

Let $ a_1,a_2,a_3,\dots$ be infinite sequence of positive integers satisfying the following conditon: for each prime number $ p$, there are only finite number of positive integers $ i$ such that $ p|a_i$. Prove that that sequence contains a sub-sequence $ a_{i_1},a_{i_2},a_{i_3},\dots$, with $ 1 \le i_1<i_2<i_3<\dots$, such that for each $ m \ne n$, $ \gcd(a_{i_m},a_{i_n})\equal{}1$.