Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tel
on Aug 16, 2024
|
parent
|
context
|
favorite
| on:
Galois Theory
You could think of it as a proof saying which polynomials are solvable by which algorithms. Solvable by radicals is one class of simpler algorithm and it so happens we have a cute proof as to when it will work or fail.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: