prime

1
Proof that if p is prime, then 3 p is irrational Proof. Assume not. Assume that given a prime p, 3 p is rational. By the Unique Prime Factorization Theorem, we have that we can write 3 p = q a 1 1 * q a 2 2 * ... * q an n where q i is prime i, and a i Z i = ( 3 p) 3 = q 3a 1 1 * q 3a 2 2 * ... * q 3an n = p 1 = q 3a 1 1 * q 3a 2 2 * ... * q 3an n Since p is a prime, by the Unique Prime Factorization Theorem, we have that p 1 = q 3a i i for some i. But that means that 1 = 3a i for some i, where a i Z. So a i = 1 3 , but a i Z. Contradiction. Therefore, the assumption that 3 p is rational is false. = that if p is prime, 3 p is irrational. 1

Upload: mathew

Post on 26-Jan-2016

218 views

Category:

Documents


0 download

DESCRIPTION

Proof that if p is prime, then the cubed root of p is irrational.

TRANSCRIPT

Page 1: Prime

Proof that if p is prime, then 3√p is irrational

Proof.Assume not. Assume that given a prime p, 3

√p is rational.

By the Unique Prime Factorization Theorem, we have that we can write

3√p = qa11 ∗ q

a22 ∗ ... ∗ q

ann

where qi is prime ∀i, and ai ∈ Z ∀i

=⇒ ( 3√p)3 = q3a11 ∗ q3a22 ∗ ... ∗ q3ann

=⇒ p1 = q3a11 ∗ q3a22 ∗ ... ∗ q3ann

Since p is a prime, by the Unique Prime Factorization Theorem, we havethat p1 = q3aii for some i. But that means that 1 = 3ai for some i, whereai ∈ Z. So ai =

13 , but ai ∈ Z.

Contradiction. Therefore, the assumption that 3√p is rational is false.

=⇒ that if p is prime, 3√p is irrational.

1