Question #115952
Prove or disprove that 2 +(11)^1/2 , beloong to Q
1
Expert's answer
2020-05-15T15:08:59-0400

Let's show that 2+11Q2 + \sqrt{11} \notin Q . We will use the fact, that if rQr \in Q , then r=pq,q0,p,qZr = \frac{p}{q}, q\neq0,p,q \in Z, and gcd(p,q)=1gcd(p,q) = 1 . Let's assume 2+11Q2 + \sqrt{11} \in Q . Then 2+11=p1q1,q10,p1,q1Z,gcd(p1,q1)=1.2 + \sqrt{11} = \frac{p_1}{q_1}, q_1 \neq 0, p_1,q_1 \in Z, gcd(p_1, q_1) =1. Hence, 11=p12q1q1.\sqrt{11} = \frac{p_1 - 2q_1}{q_1}. Now, we notice that q1q_1 still 0\neq 0 , q1,p12q1Zq_1, p_1 - 2q_1 \in Z and gcd(p12q1,q1)=1gcd(p_1 - 2q_1, q_1) =1. The last equation is true since, using the property of gcd, namely: gcd(a,b)=gcd(b,amodb)gcd(a,b) = gcd(b, a \mod b) for a=p12q1,b=q1,a = p_1 - 2q_1, b = q_1, we obtain, that:

gcd(p12q1,q1)=gcd(q1,p1modq1)=gcd(p1,q1)=1.gcd(p_1 - 2q_1, q_1) = gcd(q_1, p_1 \mod q_1) = gcd(p_1, q_1) = 1. Hence, 11Q\sqrt{11} \in Q. Let's now assume that:

11=pq,q0,p,qZ,gcd(p,q)=1.\sqrt{11} = \frac{p}{q}, q \neq 0, p,q \in Z, gcd(p,q) = 1. Then, 11=p2q211 = \frac{p^2}{q^2}, and p2=11q2p^2 = 11q^2 . We obtain that p2p^2 is divisible by 11, and since 11 is prime, pp is also divisible by 11. Then p=11p0,p0Zp = 11p_0, p_0 \in Z . So:11q2=p2=112p0211q^2 = p^2 = 11^2{p_0}^2 , therefore q2=11p02q^2 = 11{p_0}^2 . So, q2q^2 is also divisible by 11, and since 11 is still prime, so is qq . Hence, q=11q0,q0Zq = 11q_0, q_0 \in Z. But this means that gcd(p,q)=gcd(11p0,11q0)11gcd(p,q) = gcd(11p_0, 11q_0) \ge 11 . So, we obtained the contradiction (gcd(p,q)=1gcd(p,q) = 1) with the assumption 2+11Q2 + \sqrt{11} \in Q . Thus, 2+11Q2 + \sqrt{11} \notin Q .


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS