Found problems: 1048
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.
Let $A_1$ and $B_1$ be internal points lying on the sides $BC$ and $AC$ of the triangle $ABC$ respectively and segments $AA_1$ and $BB_1$ meet at $O$. The areas of the triangles $AOB_1,AOB$ and $BOA_1$ are distinct prime numbers and the area of the quadrilateral $A_1OB_1C$ is an integer. Find the least possible value of the area of the triangle $ABC$, and argue the existence of such a triangle.
Find the smallest positive integer $m$ satisfying the following condition: for all prime numbers $p$ such that $p>3$,have $105|9^{ p^2}-29^p+m.$
(September 28, 2012, Hohhot)
Let $p,q$ prime numbers such that $$p+q \mid p^3-q^3$$
Show that $p=q$.
Let $p$ be a prime number. A set of $p + 2$ positive integers, not necessarily distinct, is called [i]interesting [/i] if the sum of any $p$ of them is divisible by each of the other two. Determine all interesting sets.
Distinct positive integers $a, b, c, d$ satisfy
$$\begin{cases} a \mid b^2 + c^2 + d^2,\\
b\mid a^2 + c^2 + d^2,\\
c \mid a^2 + b^2 + d^2,\\
d \mid a^2 + b^2 + c^2,\end{cases}$$
and none of them is larger than the product of the three others. What is the largest possible number of primes among them?
Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$.
[i]Proposed by Belgium[/i]
Prove that however we choose the majority of numbers among an even number of the first consecutive natural numbers, there will be two numbers among this choosing whose sum is a prime.
Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$
Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)
Let $n$ be a positive integer with $n>1$. Prove that \[\frac{1}{2}+\cdots+\frac{1}{n}\] is not an integer.
Find all integers $ n\ge 2$ having the following property: for any $ k$ integers $ a_{1},a_{2},\cdots,a_{k}$ which aren't congruent to each other (modulo $ n$), there exists an integer polynomial $ f(x)$ such that congruence equation $ f(x)\equiv 0 (mod n)$ exactly has $ k$ roots $ x\equiv a_{1},a_{2},\cdots,a_{k} (mod n).$
If $p$ and $p^2+2$ are prime numbers, at most how many prime divisors can $p^3+3$ have?
$
\textbf{(A)}\ 1
\qquad\textbf{(B)}\ 2
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 4
\qquad\textbf{(E)}\ 5
$
Let define a function $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that :
$i)$$f(p)=1$ for all prime numbers $p$.
$ii)$$f(xy)=xf(y)+yf(x)$ for all positive integers $x,y$
find the smallest $n \geq 2016$ such that $f(n)=n$
Let $p$ be a prime. Prove that $p^2+p+1$ is never a perfect cube.
A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?
Prove that for each prime number $p > 5$ there exists a positive integer n such that $p^n$ ends in $001$ in decimal representation.
Find all positive integers $p$, $q$, $r$ such that $p$ and $q$ are prime numbers and $\frac{1}{p+1}+\frac{1}{q+1}-\frac{1}{(p+1)(q+1)} = \frac{1}{r}.$
Find all primes $p,q, r$ such that $\frac{p^{2q}+q^{2p}}{p^3-pq+q^3} = r$.
Titu Andreescu, Mathematics Department, College of Texas, USA
For a positive integer $n$, denote by $g(n)$ the number of strictly ascending triples chosen from the set $\{1, 2, ..., n\}$. Find the least positive integer $n$ such that the following holds:[i] The number $g(n)$ can be written as the product of three different prime numbers which are (not necessarily consecutive) members in an arithmetic progression with common difference $336$.[/i]
The radius $r$ of a circle with center at the origin is an odd integer.
There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers.
Determine $r$.
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 \]
Given the following list of numbers:
$$1990, 1991, 1992, ..., 2002, 2003, 2003, 2003, ..., 2003$$
where the number $2003$ appears $12$ times. Is it possible to write these numbers in some order so that the $100$-digit number that we get is prime?
Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$.
(For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)
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]