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

Does there exist an integer containing only digits $2$ and $0$ which is a $k$-th power of a positive integer ($k \ge2$)?
Let $x, y, p, n, k$ be positive integers such that $$x^n + y^n = p^k.$$ Prove that if $n > 1$ is odd, and $p$ is an odd prime, then $n$ is a power of $p$.
Find all positive integers $k$ for which there is an irrational $\alpha>1$ and a positive integer $N$ such that $\left\lfloor\alpha^{n}\right\rfloor$ is of the form $m^2-k$ com $m \in \mathbb{Z}$ for every integer $n>N$.
Prove that the product of $8$ consecutive natural numbers can never be a fourth power of natural number.
Compare the following two numbers: $2^{2^{2^{2^{2}}}}$ and $3^{3^{3^{3}}}$.
8) A train, originally of mass $M$, is traveling on a frictionless straight horizontal track with constant speed $v$. Snow starts to fall vertically and sticks to the train at a rate of $\rho$, where $\rho$ has units of kilograms per second. The train's engine keeps the train moving at constant speed $v$ as snow accumulates on the train. What is the minimum power required from the engine to keep the train traveling at a constant speed v? A) $0$ B) $Mgv$ C) $\frac{1}{2}Mv^2$ D) $\frac{1}{2}pv^2$ E) $\rho v^2$
Call a tuple $(b_m, b_{m+1},..., b_n)$ of integers perfect if both following conditions are fulfilled: 1. There exists an integer $a > 1$ such that $b_k = a^k + 1$ for all $k = m, m + 1,..., n$ 2. For all $k = m, m + 1,..., n,$ there exists a prime number $q$ and a non-negative integer $t$ such that $b_k = q^t$. Prove that if $n - m$ is large enough then there is no perfect tuples, and find all perfect tuples with the maximal number of components.
Positive odd integers $a, b$ are such that $a^bb^a$ is a perfect square. Show that $ab$ is a perfect square.
Find all positive integers \(k\) for which there is an irrational \(\alpha>1\) and a positive integer \(N\) such that \(\left\lfloor\alpha^{n}\right\rfloor\) is a perfect square minus \(k\) for every integer \(n\) with \(n>N\).
Consider the arithmetic progression $a, a+d, a+2d,\ldots$ where $a$ and $d$ are positive integers. For any positive integer $k$, prove that the progression has either no $k$-th powers or infinitely many.
Let $a_1, a_2, . . . , a_n$ be real numbers. Prove $\sqrt[3]{a_1^3+ a_2^3+ . . . + a_n^3} \le \sqrt{a_1^2+ a_2^2+ . . . + a_n^2} $ (1) When does equality hold in (1)?
Prove that for no natural $m$ a number $m(m+1)$ is a power of an integer.
Let $a$ be a positive integer such that the number $a^n$ has an odd number of digits in the decimal representation for all $n > 0$. Prove that the number $a$ is an even power of $10$.
Prove that for each prime number $p > 5$ there exists a positive integer n such that $p^n$ ends in $001$ in decimal representation.
Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$
Prove that for every prime number $p$ and positive integer $a$, there exists a natural number $n$ such that $p^n$ contains $a$ consecutive equal digits.
Find the smallest prime number that can not be written in the form $\left| 2^a-3^b \right|$ with non-negative integers $a,b$.
Let $a, b, c$ be real numbers, and define $S_n = a^n + b^n + c^n$ for positive integers $n$. Suppose that $S_1, S_2, S_3$ are integers satisfying $6 | 5S_1 - 3S_2 - 2S_3$. Show that $S_n$ is an integer for all positive integers $n$.
Let $a,b,c$ be positive integers such that $a|b^3, b|c^3$ and $c|a^3$. Prove that $abc|(a+b+c)^{13}$
Determine all pairs $(k,n)$ of non-negative integers such that the following inequality holds $\forall x,y>0$: \[1+ \frac{y^n}{x^k} \geq \frac{(1+y)^n}{(1+x)^k}.\]
Let $n$, $m$ and $k$ be positive integers satisfying $(n-1)n(n+1)=m^k.$ Prove that $k=1.$
The positive integer $a$ is relatively prime with $10$. Prove that for any positive integer $n$, there exists a power of $a$ whose last $n$ digits are $\underbrace{0...0}_\text{n-1}1$.
The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.) Show that the sequence contains no sixth power of a natural number.
Determine the smallest natural number $n$ such that $n^n$ is not a divisor of the product $1\cdot 2\cdot 3\cdot ... \cdot 2015\cdot 2016$.