Found problems: 40
Let \( m \) and \( n \) be positive integers. Kellem and Carmen play the following game: initially, the number $0$ is on the board. Starting with Kellem and alternating turns, they add powers of \( m \) to the previous number on the board, such that the new value on the board does not exceed \( n \). The player who writes \( n \) wins. Determine, for each pair \( (m, n) \), who has the winning strategy.
[b]Note:[/b] A power of \( m \) is a number of the form \( m^k \), where \( k \) is a non-negative integer.
Determine all composite positive integers $n$ such that, for each positive divisor $d$ of $n$, there are integers $k\geq 0$ and $m\geq 2$ such that $d=k^m+1$.
Does there exist a set $ M$ with the following properties?
[i](i)[/i] The set $ M$ consists of 1992 natural numbers.
[i](ii)[/i] Every element in $ M$ and the sum of any number of elements have the form $ m^k$ $ (m, k \in \mathbb{N}, k \geq 2).$
Find all positive integers $k$ such that the product of the first $k$ primes increased by $1$ is a power of an integer (with an exponent greater than $1$).
Prove that you can pick $15$ distinct positive integers between $1$ and $2023$, such that each one of them and the sum between some of them is never a perfect square, nor a perfect cube or any other greater perfect power.
For what pairs of natural numbers $(a, b)$ is the expression $$(a^6 + 21a^4b^2 + 35a^2b^4 + 7b^6) (b^6 + 21b^4a^2 + 35b^2a^4 + 7a^6)$$ the power of a prime number?
Does there exist a set $ M$ with the following properties?
[i](i)[/i] The set $ M$ consists of 1992 natural numbers.
[i](ii)[/i] Every element in $ M$ and the sum of any number of elements have the form $ m^k$ $ (m, k \in \mathbb{N}, k \geq 2).$
Give an example of four pairwise distinct natural numbers $a$, $b$, $c$ and $d$ such that $$a^2 + b^3 + c^4 = d^5.$$
Show that there exists a set of infinite positive integers such that the sum of an arbitrary finite subset of these is never a perfect square. What happens if we change the condition from not being a perfect square to not being a perfect power?
Do there exist positive integers $a \ne b$ such that $ a+b$ is a perfect square and $a^3 +b^3$ is a fourth power of an integer?
For all positive integers $a$ and $b$, we de ne $a @ b = \frac{a - b}{gcd(a, b)}$ .
Show that for every integer $n > 1$, the following holds:
$n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.
Prove that none of the numbers $11, 111, 1111, ...$ is a square number, cube number or higher power of a natural number.
Is it possible to pair up the numbers $0, 1, 2, 3,... , 61$ in such a way that when we sum each pair, the product of the $31$ numbers we get is a perfect f ifth power?
Let $x$ be the smallest positive integer for which $2x$ is the square of an integer, $3x$ is the third power of an integer, and $5x$ is the fifth power of an integer. Find the prime factorization of $x$.
(St. Wagner, Stellenbosch University)
Given that $x$ and $y$ are positive integers such that $xy^{433}$ is a perfect 2016-power of a positive integer, prove that $x^{433}y$ is also a perfect 2016-power.