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 $\sqrt{4}$ is rational,
$$\begin{align}
\sqrt{4} &=p/q \qquad\text{where pand q are coprimes} \\
4 &=p^2/q^2\\
4q^2&=p^2 \tag{1} \\
4&\mid p^2\\
4&\mid p\\
\text {let }p&=4m \qquad\text{for some natural no. m} \\
p^2&=16m^2\\
4q^2&=16m^2 \qquad\text{(from (1) )}\\
q^2&=4m^2\\
4& \mid q^2\\
4&\mid q
\end{align}
$$
but this contradicts our assumption that $p$ and $q$ are coprime since they have a common factor $p$. Hence $\sqrt{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 $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 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=...
-
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<0=0)$...
-
The question said: Use the Euclidean Algorithm to find gcd $(1207,569)$ and write $(1207,569)$ as an integer linear combination of $1207$ ...
No comments:
Post a Comment