Found problems: 721
Prove that if $p$ and $q$ are two prime numbers, such that
$$p+p^2+p^3+...+p^q=q+q^2+q^3+...+q^p,$$
then $p=q$.
Determine the smallest prime $p$ such that $2018!$ is divisible by $p^{3}$ , but not divisible by $p^{4}$.
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}
$
Let $(a_n)_{n = 0}^{\infty} $ be a sequence of positive integers such that for every $n \geq 0$ it is true that
$$a_{n+2} = a_0 a_1 + a_1 a_2 + ... + a_n a_{n+1} - 1 $$
a) Prove that there exist a prime number which divides infinitely many $a_n$
b) Prove that there exist infinitely many such prime numbers
Let $k$ be a positive integer and let $S$ be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and reflection) to place the elements of $S$ around the circle such that the product of any two neighbors is of the form $x^2+x+k$ for some positive integer $x$.
Let's call any natural number "very prime" if any number of consecutive digits (in particular, a digit or number itself) is a prime number. For example, $23$ and $37$ are "very prime" numbers, but $237$ and $357$ are not. Find the largest "prime" number (with justification!).
For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$
[i]Proposed by Suhaimi Ramly, Malaysia[/i]
Two different prime numbers between $ 4$ and $ 18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
$ \textbf{(A)}\ 21 \qquad \textbf{(B)}\ 60\qquad \textbf{(C)}\ 119 \qquad \textbf{(D)}\ 180\qquad \textbf{(E)}\ 231$
Show that the cube roots of three distinct prime numbers cannot be three terms (not necessarily consecutive) of an arithmetic progression.
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?
Find all pairs $(p,q)$ of prime numbers such that
$$ p(p^2 - p - 1) = q(2q + 3) .$$
Let $P(x)$ be a polynomial with integer coefficients. We will denote the set of all prime numbers by $\mathbb P$. Show that the set $\mathbb S := \{p\in\mathbb P : \exists\text{ }n \text{ s.t. }p\mid P(n)\}$ is finite if and only if $P(x)$ is a non-zero constant polynomial.
For a given odd prime number $p$, define $f(n)$ the remainder of $d$ divided by $p$, where $d$ is the biggest divisor of $n$ which is not a multiple of $p$. For example when $p=5$, $f(6)=1, f(35)=2, f(75)=3$. Define the sequence $a_1, a_2, \ldots, a_n, \ldots$ of integers as the followings:
[list]
[*]$a_1=1$
[*]$a_{n+1}=a_n+(-1)^{f(n)+1}$ for all positive integers $n$.
[/list]
Determine all integers $m$, such that there exist infinitely many positive integers $k$ such that $m=a_k$.
Given a finite set $ P$ of prime numbers, prove that there exists a positive integer $ x$ such that it can be written in the form $ a^p \plus{} b^p$ ($ a,b$ are positive integers), for each $ p\in P$, and cannot be written in that form for each $ p$ not in $ P$.
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!.$
Let $ a $ , $ b $ , $ c $ , $ d $ , $ (a + b + c + 18 + d) $ , $ (a + b + c + 18 - d) $ , $ (b + c) $ , and $ (c + d) $ be distinct prime numbers such that $ a + b + c = 2010 $, $ a $, $ b $, $ c $, $ d \neq 3 $ , and $ d \le 50 $. Find the maximum value of the difference between two of these prime numbers.
Define a number to be $boring$ if all the digits of the number are the same. How many positive integers less than $10000$ are both prime and boring?
Prove that there are infinitely many prime numbers that divide at least one integer of the form $2^{n^3+1}-3^{n^2+1}+5^{n+1}$ where $n$ is a positive integer.
Find the total number of primes $p<100$ such that $\lfloor (2+\sqrt{5})^p \rfloor-2^{p+1}$ is divisible by $p$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.
Let $p$ and $q$ be prime numbers of the form $4k+3$. Suppose that there exist integers $x$ and $y$ such that $x^2-pqy^2=1$. Prove that there exist positive integers $a$ and $b$ such that $|pa^2-qb^2|=1$.
Joe and Kathryn are both on the school math team, which practices every Wednesday after school until $4$ PM for competitions. The team was preparing for the $ 2005$ iTest when Joe realized how crazy he was for not asking Kathryn out – the way she worked those iTest problems, solving question after question, almost made him go insane sitting there that day. He never felt the same way when she worked on preparing for other competitions – they just aren’t the same.
Kathryn always beat Joe at competitions, too. Joe admired her resolve and unwillingness to make herself look stupid, when so many other girls he knew at school tried to pretend they were stupid in order to attract guys.
So as time ticked away and that afternoon’s Wednesday practice neared an end, Joe was determined to strike up a conversation with Kathryn and ask her out. He really wanted to impress her, so he thought he’d ask her a really hard history of math question that she didn’t know. Naturally, she’d want the answer, and be so impressed with Joe’s brilliance that she’d go out with him on Friday night.
Great plan. Seriously.
When Joe asked Kathryn after class, “Who was the mathematician that died in approximately $200$ B.C. that developed a method for calculating all prime numbers?” Kathryn gave the correct response. What name did she say?
Can be colored the positive integers with 2009 colors if we know that each color paints infinitive integers and that we can not find three numbers colored by three different colors for which the product of two numbers equal to the third one?
Does there exists a base in which the numbers of the form:
\[ 10101, 101010101, 1010101010101,\cdots \]
are all prime numbers?
A prime number $p > 2$ and $x,y \in \left\{ 1,2,\ldots, \frac{p-1}{2} \right\}$ are given. Prove that if
$x\left( p-x\right)y\left( p-y\right)$ is a perfect square, then $x = y$.
Palmer correctly computes the product of the first $1,001$ prime numbers. Which of the following is NOT a factor of Palmer's product?
$\text{(A) }2,002\qquad\text{(B) }3,003\qquad\text{(C) }5,005\qquad\text{(D) }6,006\qquad\text{(E) }7,007$