I am looking for nice ways of proving that 1 is the least upper bound of the set $A=\{\frac{1}{y+x};x>1\}$ where y>0 is fixed.
One (not so nice and unachieved) way is to first prove that 1 is a upper bound of any element of A and then use the characterization of the least upper bound (i) ($\forall\varepsilon>0;\exists a\in A:1-\varepsilon<a$) :
Let $\varepsilon>0 ; n\in \mathbb{N}\setminus\lbrace{0}\rbrace$
We put y=1 and suppose there exists x such that (i) is verified, then we put: $1-\varepsilon<\frac{1}{1+(\frac{1}{n}+1)}$
Thus:$$\begin{align*}1-\varepsilon<\frac{n}{2n+1}\\ 1-\varepsilon<\frac{1}{2}(1-\frac{1}{2n+1})\\ (2n+1)(2\varepsilon-1)>1\end{align*}$$ If $\varepsilon>\frac{1}{2}$, then $2\varepsilon-1>0$. As $\mathbb{R}$ is archimedean: $\exists n_{0}\in\mathbb{N}\setminus\lbrace{0}\rbrace:(2n_{0}+1)\in\mathbb{N}\setminus\lbrace{0}\rbrace, (2n_{0}+1)(2\varepsilon-1)>1$. So (i) is verified in this case ($\varepsilon>\frac{1}{2}$).
If $0<\varepsilon<\frac{1}{2}$ then $$\begin{align*}2n+1<\frac{1}{2\varepsilon-1}<-1\\ 2n+1<-1\\ n<-1\end{align*}$$ which is impossible. So for $0<\varepsilon<\frac{1}{2}$ we must choose another x different from $1+\frac{1}{n}$ to prove the condition (i). I tried with x=n+1 but it's a little bit complicated. THANK FOR HELPING!