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: 721

2009 Turkey Team Selection Test, 1

For which $ p$ prime numbers, there is an integer root of the polynominal $ 1 \plus{} p \plus{} Q(x^1)\cdot\ Q(x^2)\ldots\ Q(x^{2p \minus{} 2})$ such that $ Q(x)$ is a polynominal with integer coefficients?

2015 Germany Team Selection Test, 3

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

2015 AMC 10, 11

Among the positive integers less than $100$, each of whose digits is a prime number, one is selected at random. What is the probablility that the selected number is prime? $\textbf{(A) } \dfrac{8}{99} \qquad\textbf{(B) } \dfrac{2}{5} \qquad\textbf{(C) } \dfrac{9}{20} \qquad\textbf{(D) } \dfrac{1}{2} \qquad\textbf{(E) } \dfrac{9}{16} $

2007 Silk Road, 1

On the board are written $2 , 3 , 5 ,... , 2003$ , that is, all the prime numbers of the interval $[2,2007]$ . The operation of [i]simplification [/i] is the replacement of two numbers $a , b$ by a maximal prime number not exceeding $\sqrt{a^2-a b+b^2}$ . First, the student erases the number $q, 2<q<2003$, then applies the [i]simplification [/i] operation to the remaining numbers until one number remains. Find the maximum possible and minimum possible values of the number obtained in the end. How do these values depend on the number $q$?

2024 CIIM, 3

Given a positive integer \(n\), let \(\phi(n)\) denote the number of positive integers less than or equal to \(n\) that are relatively prime to \(n\). Find all possible positive integers \(k\) for which there exist positive integers \(1 \leq a_1 < a_2 < \dots < a_k\) such that: \[ \left\lfloor \frac{\phi(a_1)}{a_1} + \frac{\phi(a_2)}{a_2} + \dots + \frac{\phi(a_k)}{a_k} \right\rfloor = 2024 \]

2004 Iran MO (3rd Round), 21

$ a_1, a_2, \ldots, a_n$ are integers, not all equal. Prove that there exist infinitely many prime numbers $ p$ such that for some $ k$ \[ p\mid a_1^k \plus{} \dots \plus{} a_n^k.\]

2024 Brazil Undergrad MO, 1

A positive integer \(n\) is called perfect if the sum of its positive divisors \(\sigma(n)\) is twice \(n\), that is, \(\sigma(n) = 2n\). For example, \(6\) is a perfect number since the sum of its positive divisors is \(1 + 2 + 3 + 6 = 12\), which is twice \(6\). Prove that if \(n\) is a positive perfect integer, then: \[ \sum_{p|n} \frac{1}{p + 1} < \ln 2 < \sum_{p|n} \frac{1}{p - 1} \] where the sums are taken over all prime divisors \(p\) of \(n\).

2020 Kazakhstan National Olympiad, 3

Let $p$ be a prime number and $k,r$ are positive integers such that $p>r$. If $pk+r$ divides $p^p+1$ then prove that $r$ divides $k$.

2014 Ukraine Team Selection Test, 9

Let $m, n$ be odd prime numbers. Find all pairs of integers numbers $a, b$ for which the system of equations: $x^m+y^m+z^m=a$, $x^n+y^n+z^n=b$ has many solutions in integers $x, y, z$.

2020 JBMO Shortlist, 8

Find all prime numbers $p$ and $q$ such that $$1 + \frac{p^q - q^p}{p + q}$$ is a prime number. [i]Proposed by Dorlir Ahmeti, Albania[/i]

2019 IFYM, Sozopol, 1

We define the sequence $a_n=(2n)^2+1$ for each natural number $n$. We will call one number [i]bad[/i], if there don’t exist natural numbers $a>1$ and $b>1$ such that $a_n=a^2+b^2$. Prove that the natural number $n$ is [i]bad[/i], if and only if $a_n$ is prime.

2007 Italy TST, 3

Let $p \geq 5$ be a prime. (a) Show that exists a prime $q \neq p$ such that $q| (p-1)^{p}+1$ (b) Factoring in prime numbers $(p-1)^{p}+1 = \prod_{i=1}^{n}p_{i}^{a_{i}}$ show that: \[\sum_{i=1}^{n}p_{i}a_{i}\geq \frac{p^{2}}2 \]

Bangladesh Mathematical Olympiad 2020 Final, #11

A prime number$ q $is called[b][i] 'Kowai' [/i][/b]number if $ q = p^2 + 10$ where $q$, $p$, $p^2-2$, $p^2-8$, $p^3+6$ are prime numbers. WE know that, at least one [b][i]'Kowai'[/i][/b] number can be found. Find the summation of all [b][i]'Kowai'[/i][/b] numbers.

2024 Thailand October Camp, 4

The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences

1996 IMO Shortlist, 1

Four integers are marked on a circle. On each step we simultaneously replace each number by the difference between this number and next number on the circle, moving in a clockwise direction; that is, the numbers $ a,b,c,d$ are replaced by $ a\minus{}b,b\minus{}c,c\minus{}d,d\minus{}a.$ Is it possible after 1996 such to have numbers $ a,b,c,d$ such the numbers $ |bc\minus{}ad|, |ac \minus{} bd|, |ab \minus{} cd|$ are primes?

2023 Argentina National Olympiad, 4

Lets say that a positive integer is $good$ if its equal to the the subtraction of two positive integer cubes. For example: $7$ is a $good$ prime because $2^3-1^3=7$. Determine how much the last digit of a $good$ prime may be worth. Give all the possibilities.

1997 Mexico National Olympiad, 1

Determine all prime numbers $p$ for which $8p^4-3003$ is a positive prime number.

2022 Poland - Second Round, 3

Positive integers $a,b,c$ satisfying the equation $$a^3+4b+c = abc,$$ where $a \geq c$ and the number $p = a^2+2a+2$ is a prime. Prove that $p$ divides $a+2b+2$.

1985 IMO Longlists, 22

The positive integers $x_1, \cdots , x_n$, $n \geq 3$, satisfy $x_1 < x_2 <\cdots< x_n < 2x_1$. Set $P = x_1x_2 \cdots x_n.$ Prove that if $p$ is a prime number, $k$ a positive integer, and $P$ is divisible by $pk$, then $\frac{P}{p^k} \geq n!.$

1982 National High School Mathematics League, 12

Given a circle $C:x^2+y^2=r^2$ ($r$ is an odd number). $P(u,v)\in C$, satisfying: $u=p^m, v=q^n$($p,q$ are prime numbers, $m,n$ are integers, $u>v$). Define $A,B,C,D,M,N:A(r,0),B(-r,0),C(0,-r),D(0,r),M(u,0),N(0,v)$. Prove that $|AM|=1,|BM|=9,|CN|=8,|DN|=2$.

1973 IMO Shortlist, 4

Let $P$ be a set of $7$ different prime numbers and $C$ a set of $28$ different composite numbers each of which is a product of two (not necessarily different) numbers from $P$. The set $C$ is divided into $7$ disjoint four-element subsets such that each of the numbers in one set has a common prime divisor with at least two other numbers in that set. How many such partitions of $C$ are there ?

1999 AMC 12/AHSME, 4

Find the sum of all prime numbers between $ 1$ and $ 100$ that are simultaneously $ 1$ greater than a multiple of $ 4$ and $ 1$ less than a multiple of $ 5$. $ \textbf{(A)}\ 118\qquad \textbf{(B)}\ 137\qquad \textbf{(C)}\ 158\qquad \textbf{(D)}\ 187 \qquad \textbf{(E)}\ 245$

2017 China Northern MO, 8

On Qingqing Grassland, there are 7 sheep numberd $1,2,3,4,5,6,7$ and 2017 wolves numberd $1,2,\cdots,2017$. We have such strange rules: (1) Define $P(n)$: the number of prime numbers that are smaller than $n$. Only when $P(i)\equiv j\pmod7$, wolf $i$ may eat sheep $j$ (he can also choose not to eat the sheep). (2) If wolf $i$ eat sheep $j$, he will immediately turn into sheep $j$. (3) If a wolf can make sure not to be eaten, he really wants to experience life as a sheep. Assume that all wolves are very smart, then how many wolves will remain in the end?

2004 France Team Selection Test, 3

Let $P$ be the set of prime numbers. Consider a subset $M$ of $P$ with at least three elements. We assume that, for each non empty and finite subset $A$ of $M$, with $A \neq M$, the prime divisors of the integer $( \prod_{p \in A} ) - 1$ belong to $M$. Prove that $M = P$.

2022 Kosovo National Mathematical Olympiad, 4

Find all prime numbers $p$ and $q$ such that $pq-p-q+3$ is a perfect square.