Hyper-simultaneous equationHow to form a cubic equation with the substitution method?Solving a nonlinear...
Is this toilet slogan correct usage of the English language?
What's the difference between releasing hormones and tropic hormones?
Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?
What should you do if you miss a job interview (deliberately)?
It grows, but water kills it
How can I write humor as character trait?
Non-trope happy ending?
How do apertures which seem too large to physically fit work?
Why does the Sun have different day lengths, but not the gas giants?
How does a computer interpret real numbers?
The probability of Bus A arriving before Bus B
Lowest total scrabble score
Store Credit Card Information in Password Manager?
Is there a RAID 0 Equivalent for RAM?
When were female captains banned from Starfleet?
Temporarily disable WLAN internet access for children, but allow it for adults
Why does a simple loop result in ASYNC_NETWORK_IO waits?
What happens if you are holding an Iron Flask with a demon inside and walk into an Antimagic Field?
Mimic lecturing on blackboard, facing audience
Open a doc from terminal, but not by its name
Multiplicative persistence
Calculating total slots
How to explain what's wrong with this application of the chain rule?
What exact color does ozone gas have?
Hyper-simultaneous equation
How to form a cubic equation with the substitution method?Solving a nonlinear system of equations.Solving $4y^4 - 4x^4 + x + y = 0$ (equation system of partial derivates)System of symmetric equationsFactorisation of polynomials without polynomial divisionFind the two values of $k$ for which $2x^3-9x^2+12x-k$ has a double real root.How do I derive the cubic formula? (without substitutions)Factoring degree 3 and higher polynomial not using factor theoremPolynomial sum relationDepressing the cubic, substitution
$begingroup$
I am new here and of course I would like to be specific. I've found a general solution to the following system:
If $a$, $b$ and $c$ are given such that:
$$
x+y+z=a
$$
$$
x²+y²+z²=b
$$
$$
xⁿ+yⁿ+zⁿ=c
$$
Where $n=8$.
$x$, $y$ and $z$ could be devised using the method I have derived.
I just want to basically ask if this kind of thing is publishable. Thanks for your reply in anticipation.
polynomials
$endgroup$
add a comment |
$begingroup$
I am new here and of course I would like to be specific. I've found a general solution to the following system:
If $a$, $b$ and $c$ are given such that:
$$
x+y+z=a
$$
$$
x²+y²+z²=b
$$
$$
xⁿ+yⁿ+zⁿ=c
$$
Where $n=8$.
$x$, $y$ and $z$ could be devised using the method I have derived.
I just want to basically ask if this kind of thing is publishable. Thanks for your reply in anticipation.
polynomials
$endgroup$
1
$begingroup$
Publishable it might as well be. Unless there is something super special about the method itself, I would not expect to publish in a journal, but rather on a conference paper. Note that MathOverflow (instead of MathStackExchange) might be more suitable for research-level mathematics.
$endgroup$
– Mefitico
Mar 13 at 16:41
$begingroup$
Thanks for this sir. I will take that into account. But pls, how do I switch to mathoverflow?
$endgroup$
– Lateef Suaib
Mar 13 at 17:08
$begingroup$
Here you go!
$endgroup$
– Mefitico
Mar 13 at 17:15
$begingroup$
Thanks sir! I really appreciate your response.
$endgroup$
– Lateef Suaib
Mar 13 at 18:32
$begingroup$
For me to not be too delusional about my method, please, looking at the system, can it be easily solved without much stress?
$endgroup$
– Lateef Suaib
Mar 13 at 18:36
add a comment |
$begingroup$
I am new here and of course I would like to be specific. I've found a general solution to the following system:
If $a$, $b$ and $c$ are given such that:
$$
x+y+z=a
$$
$$
x²+y²+z²=b
$$
$$
xⁿ+yⁿ+zⁿ=c
$$
Where $n=8$.
$x$, $y$ and $z$ could be devised using the method I have derived.
I just want to basically ask if this kind of thing is publishable. Thanks for your reply in anticipation.
polynomials
$endgroup$
I am new here and of course I would like to be specific. I've found a general solution to the following system:
If $a$, $b$ and $c$ are given such that:
$$
x+y+z=a
$$
$$
x²+y²+z²=b
$$
$$
xⁿ+yⁿ+zⁿ=c
$$
Where $n=8$.
$x$, $y$ and $z$ could be devised using the method I have derived.
I just want to basically ask if this kind of thing is publishable. Thanks for your reply in anticipation.
polynomials
polynomials
edited Mar 13 at 17:12
Lateef Suaib
asked Mar 13 at 16:30
Lateef SuaibLateef Suaib
12
12
1
$begingroup$
Publishable it might as well be. Unless there is something super special about the method itself, I would not expect to publish in a journal, but rather on a conference paper. Note that MathOverflow (instead of MathStackExchange) might be more suitable for research-level mathematics.
$endgroup$
– Mefitico
Mar 13 at 16:41
$begingroup$
Thanks for this sir. I will take that into account. But pls, how do I switch to mathoverflow?
$endgroup$
– Lateef Suaib
Mar 13 at 17:08
$begingroup$
Here you go!
$endgroup$
– Mefitico
Mar 13 at 17:15
$begingroup$
Thanks sir! I really appreciate your response.
$endgroup$
– Lateef Suaib
Mar 13 at 18:32
$begingroup$
For me to not be too delusional about my method, please, looking at the system, can it be easily solved without much stress?
$endgroup$
– Lateef Suaib
Mar 13 at 18:36
add a comment |
1
$begingroup$
Publishable it might as well be. Unless there is something super special about the method itself, I would not expect to publish in a journal, but rather on a conference paper. Note that MathOverflow (instead of MathStackExchange) might be more suitable for research-level mathematics.
$endgroup$
– Mefitico
Mar 13 at 16:41
$begingroup$
Thanks for this sir. I will take that into account. But pls, how do I switch to mathoverflow?
$endgroup$
– Lateef Suaib
Mar 13 at 17:08
$begingroup$
Here you go!
$endgroup$
– Mefitico
Mar 13 at 17:15
$begingroup$
Thanks sir! I really appreciate your response.
$endgroup$
– Lateef Suaib
Mar 13 at 18:32
$begingroup$
For me to not be too delusional about my method, please, looking at the system, can it be easily solved without much stress?
$endgroup$
– Lateef Suaib
Mar 13 at 18:36
1
1
$begingroup$
Publishable it might as well be. Unless there is something super special about the method itself, I would not expect to publish in a journal, but rather on a conference paper. Note that MathOverflow (instead of MathStackExchange) might be more suitable for research-level mathematics.
$endgroup$
– Mefitico
Mar 13 at 16:41
$begingroup$
Publishable it might as well be. Unless there is something super special about the method itself, I would not expect to publish in a journal, but rather on a conference paper. Note that MathOverflow (instead of MathStackExchange) might be more suitable for research-level mathematics.
$endgroup$
– Mefitico
Mar 13 at 16:41
$begingroup$
Thanks for this sir. I will take that into account. But pls, how do I switch to mathoverflow?
$endgroup$
– Lateef Suaib
Mar 13 at 17:08
$begingroup$
Thanks for this sir. I will take that into account. But pls, how do I switch to mathoverflow?
$endgroup$
– Lateef Suaib
Mar 13 at 17:08
$begingroup$
Here you go!
$endgroup$
– Mefitico
Mar 13 at 17:15
$begingroup$
Here you go!
$endgroup$
– Mefitico
Mar 13 at 17:15
$begingroup$
Thanks sir! I really appreciate your response.
$endgroup$
– Lateef Suaib
Mar 13 at 18:32
$begingroup$
Thanks sir! I really appreciate your response.
$endgroup$
– Lateef Suaib
Mar 13 at 18:32
$begingroup$
For me to not be too delusional about my method, please, looking at the system, can it be easily solved without much stress?
$endgroup$
– Lateef Suaib
Mar 13 at 18:36
$begingroup$
For me to not be too delusional about my method, please, looking at the system, can it be easily solved without much stress?
$endgroup$
– Lateef Suaib
Mar 13 at 18:36
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I'm doubtful that this would be publishable unless the method is particularly neat or generalizable; it's not hard to find a method using matrices. Explicitly:
If a 3 by 3 matrix $A$ has eigenvalues $x, y, z$, then $A^8$ has eigenvalues $x^8, y^8, z^8$. Therefore, $tr(A^8) = x^8 + y^8 + z^8$. We can choose $A$ to be the companion matrix for a polynomial $x^3 - l x^2 - mx - n$. Then
$$x + y + z = tr(A) = l$$
$$x^2 + y^2 + z^2 = tr(A^2) = l^2 + 2m$$
$$x^8 + y^8 + z^8 = tr(A^8) = l^8 + 8 l^6 m + 20 l^4 m^2 + 16 l^2 m^3 + 2 m^4 + 8 l^5 n + 32 l^3 m n + 24 l m^2 n + 12 l^2 n^2 + 8 m n^2$$
So we set $l = a, m = frac{b - a^2}{2}$, and solve the third equation to find $n$ (it's quadratic in $n$, so the solution won't be too difficult). Then $x, y, z$ are the eigenvalues of $A$, which can be determined by solving the above cubic.
$endgroup$
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
add a comment |
$begingroup$
See Newton-Girard's formulas for a more complete explanation of this technique.
Let:
$$
S_n =sum_{k=1}^l x_i ^n
$$
$$
sigma_1 = S_1
$$
$$
sigma_2 = sum_{ineq j} x_i x_j
$$
$$
sigma_3 = sum_{ineq j neq k} x_i x_j x_k
$$
Then:
$$
S_2= sigma_1^2-2sigma_2
$$
$$
S_n = sigma_1 S_{n-1}-sigma_2S_{n-2}+sigma_3 S_{n-3}-cdots
$$
Thus in your case, we have:
$$
a=sigma_1
$$
$$
b= S_2
$$
$$
c = S_8
$$
Note that if we have $sigma_1$, $sigma_2$ and $sigma_3$, then $x$, $y$ and $z$ are the roots of the equation:
$$
lambda^3-sigma_1 lambda^2+sigma_2 lambda-sigma_3=0
$$
Then $sigma_2$ can be computed almost directly:
$$
sigma_2 = frac{a^2-b}{2}
$$
It remains to find $sigma_3$, but it can be computed be recurring the formula until $S_8$ is written as a function of $sigma_1$, $sigma_2$ and $S_2$. It will likely yield an equation similar to the one @user44191 presented.
Basically, if you have an analytic method that does not incur into solving a third or higher degree polynomial, you might have something interesting in hand.
$endgroup$
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146823%2fhyper-simultaneous-equation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I'm doubtful that this would be publishable unless the method is particularly neat or generalizable; it's not hard to find a method using matrices. Explicitly:
If a 3 by 3 matrix $A$ has eigenvalues $x, y, z$, then $A^8$ has eigenvalues $x^8, y^8, z^8$. Therefore, $tr(A^8) = x^8 + y^8 + z^8$. We can choose $A$ to be the companion matrix for a polynomial $x^3 - l x^2 - mx - n$. Then
$$x + y + z = tr(A) = l$$
$$x^2 + y^2 + z^2 = tr(A^2) = l^2 + 2m$$
$$x^8 + y^8 + z^8 = tr(A^8) = l^8 + 8 l^6 m + 20 l^4 m^2 + 16 l^2 m^3 + 2 m^4 + 8 l^5 n + 32 l^3 m n + 24 l m^2 n + 12 l^2 n^2 + 8 m n^2$$
So we set $l = a, m = frac{b - a^2}{2}$, and solve the third equation to find $n$ (it's quadratic in $n$, so the solution won't be too difficult). Then $x, y, z$ are the eigenvalues of $A$, which can be determined by solving the above cubic.
$endgroup$
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
add a comment |
$begingroup$
I'm doubtful that this would be publishable unless the method is particularly neat or generalizable; it's not hard to find a method using matrices. Explicitly:
If a 3 by 3 matrix $A$ has eigenvalues $x, y, z$, then $A^8$ has eigenvalues $x^8, y^8, z^8$. Therefore, $tr(A^8) = x^8 + y^8 + z^8$. We can choose $A$ to be the companion matrix for a polynomial $x^3 - l x^2 - mx - n$. Then
$$x + y + z = tr(A) = l$$
$$x^2 + y^2 + z^2 = tr(A^2) = l^2 + 2m$$
$$x^8 + y^8 + z^8 = tr(A^8) = l^8 + 8 l^6 m + 20 l^4 m^2 + 16 l^2 m^3 + 2 m^4 + 8 l^5 n + 32 l^3 m n + 24 l m^2 n + 12 l^2 n^2 + 8 m n^2$$
So we set $l = a, m = frac{b - a^2}{2}$, and solve the third equation to find $n$ (it's quadratic in $n$, so the solution won't be too difficult). Then $x, y, z$ are the eigenvalues of $A$, which can be determined by solving the above cubic.
$endgroup$
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
add a comment |
$begingroup$
I'm doubtful that this would be publishable unless the method is particularly neat or generalizable; it's not hard to find a method using matrices. Explicitly:
If a 3 by 3 matrix $A$ has eigenvalues $x, y, z$, then $A^8$ has eigenvalues $x^8, y^8, z^8$. Therefore, $tr(A^8) = x^8 + y^8 + z^8$. We can choose $A$ to be the companion matrix for a polynomial $x^3 - l x^2 - mx - n$. Then
$$x + y + z = tr(A) = l$$
$$x^2 + y^2 + z^2 = tr(A^2) = l^2 + 2m$$
$$x^8 + y^8 + z^8 = tr(A^8) = l^8 + 8 l^6 m + 20 l^4 m^2 + 16 l^2 m^3 + 2 m^4 + 8 l^5 n + 32 l^3 m n + 24 l m^2 n + 12 l^2 n^2 + 8 m n^2$$
So we set $l = a, m = frac{b - a^2}{2}$, and solve the third equation to find $n$ (it's quadratic in $n$, so the solution won't be too difficult). Then $x, y, z$ are the eigenvalues of $A$, which can be determined by solving the above cubic.
$endgroup$
I'm doubtful that this would be publishable unless the method is particularly neat or generalizable; it's not hard to find a method using matrices. Explicitly:
If a 3 by 3 matrix $A$ has eigenvalues $x, y, z$, then $A^8$ has eigenvalues $x^8, y^8, z^8$. Therefore, $tr(A^8) = x^8 + y^8 + z^8$. We can choose $A$ to be the companion matrix for a polynomial $x^3 - l x^2 - mx - n$. Then
$$x + y + z = tr(A) = l$$
$$x^2 + y^2 + z^2 = tr(A^2) = l^2 + 2m$$
$$x^8 + y^8 + z^8 = tr(A^8) = l^8 + 8 l^6 m + 20 l^4 m^2 + 16 l^2 m^3 + 2 m^4 + 8 l^5 n + 32 l^3 m n + 24 l m^2 n + 12 l^2 n^2 + 8 m n^2$$
So we set $l = a, m = frac{b - a^2}{2}$, and solve the third equation to find $n$ (it's quadratic in $n$, so the solution won't be too difficult). Then $x, y, z$ are the eigenvalues of $A$, which can be determined by solving the above cubic.
answered Mar 13 at 19:43
user44191user44191
1032
1032
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
add a comment |
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
$begingroup$
To reduce the eighth powers to third powers only requires solving quadratic equation and i have confirmed that if the problem is reduced to that level, the new problem which involves linear, quadratic and cubic equations can be solved without much stress. If that is the case, do u still think I have something interesting at hand?
$endgroup$
– Lateef Suaib
Mar 16 at 8:44
add a comment |
$begingroup$
See Newton-Girard's formulas for a more complete explanation of this technique.
Let:
$$
S_n =sum_{k=1}^l x_i ^n
$$
$$
sigma_1 = S_1
$$
$$
sigma_2 = sum_{ineq j} x_i x_j
$$
$$
sigma_3 = sum_{ineq j neq k} x_i x_j x_k
$$
Then:
$$
S_2= sigma_1^2-2sigma_2
$$
$$
S_n = sigma_1 S_{n-1}-sigma_2S_{n-2}+sigma_3 S_{n-3}-cdots
$$
Thus in your case, we have:
$$
a=sigma_1
$$
$$
b= S_2
$$
$$
c = S_8
$$
Note that if we have $sigma_1$, $sigma_2$ and $sigma_3$, then $x$, $y$ and $z$ are the roots of the equation:
$$
lambda^3-sigma_1 lambda^2+sigma_2 lambda-sigma_3=0
$$
Then $sigma_2$ can be computed almost directly:
$$
sigma_2 = frac{a^2-b}{2}
$$
It remains to find $sigma_3$, but it can be computed be recurring the formula until $S_8$ is written as a function of $sigma_1$, $sigma_2$ and $S_2$. It will likely yield an equation similar to the one @user44191 presented.
Basically, if you have an analytic method that does not incur into solving a third or higher degree polynomial, you might have something interesting in hand.
$endgroup$
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
add a comment |
$begingroup$
See Newton-Girard's formulas for a more complete explanation of this technique.
Let:
$$
S_n =sum_{k=1}^l x_i ^n
$$
$$
sigma_1 = S_1
$$
$$
sigma_2 = sum_{ineq j} x_i x_j
$$
$$
sigma_3 = sum_{ineq j neq k} x_i x_j x_k
$$
Then:
$$
S_2= sigma_1^2-2sigma_2
$$
$$
S_n = sigma_1 S_{n-1}-sigma_2S_{n-2}+sigma_3 S_{n-3}-cdots
$$
Thus in your case, we have:
$$
a=sigma_1
$$
$$
b= S_2
$$
$$
c = S_8
$$
Note that if we have $sigma_1$, $sigma_2$ and $sigma_3$, then $x$, $y$ and $z$ are the roots of the equation:
$$
lambda^3-sigma_1 lambda^2+sigma_2 lambda-sigma_3=0
$$
Then $sigma_2$ can be computed almost directly:
$$
sigma_2 = frac{a^2-b}{2}
$$
It remains to find $sigma_3$, but it can be computed be recurring the formula until $S_8$ is written as a function of $sigma_1$, $sigma_2$ and $S_2$. It will likely yield an equation similar to the one @user44191 presented.
Basically, if you have an analytic method that does not incur into solving a third or higher degree polynomial, you might have something interesting in hand.
$endgroup$
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
add a comment |
$begingroup$
See Newton-Girard's formulas for a more complete explanation of this technique.
Let:
$$
S_n =sum_{k=1}^l x_i ^n
$$
$$
sigma_1 = S_1
$$
$$
sigma_2 = sum_{ineq j} x_i x_j
$$
$$
sigma_3 = sum_{ineq j neq k} x_i x_j x_k
$$
Then:
$$
S_2= sigma_1^2-2sigma_2
$$
$$
S_n = sigma_1 S_{n-1}-sigma_2S_{n-2}+sigma_3 S_{n-3}-cdots
$$
Thus in your case, we have:
$$
a=sigma_1
$$
$$
b= S_2
$$
$$
c = S_8
$$
Note that if we have $sigma_1$, $sigma_2$ and $sigma_3$, then $x$, $y$ and $z$ are the roots of the equation:
$$
lambda^3-sigma_1 lambda^2+sigma_2 lambda-sigma_3=0
$$
Then $sigma_2$ can be computed almost directly:
$$
sigma_2 = frac{a^2-b}{2}
$$
It remains to find $sigma_3$, but it can be computed be recurring the formula until $S_8$ is written as a function of $sigma_1$, $sigma_2$ and $S_2$. It will likely yield an equation similar to the one @user44191 presented.
Basically, if you have an analytic method that does not incur into solving a third or higher degree polynomial, you might have something interesting in hand.
$endgroup$
See Newton-Girard's formulas for a more complete explanation of this technique.
Let:
$$
S_n =sum_{k=1}^l x_i ^n
$$
$$
sigma_1 = S_1
$$
$$
sigma_2 = sum_{ineq j} x_i x_j
$$
$$
sigma_3 = sum_{ineq j neq k} x_i x_j x_k
$$
Then:
$$
S_2= sigma_1^2-2sigma_2
$$
$$
S_n = sigma_1 S_{n-1}-sigma_2S_{n-2}+sigma_3 S_{n-3}-cdots
$$
Thus in your case, we have:
$$
a=sigma_1
$$
$$
b= S_2
$$
$$
c = S_8
$$
Note that if we have $sigma_1$, $sigma_2$ and $sigma_3$, then $x$, $y$ and $z$ are the roots of the equation:
$$
lambda^3-sigma_1 lambda^2+sigma_2 lambda-sigma_3=0
$$
Then $sigma_2$ can be computed almost directly:
$$
sigma_2 = frac{a^2-b}{2}
$$
It remains to find $sigma_3$, but it can be computed be recurring the formula until $S_8$ is written as a function of $sigma_1$, $sigma_2$ and $S_2$. It will likely yield an equation similar to the one @user44191 presented.
Basically, if you have an analytic method that does not incur into solving a third or higher degree polynomial, you might have something interesting in hand.
answered Mar 14 at 13:28
MefiticoMefitico
1,111218
1,111218
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
add a comment |
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
$begingroup$
To reduce the eighth powers to third powers only requires quadrac
$endgroup$
– Lateef Suaib
Mar 16 at 8:37
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146823%2fhyper-simultaneous-equation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
Publishable it might as well be. Unless there is something super special about the method itself, I would not expect to publish in a journal, but rather on a conference paper. Note that MathOverflow (instead of MathStackExchange) might be more suitable for research-level mathematics.
$endgroup$
– Mefitico
Mar 13 at 16:41
$begingroup$
Thanks for this sir. I will take that into account. But pls, how do I switch to mathoverflow?
$endgroup$
– Lateef Suaib
Mar 13 at 17:08
$begingroup$
Here you go!
$endgroup$
– Mefitico
Mar 13 at 17:15
$begingroup$
Thanks sir! I really appreciate your response.
$endgroup$
– Lateef Suaib
Mar 13 at 18:32
$begingroup$
For me to not be too delusional about my method, please, looking at the system, can it be easily solved without much stress?
$endgroup$
– Lateef Suaib
Mar 13 at 18:36