- #1
b0mb0nika
- 37
- 0
Hi,
I was trying to prove the following theorem:
if x is a constructible number <=> it can be obtained from Q by taking a the square root a finite number of times ( or applying a finite # of field operations).
I managed to get the proof for <= this way, but I am not really sure on how to proceed to prove in the other direction =>.
Could anyone give me some hints/ proofs ?
thanks
I was trying to prove the following theorem:
if x is a constructible number <=> it can be obtained from Q by taking a the square root a finite number of times ( or applying a finite # of field operations).
I managed to get the proof for <= this way, but I am not really sure on how to proceed to prove in the other direction =>.
Could anyone give me some hints/ proofs ?
thanks