Thread: Proof using WOP

Hello everyone,

I want to prove that for postive integers . I want to do this using the WOP. Here's what I have done so far:

Suppose for some postive integer such that . By the WOP, there exists a smallest such that . Now I think I may have to apply the WOP again, but am not sure. Any advice?

Thanks a lot,

Kevin

Originally Posted by kmerfeld

P.S. Is there a way to enter LaTex code?

[TEX]x+y\ne y [/TEX] gives
If you click on the “go advanced tab” you should see on the tool-bar. That gives the [TEX]..[/TEX] wrap. Your LaTeX code goes between them.

Got it. Thanks