Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Yes, I just went for something really basic to give an example of a semi-implicit indirect proof.

I spent years of my life reading mathematics, so I do not trust myself to judge how hard a piece of mathematics is for outsiders. I find the proof cited is easy to read.

About your addendum: You could have a look at Alexander Schrijver's "Combinatorial Optimization: Polyhedra and Efficiency". The interesting thing about its style is, that the author manages to make all lines require constant thought, while in most books there are really hard and really easy parts.



Maybe I am too well-trained in this, but I think using 'Suppose' (or "assume") is a dead giveaway for a proof by contradiction.

The only semi-implicit ways to start a proof by contradiction I can think of are the phrases "if x is..." or (less implicit) "if x were...".




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: