Talk About Network

Google


Register and Login
Nick
Password
Register create new account Sign up is FREE and you can post replies, new topics, bookmark posts and more!
Recover lost password


Education > Math > Re: Proof by co...
Latest [ Topics | Posts ] Archive Post A New Topic Post a Reply
<< Topic < Post Post 2 of 4 Topic 4016 of 4322
Post > Topic >>

Re: Proof by contradiction

by "[Mr.] Lynn Kurtz" <kurtz@[EMAIL PROTECTED] > Apr 9, 2008 at 05:56 PM

On Wed, 9 Apr 2008 07:19:59 -0700 (PDT), "yongtze.tan@[EMAIL PROTECTED]
"
<yongtze.tan@[EMAIL PROTECTED]
> wrote:

>I'm having trouble with this proof:
>
>if n is an integer, and if log_2_n is rational, proof that log_2_n
>must be integer.
>
>Can anyone help? the base of the log is 2.

Suppose log_2(n) = p/q where p, q integers and the fraction is reduced
to lowest terms.

Then 2^(p/q) = n so 2^p = n^q

What can n have for factors? Can you get a contradiction from this?

--Lynn
 




 4 Posts in Topic:
Proof by contradiction
"yongtze.tan@[EMAIL   2008-04-09 07:19:59 
Re: Proof by contradiction
"[Mr.] Lynn Kurtz&qu  2008-04-09 17:56:38 
Re: Proof by contradiction
"yongtze.tan@[EMAIL   2008-04-09 13:01:13 
Re: Proof by contradiction
"[Mr.] Lynn Kurtz&qu  2008-04-10 01:26:27 

Post A Reply:
  Go here to Signup

AddThis Feed Button


About - Advertising - Contact - Frequently Asked Questions - Privacy Policy - Terms of Use - Signup

Contact
tan12V112 Fri Nov 21 7:40:37 CST 2008.