Found problems: 116
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$ be a non-negative integer. Find all non-negative integers $a$, $b$, $c$, $d$ such that \[a^{2}+b^{2}+c^{2}+d^{2}= 7 \cdot 4^{n}.\]
For each positive integer $\,n,\;S(n)\,$ is defined to be the greatest integer such that, for every positive integer $\,k\leq S(n),\;n^{2}\,$ can be written as the sum of $\,k\,$ positive squares.
[b]a.)[/b] Prove that $\,S(n)\leq n^{2}-14\,$ for each $\,n\geq 4$.
[b]b.)[/b] Find an integer $\,n\,$ such that $\,S(n)=n^{2}-14$.
[b]c.)[/b] Prove that there are infintely many integers $\,n\,$ such that $S(n)=n^{2}-14.$
Let $a_{1}=1$, $a_{2}=2$, $a_{3}$, $a_{4}$, $\cdots$ be the sequence of positive integers of the form $2^{\alpha}3^{\beta}$, where $\alpha$ and $\beta$ are nonnegative integers. Prove that every positive integer is expressible in the form \[a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}},\] where no summand is a multiple of any other.
Let $a,b$ and $c$ be positive integers, no two of which have a common divisor greater than $1$. Show that $2abc-ab-bc-ca$ is the largest integer which cannot be expressed in the form $xbc+yca+zab$, where $x,y,z$ are non-negative integers.
Decide whether there exists a set $M$ of positive integers satisfying the following conditions:
(i) For any natural number $m>1$ there exist $a, b \in M$ such that $a+b = m.$
(ii) If $a, b, c, d \in M$, $a, b, c, d > 10$ and $a + b = c + d$, then $a = c$ or $a = d.$
Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?
Given positive integer $n$. Prove that for any integers $a_1,a_2,\cdots,a_n,$ at least $\lceil \tfrac{n(n-6)}{19} \rceil$ numbers from the set $\{ 1,2, \cdots, \tfrac{n(n-1)}{2} \}$ cannot be represented as $a_i-a_j (1 \le i, j \le n)$.
$(CZS 2)$ Let $p$ be a prime odd number. Is it possible to find $p-1$ natural numbers $n + 1, n + 2, . . . , n + p -1$ such that the sum of the squares of these numbers is divisible by the sum of these numbers?
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.$
$(FRA 1)$ Let $a$ and $b$ be two nonnegative integers. Denote by $H(a, b)$ the set of numbers $n$ of the form $n = pa + qb,$ where $p$ and $q$ are positive integers. Determine $H(a) = H(a, a)$. Prove that if $a \neq b,$ it is enough to know all the sets $H(a, b)$ for coprime numbers $a, b$ in order to know all the sets $H(a, b)$. Prove that in the case of coprime numbers $a$ and $b, H(a, b)$ contains all numbers greater than or equal to $\omega = (a - 1)(b -1)$ and also $\frac{\omega}{2}$ numbers smaller than $\omega$
Let $s(k)$ be the number of ways to express $k$ as the sum of distinct $2012^{th}$ powers, where order does not matter. Show that for every real number $c$ there exists an integer $n$ such that $s(n)>cn$.
[i]Alex Zhu.[/i]
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]
Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?
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]
Show that the set of positive integers which cannot be represented as a sum of distinct perfect squares is finite.
Let $s(k)$ be the number of ways to express $k$ as the sum of distinct $2012^{th}$ powers, where order does not matter. Show that for every real number $c$ there exists an integer $n$ such that $s(n)>cn$.
[i]Alex Zhu.[/i]
For each positive integer $n$, let $f(n)$ denote the number of ways of representing $n$ as a sum of powers of 2 with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, $f(4)=4$, because the number $4$ can be represented in the following four ways: \[4, 2+2, 2+1+1, 1+1+1+1.\] Prove that, for any integer $n \geq 3$, \[2^{n^{2}/4}< f(2^{n}) < 2^{n^{2}/2}.\]
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.$
$(CZS 2)$ Let $p$ be a prime odd number. Is it possible to find $p-1$ natural numbers $n + 1, n + 2, . . . , n + p -1$ such that the sum of the squares of these numbers is divisible by the sum of these numbers?
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 $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.
Let $k$ and $s$ be odd positive integers such that \[\sqrt{3k-2}-1 \le s \le \sqrt{4k}.\] Show that there are nonnegative integers $t$, $u$, $v$, and $w$ such that \[k=t^{2}+u^{2}+v^{2}+w^{2}, \;\; \text{and}\;\; s=t+u+v+w.\]
Show that every integer greater than $1$ can be written as a sum of two square-free integers.
For each positive integer $\,n,\;S(n)\,$ is defined to be the greatest integer such that, for every positive integer $\,k\leq S(n),\;n^{2}\,$ can be written as the sum of $\,k\,$ positive squares.
[b]a.)[/b] Prove that $\,S(n)\leq n^{2}-14\,$ for each $\,n\geq 4$.
[b]b.)[/b] Find an integer $\,n\,$ such that $\,S(n)=n^{2}-14$.
[b]c.)[/b] Prove that there are infintely many integers $\,n\,$ such that $S(n)=n^{2}-14.$