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
Hilbert's seventh problem
(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!
==Solution== The question (in the second form) was answered in the affirmative by [[Aleksandr Gelfond]] in 1934, and refined by [[Theodor Schneider]] in 1935. This result is known as Gelfond's theorem or the [[Gelfond–Schneider theorem]]. (The restriction to irrational ''b'' is important, since it is easy to see that <math>a^b</math> is algebraic for algebraic ''a'' and rational ''b''.) From the point of view of generalizations, this is the case :<math>b \ln{\alpha} + \ln{\beta} = 0</math> of the general linear form in logarithms, which was studied by Gelfond and then solved by [[Alan Baker (mathematician)|Alan Baker]]. It is called the Gelfond conjecture or [[Baker's theorem]]. Baker was awarded a [[Fields Medal]] in 1970 for this achievement.
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)