Timeline for $f(x_1,x_2,x_3,\ldots,x_n)$ Maximum how many different results can have with all permutation of inputs?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2016 at 2:25 | comment | added | Tito Piezas III | The function you describe involve what we call Lagrange resolvents. The situation is a bit more complicated. For an eqn of odd prime degree $p$, you need a resolvent of degree $p-1$ with coefficients that are algebraic numbers of $(p-2)!$ deg. Thus, for $p=3$, you only get a quadratic resolvent. However, for $p=5$, you'll need to solve a $(5-2)!=3!=6$ deg eqn. For $p=7$ it is already $(7-2)!=5!=120$ deg eqn. And so on. | |
| Feb 27, 2013 at 15:22 | history | edited | Mathlover | CC BY-SA 3.0 |
deleted 2 characters in body; edited tags
|
| Mar 19, 2012 at 9:41 | history | asked | Mathlover | CC BY-SA 3.0 |