Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Math Forum
»
Discussions
»
Inactive
»
k12.ed.math
Notice: We are no longer accepting new posts, but the forums will continue to be readable.
Topic:
lovely proof problem
Replies:
1
Last Post:
Sep 21, 2009 8:49 AM




Re: lovely proof problem
Posted:
May 6, 1999 1:04 AM


Anonymous writes: >This is a problem I got for my computer sciencediscrete math class: > >Prove or disprove that the product of a nonzero rational number and an >irrational number is irrational using one of the following: direct proof >(of the form p > q), indirect proof (of the form ~q > ~p), proof by >contradiction (so that ~p > q is true, then ~p must be false, so p must be >true).
What does this have to do with discrete math?
(Perhaps it's just that nobody learns what a proof is in their nondiscrete math classes any more?)
Anyway, which proof techniques can be used depends a lot on what theorems we already have available. Since the definition of an irrational number is based on a property it DOESN'T have, I'm betting that any proof will turn out to involve some use of proof by contradiction somewhere along the line, although that might be hidden in the proof of a previous theorem.
 message approved for posting by k12.ed.math moderator k12.ed.math is a moderated newsgroup. charter for the newsgroup at www.wenet.net/~cking/sheila/charter.html submissions: post to k12.ed.math or email to k12math@sd28.bc.ca



