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 Niels Henrik Abels Math Contest (Norwegian Math Olympiad) Round 2, 8

Let $ x$ and $ y$ be positive integers. The least possible value of $ |11x^5 \minus{} 7y^3|$ is A. 1 B. 2 C. 3 D. 4 E. None of these

2005 Silk Road, 1

Let $n \geq 2$ be natural number. Prove, that $(1^{n-1}+2^{n-1}+....+(n-1)^{n-1})+1$ divided by $n$ iff for any prime divisor $p$ of $n$ $p| \frac{n}{p}-1 $ and $(p-1)| \frac{n}{p}-1$.

2021 LMT Spring, B4

Set $S$ contains exactly $36$ elements in the form of $2^m \cdot 5^n$ for integers $ 0 \le m,n \le 5$. Two distinct elements of $S$ are randomly chosen. Given that the probability that their product is divisible by $10^7$ is $a/b$, where $a$ and $b$ are relatively prime positive integers, find $a +b$. [i]Proposed by Ada Tsui[/i]

2019 JBMO Shortlist, N5

Find all positive integers $x, y, z$ such that $45^x-6^y=2019^z$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

2020 Memorial "Aleksandar Blazhevski-Cane", 3

For given integers $n>0$ and $k> 1$, let $F_{n,k}(x,y)=x!+n^k+n+1-y^k$. Prove that there are only finite couples $(a,b)$ of positive integers such that $F_{n,k}(a,b)=0$

2016 BMT Spring, 6

How many integers less than $400$ have exactly $3$ factors that are perfect squares?

2005 France Team Selection Test, 4

Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.

1999 Irish Math Olympiad, 2

A function $ f: \mathbb{N} \rightarrow \mathbb{N}$ satisfies: $ (a)$ $ f(ab)\equal{}f(a)f(b)$ whenever $ a$ and $ b$ are coprime; $ (b)$ $ f(p\plus{}q)\equal{}f(p)\plus{}f(q)$ for all prime numbers $ p$ and $ q$. Prove that $ f(2)\equal{}2,f(3)\equal{}3$ and $ f(1999)\equal{}1999.$

1999 Estonia National Olympiad, 5

On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.

2004 Postal Coaching, 14

Find the greatest common divisor of all number in the set $( a^{41} - a | a \in \mathbb{N} and \geq 2 )$ . What is your guess if 41 is replaced by a natural number $n$

2024 IFYM, Sozopol, 1

Find all quadruples \((a,b,c,d)\) of positive integers such that \(\displaystyle \frac{ac+bd}{a+c}\) and \(\displaystyle \frac{bc-ad}{b-d}\) are equal to the prime number \(90121\).

2022 Durer Math Competition Finals, 7

The [i]fragments [/i] of a positive integer are the numbers seen when reading one or more of its digits in order. The [i]fragment sum[/i] equals the sum of all the fragments, including the number itself. For example, the fragment sum of $2022$ is $2022+202+022+20+02+22+2+0+2+2 = 2296$. There is another four-digit number with the same fragment sum. What is it? As the example shows, if a fragment occurs multiple times, then all its occurrences are added, and the fragments beginning with $0$ also count (for instance, $022$ is worth $22$).

2021 LMT Fall, 7

Let $n = 6901$. There are $6732$ positive integers less than or equal to $n$ that are also relatively prime to $n$. Find the sum of the distinct prime factors of $n$.

2012 Czech-Polish-Slovak Junior Match, 5

Positive integers $a, b, c$ satisfying the equality $a^2 + b^2 = c^2$. Show that the number $\frac12(c - a) (c - b)$ is square of an integer.

2017 Singapore MO Open, 3

Find the smallest positive integer $n$ so that $\sqrt{\frac{1^2+2^2+...+n^2}{n}}$ is an integer.

2007 JBMO Shortlist, 4

Let $a, b$ be two co-prime positive integers. A number is called [i]good [/i] if it can be written in the form $ax + by$ for non-negative integers $x, y$. Defi ne the function $f : Z\to Z $as $f(n) = n - n_a - n_b$, where $s_t$ represents the remainder of $s$ upon division by $t$. Show that an integer $n$ is [i]good [/i]if and only if the in finite sequence $n, f(n), f(f(n)), ...$ contains only non-negative integers.

2018 Korea - Final Round, 1

Find all integers of the form $\frac{m-6n}{m+2n}$ where $m,n$ are nonzero rational numbers satisfying $m^3=(27n^2+1)(m+2n)$.

1998 Tuymaada Olympiad, 6

Prove that the sequence of the first digits of the numbers in the form $2^n+3^n$ is nonperiodic.

1996 All-Russian Olympiad Regional Round, 11.6

Find all natural $n$ such that for some different natural $a, b, c$ and $d$ among numbers $$\frac{(a-c)(b-d)}{(b-c)(a-d)} , \frac{(b-c)(a-d)}{(a-c)(b-d)} , \frac{(a-b)(d-c)}{(a-d)(b-c)} , \frac{(a-c)(b-d)}{(a-b)(c-d)} ,$$ there are at least two numbers equal to $n$.

2015 Tournament of Towns, 1

[b](a)[/b] The integers $x$, $x^2$ and $x^3$ begin with the same digit. Does it imply that this digit is $1$? [i]($2$ points) [/i] [b](b)[/b] The same question for the integers $x, x^2, x^3, \cdots, x^{2015}$ [i]($3$ points)[/i] .

2018 Greece JBMO TST, 4

Find all positive integers $x,y,z$ with $z$ odd, which satisfy the equation: $$2018^x=100^y + 1918^z$$

1990 China Team Selection Test, 3

Prove that for every integer power of 2, there exists a multiple of it with all digits (in decimal expression) not zero.

2003 Croatia Team Selection Test, 1

Find all pairs $(m, n)$ of natural numbers for which the numbers $m^2 - 4n$ and $n^2 - 4m$ are both perfect squares.

2008 Pan African, 3

Prove that for all positive integers $n$, there exists a positive integer $m$ which is a multiple of $n$ and the sum of the digits of $m$ is equal to $n$.

1993 USAMO, 4

Let $\, a,b \,$ be odd positive integers. Define the sequence $\, (f_n ) \,$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for $\, n \,$ sufficiently large and determine the eventual value as a function of $\, a \,$ and $\, b$.