# Thread:

1. ## Proof using WOP

Hello everyone,

I want to prove that for postive integers $x, y, x+y \ne y$. I want to do this using the WOP. Here's what I have done so far:

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

Thanks a lot,

Kevin

2. ## Re: Proof using WOP

Originally Posted by kmerfeld
P.S. Is there a way to enter LaTex code?
[TEX]x+y\ne y [/TEX] gives $x+y\ne y$
If you click on the “go advanced tab” you should see $\boxed{\Sigma}$ on the tool-bar. That gives the [TEX]..[/TEX] wrap. Your LaTeX code goes between them.

3. ## Re: Proof using WOP

$x+y\ne y$ Got it. Thanks

#### Search Tags

View Tag Cloud

Copyright © 2005-2013 Math Help Forum. All rights reserved.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8807801008224487, "perplexity_flag": "middle"}