Hi,(adsbygoogle = window.adsbygoogle || []).push({});

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 im not really sure on how to proceed to prove in the other direction =>.

Could anyone give me some hints/ proofs ?

thanks

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Constructible numbers

Loading...

Similar Threads for Constructible numbers |
---|

I Can we construct a Lie algebra from the squares of SU(1,1) |

I Orthogonal matrix construction |

A Last Gauss Lemma Section II |

B Why does every subfield of Complex number have a copy of Q? |

**Physics Forums | Science Articles, Homework Help, Discussion**