>Let $F$ be an ordered field.
Suppose $S$ is a subset of $F$ and $y$ an element of $F$, and let $T = \{s+y | s∈S\}$. If $S$
has a least upper bound, sup $S$, then $T$ also has a least upper bound, namely $(\sup S)+ y$. <P> Deduce from this that if $x$ is a nonzero element of $F$ and we let $S = \{nx : n\text{ is an integer}\}$, then S
has no least upper bound.