Suppose that $S\subseteq \mathbb Z$ has the following property: if $a,b\in S$, then $a+b\in S$. Further, we know that $S$ has at least one negative element and one positive element. Is the following statement true? There exists an integer $d$ such that for every $x\in \mathbb Z$, $x\in S$ if and only if $d|x$. proposed by Mahyar Sefidgaran
Problem
Source: Iran 3rd round 2011-number theory exam-p1
Tags: algorithm, number theory proposed, number theory
05.09.2011 21:30
Yes, where $d=gcd(a,b)$ with the Bezout-Bachet-theorem.
13.09.2011 17:26
We are told the sets $N = \{-x \mid x \in S, x < 0\}$ and $P = \{y \mid y \in S, y > 0\}$ are both non-empty. Let $n= \min N$ and $s = \min S$ (they exist since $N, S \subseteq \mathbb{N}^*$, which is well-ordered). If $n\neq s$ then $0\neq s-n \in S$, and $|s-n| < \max(n,s)$, contradiction. Therefore $n = s$ (and so $0\in S$); denote this common value $d$. For $y \in P$ we have $y\geq d$, thus by Euclid's algorithm $y=qd + r$, with $0\leq r < d$. But then $r = y-qd = y+q(-d) \in S$, so $r=0$. Similar argument for $x\in N$. Therefore $S \subseteq d\mathbb{Z}$. The converse is trivial.
15.09.2011 20:21
what about if $ 1 $ is in $ S $?
15.09.2011 20:23
then $S=\mathbb Z$. what's the problem??
16.09.2011 06:07
oh yes.....sorry