Let m,n be elements of the Integers. If m <= n <= m then m = n. Seems obvious but I'm not sure of how to word this in a proof. Any help would be appreciated!
Follow Math Help Forum on Facebook and Google+
Originally Posted by jstarks44444 Let m,n be elements of the Integers. If m <= n <= m then m = n. Seems obvious but I'm not sure of how to word this in a proof. Any help would be appreciated! For example: suppose $\displaystyle m<n\Longrightarrow \exists\,0<k\in\mathbb{N}\,\,s.t.\,\,m+k=n$ . Develop and get a contradiction. Tonio
View Tag Cloud