Confirmation of irrational proof

  • Thread starter Thread starter Jbreezy
  • Start date Start date
  • Tags Tags
    Irrational Proof
Click For Summary

Homework Help Overview

The discussion revolves around proving that the square root of a number \( n \) is irrational. The original poster presents an argument involving irreducible fractions and divisibility, questioning the validity of their proof and seeking feedback on potential errors.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants explore the proof's structure, questioning where it may fail, particularly in cases where \( n \) is a perfect square like 4. There is a focus on the necessity of specifying conditions for \( n \) and the implications of divisibility in the argument.

Discussion Status

The discussion is active, with participants providing insights into the proof's shortcomings and suggesting that certain assumptions need clarification. Some participants indicate that the proof fails under specific conditions, while others emphasize the need for a more rigorous argument regarding divisibility.

Contextual Notes

Participants note that the original proof does not account for cases where \( n \) is a perfect square, which is crucial for the validity of the argument. There is also mention of the requirement that \( n \) not be a perfect square as stated in the source material.

Jbreezy
Messages
582
Reaction score
0

Homework Statement



Prove ##\sqrt n## is irrational

Homework Equations





The Attempt at a Solution





Assume ## p^2/q^2 = n ## is an irreducible fraction.
If ##p^2 = nq^2##, then q is a multiple of n. Call this ##p' = nq##
substituting this for our original equation. We get ##p'^2 = nq^2##
Implies ##(nq)^2 = nq^2## thus our original assumption is false.

Is this horse crap? Don't just give it away if it is wrong please just indicate where I went wrong.
 
Physics news on Phys.org
Where does this proof fail if ##n=4##?
 
Jbreezy said:

Homework Statement



Prove ##\sqrt n## is irrational

Homework Equations





The Attempt at a Solution





Assume ## p^2/q^2 = n ## is an irreducible fraction.
If ##p^2 = nq^2##, then q is a multiple of n. Call this ##p' = nq##
substituting this for our original equation. We get ##p'^2 = nq^2##
Implies ##(nq)^2 = nq^2## thus our original assumption is false.

Is this horse crap? Don't just give it away if it is wrong please just indicate where I went wrong.
Does it bother you at all that the statement you claim to have proved is NOT true? What if, say, n= 4? What happens to your proof in that case?

It is, of course, true if you add the requirement that n is NOT a "perfect square". How have you used that requirement in your proof?
 
micromass said:
Where does this proof fail if ##n=4##?

Would if fail with this assumption right off the bat?

Assume ##p/q = \sqrt4 ## is an irreducible fraction.
Because ## p/q = 2 ##
 
Jbreezy said:
Would if fail with this assumption right off the bat?

Assume ##p/q = \sqrt4 ## is an irreducible fraction.
Because ## p/q = 2 ##

OK, so your proof does fail for some ##n##. Your proof should make this clear.
 
  • Like
Likes   Reactions: 1 person
Yeah, I should of just included the condition because it was given in the book just excluded it in my post.
Thanks for the help
 
Jbreezy said:

Homework Statement



Prove ##\sqrt n## is irrational

Homework Equations





The Attempt at a Solution





Assume ## p^2/q^2 = n ## is an irreducible fraction.
If ##p^2 = nq^2##, then q is a multiple of n. Call this ##p' = nq##
substituting this for our original equation. We get ##p'^2 = nq^2##
Implies ##(nq)^2 = nq^2## thus our original assumption is false.

Is this horse crap? Don't just give it away if it is wrong please just indicate where I went wrong.

Your argument is incomplete. Essentially, you claim that if p^2 is divisible by n then p itself is also divisible by n. You cannot just say it---you need to prove it.

BTW: it is not always true for all integers n, so something about n needs to be specified.
 
Ray Vickson said:
Your argument is incomplete. Essentially, you claim that if p^2 is divisible by n then p itself is also divisible by n. You cannot just say it---you need to prove it.

BTW: it is not always true for all integers n, so something about n needs to be specified.

Yeah, I fooled myself. Let's see if I did it again. What about:

##p/q = \sqrt n ##, Assume ## (p,q) = 1 ## and ##n ## is not a perfect square.

Squaring, we have, ## p^2 = nq^2 ##


If ## n=/= 1## There exists a prime integer ## k## such that ## k/n##

Substitution gives:

## p^2 = (n/k)q^2. ## Implies that ## kp^2 = nq^2 ## and since we know that that k divides n, ##p^2 ## and ## q^2 ## share a common factor.Thus, our assumption ## (p,q) = 1 ## is false so ## \sqrt n ## is irrational.


What do you think Ray trick myself again?
 
This is crap. I need to think
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 21 ·
Replies
21
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
5
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K