Proving that cube root 7 is irrational

TalonStriker
Messages
14
Reaction score
0
Hi guys,

How would you prove that \sqrt[3]{7} is irrational without using the unique factorization thrm? I tried proving that \sqrt[3]{7} is rational but it didn't seem to get me anywhere...

Thanks

EDIT: Looks like I posted this in the wrong forum.
 
Last edited:
Physics news on Phys.org
I would be inclined to mimic the classic Euclid proof that \sqrt{2} is irrational.

Assume that \sqrt{7} is rational. That is, assume \sqrt{7}= \frac{m}{n} for integers m and n, reduced to lowest terms. Then, cubing both sides, 7= \frac{m^3}{n^3} so 7n3= m3. That tells us that m3 is a multiple of 7. Can you use that to prove that m itself must be a multiple of 7? Remember that in proving that if m2 is even, the m must be even, we have to show that the square of an odd number is always odd. Here, you will have to look at numbers that are not multiples of 7. Is it possible for the third power of a number that is not a multiple of 7 to be a multiple of 7? You will have to look at 6 different cases.
 
Last edited by a moderator:
HallsofIvy said:
I would be inclined to mimic the classic Euclid proof that \sqrt{2} is irrational.

Assume that \sqrt{7} is rational. That is, assume \sqrt{7}= \frac{m}{n} for integers m and n, reduced to lowest terms. Then, cubing both sides, 7= \frac{m^3}{n^3} so 7n3= m3. That tells us that m3 is a multiple of 7. Can you use that to prove that m itself must be a multiple of 7? Remember that in profing that if m2 is even, the m must be even, we have to show that the square of an odd number is always odd. Here, you will have to look at numbers that are not multiples of 7. Is it possible for the third power of a number that is not a multiple of 7 to be a multiple of 7? You will have to look at 6 different cases.

Yes I can prove that m^{3} mod 7 = 0 implies mod 7 = 0. I assume that the next step would be set m=7k. Then plug it into the previous formula which would yield something like

7n^{3} = 7 * 49k^{3} using this I can prove that n % 7 = 0. So m/n has a common factor, which contracts one of the premises.

And that would be the proof, correct?
 
Yes, that was exactly what I meant.
 
thanks!
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top