Found problems: 116
PEN P Problems, 32
A composite positive integer is a product $ab$ with $a$ and $b$ not necessarily distinct integers in $\{2,3,4,\dots\}$. Show that every composite positive integer is expressible as $xy+xz+yz+1$, with $x,y,z$ positive integers.
1999 IMO Shortlist, 4
Let $A$ be a set of $N$ residues $\pmod{N^{2}}$. Prove that there exists a set $B$ of of $N$ residues $\pmod{N^{2}}$ such that $A + B = \{a+b|a \in A, b \in B\}$ contains at least half of all the residues $\pmod{N^{2}}$.
PEN P Problems, 17
Let $p$ be a prime number of the form $4k+1$. Suppose that $r$ is a quadratic residue of $p$ and that $s$ is a quadratic nonresidue of $p$. Show that $p=a^{2}+b^{2}$, where \[a=\frac{1}{2}\sum^{p-1}_{i=1}\left( \frac{i(i^{2}-r)}{p}\right), b=\frac{1}{2}\sum^{p-1}_{i=1}\left( \frac{i(i^{2}-s)}{p}\right).\] Here, $\left( \frac{k}{p}\right)$ denotes the Legendre Symbol.
PEN P Problems, 37
Let $S_{n}=\{1,n,n^{2},n^{3}, \cdots \}$, where $n$ is an integer greater than $1$. Find the smallest number $k=k(n)$ such that there is a number which may be expressed as a sum of $k$ (possibly repeated) elements in $S_{n}$ in more than one way. (Rearrangements are considered the same.)
2000 IMO Shortlist, 6
Let $ p$ and $ q$ be relatively prime positive integers. A subset $ S$ of $ \{0, 1, 2, \ldots \}$ is called [b]ideal[/b] if $ 0 \in S$ and for each element $ n \in S,$ the integers $ n \plus{} p$ and $ n \plus{} q$ belong to $ S.$ Determine the number of ideal subsets of $ \{0, 1, 2, \ldots \}.$
2006 QEDMO 2nd, 12
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.
PEN P Problems, 23
Show that there are infinitely many positive integers which cannot be expressed as the sum of squares.
1966 IMO Longlists, 11
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$ ?
1992 IMO Shortlist, 21
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.$
PEN P Problems, 25
Let $a$ and $b$ be positive integers with $\gcd(a, b)=1$. Show that every integer greater than $ab-a-b$ can be expressed in the form $ax+by$, where $x, y \in \mathbb{N}_{0}$.
2002 India IMO Training Camp, 16
Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?
1992 IMO Longlists, 45
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.
2015 India IMO Training Camp, 1
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]
1983 IMO Shortlist, 15
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.$
1978 USAMO, 3
An integer $n$ will be called [i]good[/i] if we can write \[n=a_1+a_2+\cdots+a_k,\] where $a_1,a_2, \ldots, a_k$ are positive integers (not necessarily distinct) satisfying \[\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=1.\] Given the information that the integers 33 through 73 are good, prove that every integer $\ge 33$ is good.
2010 APMO, 2
For a positive integer $k,$ call an integer a $pure$ $k-th$ $power$ if it can be represented as $m^k$ for some integer $m.$ Show that for every positive integer $n,$ there exists $n$ distinct positive integers such that their sum is a pure $2009-$th power and their product is a pure $2010-$th power.
2012 ELMO Shortlist, 3
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]
1969 IMO Longlists, 18
$(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$
1983 IMO Shortlist, 18
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.
1983 IMO Longlists, 27
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.
1975 IMO Shortlist, 11
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.$
1992 IMO, 3
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.$
PEN P Problems, 24
Show that any integer can be expressed as the form $a^{2}+b^{2}-c^{2}$, where $a, b, c \in \mathbb{Z}$.
2002 India IMO Training Camp, 16
Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?
PEN P Problems, 38
Find the smallest possible $n$ for which there exist integers $x_{1}$, $x_{2}$, $\cdots$, $x_{n}$ such that each integer between $1000$ and $2000$ (inclusive) can be written as the sum (without repetition), of one or more of the integers $x_{1}$, $x_{2}$, $\cdots$, $x_{n}$.