Determine all positive integers $k$ for which there exist positive integers $n$ and $m, m\ge 2$, such that $3^k + 5^k = n^m$

Consider the arithmetic sequence $8, 21,34,47,....$ a) Prove that this sequence contains infinitely many integers written only with digit $9$. b) How many such integers less than $2010^{2010}$ are in the se­quence?

Last digit of $2019^{2019}$ is

1- Find a pair $(m,n)$ of positive integers such that $K = |2^m-3^n|$ in all of this cases : $a) K=5$ $b) K=11$ $c) K=19$ 2-Is there a pair $(m,n)$ of positive integers such that : $$|2^m-3^n| = 2017$$ 3-Every prime number less than $41$ can be represented in the form $|2^m-3^n|$ by taking an Appropriate pair $(m,n)$ of positive integers. Prove that the number $41$ cannot be represented in the form $|2^m-3^n|$ where $m$ and $n$ are positive integers 4-Note that $2^5+3^2=41$ . The number $53$ is the least prime number that cannot be represented as a sum or an difference of a power of $2$ and a power of $3$ . Prove that the number $53$ cannot be represented in any of the forms $2^m-3^n$ , $3^n-2^m$ , $2^m-3^n$ where $m$ and $n$ are positive integers

For the integer $n>1$, define $D(n)=\{ a-b\mid ab=n, a>b>0, a,b\in\mathbb{N} \}$. Prove that for any integer $k>1$, there exists pairwise distinct positive integers $n_1,n_2,\ldots,n_k$ such that $n_1,\ldots,n_k>1$ and $|D(n_1)\cap D(n_2)\cap\cdots\cap D(n_k)|\geq 2$.

Find prime numbers $p , q , r$ such that $p+q^2+r^3=200$. Give all the possibilities. Remember that the number $1$ is not prime.

A finite set $S$ of positive integers is given. Show that there is a positive integer $N$ dependent only on $S$, such that any $x_1, \dots, x_m \in S$ whose sum is a multiple of $N$, can be partitioned into groups each of whose sum is exactly $N$. (The numbers $x_1, \dots, x_m$ need not be distinct.)

Prove that for every prime number $p$ there exist infinity many natural numbers $n$ so that they satisfy: $2^{2^{2^{ \dots ^{2^n}}}} \equiv n^{2^{2^{\dots ^{2}}}} (mod p)$ Where in both sides $2$ appeared $1397$ times

Find all triples $(a,b,c)$ of positive integers such that if $n$ is not divisible by any prime less than $2014$, then $n+c$ divides $a^n+b^n+n$. [i]Proposed by Evan Chen[/i]

Find all the polynomials $P(t)$ of one variable that fullfill the following for all real numbers $x$ and $y$: $P(x^2-y^2) = P(x+y)P(x-y)$.

The numbers $1,2,\dots, 49$ are written on unit squares of a $7\times 7$ chessboard such that consequtive numbers are on unit squares sharing a common edge. At most how many prime numbers can a row have? $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 3 $

Let $S(n)$ be the sum of the digits of the positive integer $n$. Find all $n$ such that $S(n)(S(n)-1)=n-1$.

I am not a spammer, at least, this is the way I use to think about myself, and thus I will not open a new thread for the following problem from today's DeMO exam: Let Q(n) denote the sum of the digits of a positive integer n. Prove that $Q\left(Q\left(Q\left(2005^{2005}\right)\right)\right)=7$. [[b]EDIT:[/b] Since this post was split into a new thread, I comment: The problem is completely analogous to the problem posted at http://www.mathlinks.ro/Forum/viewtopic.php?t=31409 , with the only difference that you have to consider the number $2005^{2005}$ instead of $4444^{4444}$.] Darij

Show that there exists a set $\mathcal{C}$ of $2020$ distinct, positive integers that satisfies simultaneously the following properties: $\bullet$ When one computes the greatest common divisor of each pair of elements of $\mathcal{C}$, one gets a list of numbers that are all distinct. $\bullet$ When one computes the least common multiple of each pair of elements of $\mathcal{C}$, one gets a list of numbers that are all distinct.

What's the largest number of integers from $1$ to $2022$ that you can choose so that no sum of any two different chosen integers is divisible by any difference of two different chosen integers? [i](Proposed by Oleksii Masalitin)[/i]

For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Find all prime numbers $p$, for which there exist $x, y \in \mathbb{Q}^+$ and $n \in \mathbb{N}$, satisfying $x+y+\frac{p}{x}+\frac{p}{y}=3n$.

A student divides an integer $m$ by a positive integer $n$, where $n \le 100$, and claims that $\frac{m}{n}=0.167a_1a_2...$ . Show the student must be wrong.

For a positive integer $n$, let $\varphi(n)$ and $d(n)$ denote the value of the Euler phi function at $n$ and the number of positive divisors of $n$, respectively. Prove that there are infinitely many positive integers $n$ such that $\varphi(n)$ and $d(n)$ are both perfect squares. [i]Finland, Olli Järviniemi[/i]

Let $a$ be a positive integer and let $\{a_n\}$ be defined by $a_0 = 0$ and \[a_{n+1 }= (a_n + 1)a + (a + 1)a_n + 2 \sqrt{a(a + 1)a_n(a_n + 1)} \qquad (n = 1, 2 ,\dots ).\] Show that for each positive integer $n$, $a_n$ is a positive integer.

Let $a$ be a positive real number such that $\tfrac{a^2}{a^4-a^2+1}=\tfrac{4}{37}$. Then $\tfrac{a^3}{a^6-a^3+1}=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Show that if a $6n$-digit number is divisible by $7$, then the number that results from moving the ones digit to the beginning of the number is also a multiple of $7$.

How many pairs of positive integers $(a,b)$ are there such that $a < b$ and $a,b$ can be the legs of a right triangle with hypotenuse $340$?

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers that are not divisible by each other, i.e. for any $i \neq j$, $a_i$ is not divisible by $a_j$. Show that \[ a_1+a_2+\cdots+a_n \ge 1.1n^2-2n. \] [i]Note:[/i] A proof of the inequality when $n$ is sufficient large will be awarded points depending on your results.

How many integers belong to ($a,2008a$), where $a$ ($a > 0$) is given.