The contradiction method given in certain books to prove that sqare root of a prime is irrational also shows that sqare root of 4 is irrational, so how is it acceptable?
e.g. Suppose √4 is rational,
√4=p/qwhere pand q are coprimes4=p2/q24q2=p24∣p24∣plet p=4mfor some natural no. mp2=16m24q2=16m2(from (1) )q2=4m24∣q24∣q
but this contradicts our assumption that p and q are coprime since they have a common factor p. Hence √4 is not rational. But we know that it is a rational. Why?
Sunday, 8 June 2014
elementary number theory - The contradiction method used to prove that the square root of a prime is irrational
Subscribe to:
Post Comments (Atom)
real analysis - How to find limhrightarrow0fracsin(ha)h
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Ok, according to some notes I have, the following is true for a random variable X that can only take on positive values, i.e P(X \int_0^...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
I use Euclidean Algorithm: 4620 = 101 * 45 + 75. long story short. I get 3 = 2 * 1 + 1. After that 2 = 1 * 2 + 0. gcd(101,4620) = 1. So I us...
No comments:
Post a Comment