Found problems: 116
Prove that infinitely many positive integers cannot be written in the form \[{x_{1}}^{3}+{x_{2}}^{5}+{x_{3}}^{7}+{x_{4}}^{9}+{x_{5}}^{11},\] where $x_{1}, x_{2}, x_{3}, x_{4}, x_{5}\in \mathbb{N}$.
$(BUL 1)$ Prove that the equation $\sqrt{x^3 + y^3 + z^3}=1969$ has no integral solutions.
In how many ways can $2^{n}$ be expressed as the sum of four squares of natural numbers?
Let $N$ be the number of integral solutions of the equation
\[x^2 - y^2 = z^3 - t^3\]
satisfying the condition $0 \leq x, y, z, t \leq 10^6$, and let $M$ be the number of integral solutions of the equation
\[x^2 - y^2 = z^3 - t^3 + 1\]
satisfying the condition $0 \leq x, y, z, t \leq 10^6$. Prove that $N >M.$
If $n$ is a positive integer which can be expressed in the form $n=a^{2}+b^{2}+c^{2}$, where $a, b, c$ are positive integers, prove that for each positive integer $k$, $n^{2k}$ can be expressed in the form $A^2 +B^2 +C^2$, where $A, B, C$ are positive integers.
An [i]Egyptian number[/i] is a positive integer that can be expressed as a sum of positive integers, not necessarily distinct, such that the sum of their reciprocals is $1$. For example, $32 = 2 + 3 + 9 + 18$ is Egyptian because $\frac 12 +\frac 13 +\frac 19 +\frac{1}{18}=1$ . Prove that all integers greater than $23$ are [i]Egyptian[/i].
Show that any integer can be expressed as a sum of two squares and a cube.
Let $n$ be a positive integer. Prove that the number of ways to express $n$ as a sum of distinct positive integers (up to order) and the number of ways to express $n$ as a sum of odd positive integers (up to order) are the same.
Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?
Let $a_{1}, a_{2}, a_{3}, \cdots$ be an increasing sequence of nonnegative integers such that every nonnegative integer can be expressed uniquely in the form $a_{i}+2a_{j}+4a_{k}$, where $i, j, $ and $k$ are not necessarily distinct. Determine $a_{1998}$.
A finite sequence of integers $a_{0}, a_{1}, \cdots, a_{n}$ is called quadratic if for each $i \in \{1,2,\cdots,n \}$ we have the equality $\vert a_{i}-a_{i-1} \vert = i^2$. [list=a] [*] Prove that for any two integers $b$ and $c$, there exists a natural number $n$ and a quadratic sequence with $a_{0}=b$ and $a_{n}=c$. [*] Find the smallest natural number $n$ for which there exists a quadratic sequence with $a_{0}=0$ and $a_{n}=1996$. [/list]
Let $ a, b, c, d,m, n \in \mathbb{Z}^\plus{}$ such that \[ a^2\plus{}b^2\plus{}c^2\plus{}d^2 \equal{} 1989,\]
\[ a\plus{}b\plus{}c\plus{}d \equal{} m^2,\] and the largest of $ a, b, c, d$ is $ n^2.$ Determine, with proof, the values of $m$ and $ n.$
Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ .
[i]Proposed by Serbia[/i]
$(GBR 2)$ Let $a, b, x, y$ be positive integers such that $a$ and $b$ have no common divisor greater than $1$. Prove that the largest number not expressible in the form $ax + by$ is $ab - a - b$. If $N(k)$ is the largest number not expressible in the form $ax + by$ in only $k$ ways, find $N(k).$
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
Show that any positive rational number can be represented as the sum of three positive rational cubes.
Show that there are infinitely many positive integers which cannot be expressed as the sum of squares.
Let $p$ be a prime with $p \equiv 1 \pmod{4}$. Let $a$ be the unique integer such that \[p=a^{2}+b^{2}, \; a \equiv-1 \pmod{4}, \; b \equiv 0 \; \pmod{2}\] Prove that \[\sum^{p-1}_{i=0}\left( \frac{i^{3}+6i^{2}+i }{p}\right) = 2 \left( \frac{2}{p}\right),\] where $\left(\frac{k}{p}\right)$ denotes the Legendre Symbol.
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
Prove that every positive integer which is not a member of the infinite set below is equal to the sum of two or more distinct numbers of the set \[\{ 3,-2, 2^{2}3,-2^{3}, \cdots, 2^{2k}3,-2^{2k+1}, \cdots \}=\{3,-2, 12,-8, 48,-32, 192, \cdots \}.\]
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$
Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?
Let $a, b, c$ be integers. Prove that there are integers $p_1, q_1, r_1, p_2, q_2, r_2$ such that
\[a = q_1r_2 - q_2r_1, b = r_1p_2 - r_2p_1, c = p_1q_2 - p_2q_1.\]
Let $m$ positive integers $a_1, \dots , a_m$ be given. Prove that there exist fewer than $2^m$ positive integers $b_1, \dots , b_n$ such that all sums of distinct $b_k$’s are distinct and all $a_i \ (i \leq m)$ occur among them.