Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Complex number
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Algebraic number theory=== [[File:Pentagon construct.gif|right|thumb|Construction of a regular pentagon [[compass and straightedge constructions|using straightedge and compass]].]] As mentioned above, any nonconstant polynomial equation (in complex coefficients) has a solution in <math>\mathbb{C}</math>. ''[[Argumentum a fortiori|A fortiori]]'', the same is true if the equation has rational coefficients. The roots of such equations are called [[algebraic number]]s β they are a principal object of study in [[algebraic number theory]]. Compared to <math>\overline{\mathbb{Q}}</math>, the algebraic closure of <math>\mathbb{Q}</math>, which also contains all algebraic numbers, <math>\mathbb{C}</math> has the advantage of being easily understandable in geometric terms. In this way, algebraic methods can be used to study geometric questions and vice versa. With algebraic methods, more specifically applying the machinery of [[field theory (mathematics)|field theory]] to the [[number field]] containing [[root of unity|roots of unity]], it can be shown that it is not possible to construct a regular [[nonagon]] [[compass and straightedge constructions|using only compass and straightedge]] β a purely geometric problem. Another example is the [[Gaussian integer]]s; that is, numbers of the form {{math|''x'' + ''iy''}}, where {{mvar|x}} and {{mvar|y}} are integers, which can be used to classify [[Fermat's theorem on sums of two squares|sums of squares]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)