Video/Why There's 'No' Quintic Formula (without Galois theory)

From PKC
Revision as of 04:30, 26 May 2023 by Benkoo2 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Turner, Carl (Jul 5, 2021). Why There's 'No' Quintic Formula (without Galois theory). local page: not all wrong. 

The transcript by Assembly AI is here:Transcript

Excerpts from Youtube Page

Feel free to skip to 10:28 to see how to develop Vladimir Arnold's amazingly beautiful argument for the non-existence of a general algebraic formula for solving quintic equations! This result, known as the Abel-Ruffini theorem, is usually proved by Galois theory, which is hard and not very intuitive. But this approach uses little more than some basic properties of complex numbers. (PS: I forgot to mention Abel's original approach, which is a bit grim, and gives very little intuition at all!)

Must see video on this subject

For those of you who have seen this video, you must also watch the video[1] by Trevor Cheung of Mathemaniac.

Critical Connection to Petri Net

In the famous Dinning Philosopher problem, it is standard to start with at least five participants. The reason is obvious that any number below this, will have trivial behavior. However, there was rarely a document that I have found on the web that directly answers why this is the case.

The Quintic Formula

It is until I saw the explanations[2][3][4] of why there are no solutions for Quintic Formula, that finally gave me the convincing argument. It has to do with the infinite combinatorial possibilities generator by five commutators.


References

Related Pages

Organized by:not all wrong Presented by:Carl Turner