Found problems: 1048
When finding the sum $\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}+\frac{1}{7}$, the least common denominator used is
$\text{(A)}\ 120 \qquad \text{(B)}\ 210 \qquad \text{(C)}\ 420 \qquad \text{(D)}\ 840 \qquad \text{(E)}\ 5040$
Let $m$ and $n$ be positive integers. Prove that if $m^{4^n+1} - 1$ is a prime number, then there exists an integer $t \ge 0$ such that $n = 2^t$.
Let $a_n$ be a series of positive integers with $a_1=1$ and for any arbitrary prime number $p$, the set $\{a_1,a_2,\cdots,a_p\}$ is a complete remainder system modulo $p$. Prove that $\lim_{n\rightarrow \infty} \cfrac{a_n}{n}=1$.
Let $p$ be an odd prime number. Ana and Ben are playing a game with alternate moves as follows: in each move, the player which has the turn choose a number, which was not choosen before by any of the player, from the set $\{1,2,...,2p-3,2p-2\}$. This process continues until no number is left. After the end of the process, each player create the number by taking the product of the choosen numbers and then add 1. We say a player wins if the number that did create is divisible by $p$, while the number that did create the opponent it is not divisible by $p$, otherwise we say the game end in a draw. Ana start first move.
Does it exist a strategy for any of the player to win the game?
[i]Proposed by Dorlir Ahmeti, Kosovo[/i]
Determine whether there exists a prime $q$ so that for any prime $p$ the number
$$\sqrt[3]{p^2+q}$$
is never an integer.
Prove that no term of the sequence $10001$, $100010001$, $1000100010001$ , $...$ is prime.
Determine all integers $n$ such that both of the numbers:
$$|n^3 - 4n^2 + 3n - 35| \text{ and } |n^2 + 4n + 8|$$
are both prime numbers.
Let $p$ be a prime number.
Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.
Let $a,b,c\in \mathbb N$ be such that $a,b\neq c$. Prove that there are infinitely many prime numbers $p$ for which there exists $n\in\mathbb N$ that $p|a^n+b^n-c^n$.
Let $x, y$ be real numbers such that $x-y, x^2-y^2, x^3-y^3$ are all prime numbers. Prove that $x-y=3$.
EDIT: Problem submitted by Leonel Castillo, Panama.
Find all prime numbers $p$ and $q$ such that $p^2|q^3+1$ and $q^2|p^6-1$
Suppose that three prime numbers $p,q,$ and $r$ satisfy the equations $pq + qr + rp = 191$ and $p + q = r - 1$. Find $p + q + r$.
[i]Proposed by Andrew Wu[/i]
Positive integer numbers $k$ and $n$ satisfy the inequality $k > n!$. Prove that there exist pairwisely different prime numbers $p_1, p_2, \ldots, p_n$ which are divisors of the numbers $k+1, k+2, \ldots, k+n$ respectively (i.e. $p_i|k+i$).
Is the following set of prime numbers $p$ finite or infinite, where each $p$ [b]doesn't[/b] divide the numbers that can be expressed as $n^{2016}+2016^{2016}$ for $n\in \mathbb{N}$, if:
a) $p=4k+3$;
b) $p=4k+1$?
Find all pairs $(m,n)$ of positive integers numbers with $m>1$ such that:
For any positive integer $b \le m$ that is not coprime with $m$, its posible choose positive integers $a_1, a_2, \cdots, a_n$ all coprimes with $m$ such that:
$$m+a_1b+a_2b^2+\cdots+a_nb^n$$
Is a perfect power.
Note: A perfect power is a positive integer represented by $a^k$, where $a$ and $k$ are positive integers with $k>1$
Prove: For each positive integer is the number of divisors whose decimal representations ends with a 1 or 9 not less than the number of divisors whose decimal representations ends with 3 or 7.
Find the sum of all positive rational numbers that are less than $10$ and that have denominator $30$ when written in lowest terms.
Find all prime numbers $p$ which satisfy the following condition: For any prime $q < p$, if $p = kq + r, 0 \leq r < q$, there does not exist an integer $q > 1$ such that $a^{2} \mid r$.
For every positive integer$ n$, let $P(n)$ be the greatest prime divisor of $n^2+1$. Show that there are infinitely many quadruples $(a, b, c, d)$ of positive integers that satisfy $a < b < c < d$ and $P(a) = P(b) = P(c) = P(d)$.
Find all triplets of prime numbers $(m, n, p)$, that satisfy the system of equations: $$\left\{\begin{matrix} 2m-n+13p=2072,\\3m+11n+13p=2961.\end{matrix}\right.$$
Find all primes $p$ such that $p+2$ and $p^2+2p-8$ are also primes.
For a nonnegative integer $n$ define $\operatorname{rad}(n)=1$ if $n=0$ or $n=1$, and $\operatorname{rad}(n)=p_1p_2\cdots p_k$ where $p_1<p_2<\cdots <p_k$ are all prime factors of $n$. Find all polynomials $f(x)$ with nonnegative integer coefficients such that $\operatorname{rad}(f(n))$ divides $\operatorname{rad}(f(n^{\operatorname{rad}(n)}))$ for every nonnegative integer $n$.
Determine all prime numbers $p$ for which $8p^4-3003$ is a positive prime number.
Let $p \ge 2$ be a prime number and $a \ge 1$ a positive integer with $p \neq a$. Find all pairs $(a,p)$ such that: $a+p \mid a^2+p^2$
Let $n$ and $k$ be two positive integers such that $1\leq n \leq k$. Prove that, if $d^k+k$ is a prime number for each positive divisor $d$ of $n$, then $n+k$ is a prime number.