Solve the Diophantine equation $24x^4-5y^4=z^2$A quartic diophantine equationConsecutive quadratic...
How do I write bicross product symbols in latex?
How to draw the figure with four pentagons?
Arrow those variables!
Brothers & sisters
Does a druid starting with a bow start with no arrows?
What mechanic is there to disable a threat instead of killing it?
Took a trip to a parallel universe, need help deciphering
Is it inappropriate for a student to attend their mentor's dissertation defense?
90's TV series where a boy goes to another dimension through portal near power lines
Why was the shrinking from 8″ made only to 5.25″ and not smaller (4″ or less)?
What is the most common color to indicate the input-field is disabled?
Fully-Firstable Anagram Sets
Do I have a twin with permutated remainders?
How could indestructible materials be used in power generation?
What to put in ESTA if staying in US for a few days before going on to Canada
How can I prevent hyper evolved versions of regular creatures from wiping out their cousins?
What killed these X2 caps?
Facing a paradox: Earnshaw's theorem in one dimension
Could gravitational lensing be used to protect a spaceship from a laser?
In Romance of the Three Kingdoms why do people still use bamboo sticks when paper had already been invented?
CEO ridiculed me with gay jokes and grabbed me and wouldn't let go - now getting pushed out of company
Were any external disk drives stacked vertically?
What is going on with Captain Marvel's blood colour?
Theorems that impeded progress
Solve the Diophantine equation $24x^4-5y^4=z^2$
A quartic diophantine equationConsecutive quadratic residuesPossible solutions of a diophantine equation: $p^2+pq+275p+10q=2008$Solutions to a quadratic diophantine modular equationEquation $x^3+2x+1=2^n$ in positive integers$2^n + 3^n = x^p$ has no solutions over the natural numbersIf $anotequiv 0mod{p}$ then there are $p-1$ solutions (ordered pairs) to $x^2-y^2equiv amod{p}$Quadratic equation solutions modulo prime pSolving the Diophantine Equation $ax^2 + bx + c = dy^2 + ey + f$?Is $u$ a quadratic residue mod $t + nu$?
$begingroup$
I want to solve $24x^4-5y^4=z^2$ in integers not all zero, and to fix ideas, I want to find them such that x,y are coprime.
I've tried plugging in small values of $x$ and $y$ and they don't return a square value for $24x^4-5y^4$. So I guess that no (nontrivial) solutions exist.
How would I prove this? I can't seem to derive a contradiction in $mathbb{R}$ nor in $mathbb{Q}_p$. So I guess that this equation violates Hasse's local-global principle. That is, I have to derive a contradiction by some other method than arguing in $mathbb{R}$ or mod $p$ for some prime $p$.
The only example I know of a method for solving an equation that violates Hasse's principle is for the example $2a^2+17b^4=c^4$. I shall now describe the method, and my question is, does this method generalize to my equation $24x^4-5y^4=z^2$? (And if not, how else would I go about solving it?)
Here is the method I know for showing that no integers solutions exist to $2a^2+17b^4=c^4$, where $a,b,c$ are not all zero, and $(b,c)=1$. For any prime $p$ dividing $a$, since $17b^4 equiv c^4$ modulo $p$, we get that $17$ is a quadratic residue mod $p$. By quadratic reciprocity, we get that $p$ is a quadratic residue mod $17$, where $p$ was any prime factor of $a$.
This implies that $a$ is a quadratic residue mod $17$. Write $a equiv x^2$ mod $17$. Then $2x^4 equiv c^4$ mod $17$, and then $2$ is a fourth power mod $17$. This is a contradiction.
number-theory prime-numbers diophantine-equations elliptic-curves
$endgroup$
add a comment |
$begingroup$
I want to solve $24x^4-5y^4=z^2$ in integers not all zero, and to fix ideas, I want to find them such that x,y are coprime.
I've tried plugging in small values of $x$ and $y$ and they don't return a square value for $24x^4-5y^4$. So I guess that no (nontrivial) solutions exist.
How would I prove this? I can't seem to derive a contradiction in $mathbb{R}$ nor in $mathbb{Q}_p$. So I guess that this equation violates Hasse's local-global principle. That is, I have to derive a contradiction by some other method than arguing in $mathbb{R}$ or mod $p$ for some prime $p$.
The only example I know of a method for solving an equation that violates Hasse's principle is for the example $2a^2+17b^4=c^4$. I shall now describe the method, and my question is, does this method generalize to my equation $24x^4-5y^4=z^2$? (And if not, how else would I go about solving it?)
Here is the method I know for showing that no integers solutions exist to $2a^2+17b^4=c^4$, where $a,b,c$ are not all zero, and $(b,c)=1$. For any prime $p$ dividing $a$, since $17b^4 equiv c^4$ modulo $p$, we get that $17$ is a quadratic residue mod $p$. By quadratic reciprocity, we get that $p$ is a quadratic residue mod $17$, where $p$ was any prime factor of $a$.
This implies that $a$ is a quadratic residue mod $17$. Write $a equiv x^2$ mod $17$. Then $2x^4 equiv c^4$ mod $17$, and then $2$ is a fourth power mod $17$. This is a contradiction.
number-theory prime-numbers diophantine-equations elliptic-curves
$endgroup$
add a comment |
$begingroup$
I want to solve $24x^4-5y^4=z^2$ in integers not all zero, and to fix ideas, I want to find them such that x,y are coprime.
I've tried plugging in small values of $x$ and $y$ and they don't return a square value for $24x^4-5y^4$. So I guess that no (nontrivial) solutions exist.
How would I prove this? I can't seem to derive a contradiction in $mathbb{R}$ nor in $mathbb{Q}_p$. So I guess that this equation violates Hasse's local-global principle. That is, I have to derive a contradiction by some other method than arguing in $mathbb{R}$ or mod $p$ for some prime $p$.
The only example I know of a method for solving an equation that violates Hasse's principle is for the example $2a^2+17b^4=c^4$. I shall now describe the method, and my question is, does this method generalize to my equation $24x^4-5y^4=z^2$? (And if not, how else would I go about solving it?)
Here is the method I know for showing that no integers solutions exist to $2a^2+17b^4=c^4$, where $a,b,c$ are not all zero, and $(b,c)=1$. For any prime $p$ dividing $a$, since $17b^4 equiv c^4$ modulo $p$, we get that $17$ is a quadratic residue mod $p$. By quadratic reciprocity, we get that $p$ is a quadratic residue mod $17$, where $p$ was any prime factor of $a$.
This implies that $a$ is a quadratic residue mod $17$. Write $a equiv x^2$ mod $17$. Then $2x^4 equiv c^4$ mod $17$, and then $2$ is a fourth power mod $17$. This is a contradiction.
number-theory prime-numbers diophantine-equations elliptic-curves
$endgroup$
I want to solve $24x^4-5y^4=z^2$ in integers not all zero, and to fix ideas, I want to find them such that x,y are coprime.
I've tried plugging in small values of $x$ and $y$ and they don't return a square value for $24x^4-5y^4$. So I guess that no (nontrivial) solutions exist.
How would I prove this? I can't seem to derive a contradiction in $mathbb{R}$ nor in $mathbb{Q}_p$. So I guess that this equation violates Hasse's local-global principle. That is, I have to derive a contradiction by some other method than arguing in $mathbb{R}$ or mod $p$ for some prime $p$.
The only example I know of a method for solving an equation that violates Hasse's principle is for the example $2a^2+17b^4=c^4$. I shall now describe the method, and my question is, does this method generalize to my equation $24x^4-5y^4=z^2$? (And if not, how else would I go about solving it?)
Here is the method I know for showing that no integers solutions exist to $2a^2+17b^4=c^4$, where $a,b,c$ are not all zero, and $(b,c)=1$. For any prime $p$ dividing $a$, since $17b^4 equiv c^4$ modulo $p$, we get that $17$ is a quadratic residue mod $p$. By quadratic reciprocity, we get that $p$ is a quadratic residue mod $17$, where $p$ was any prime factor of $a$.
This implies that $a$ is a quadratic residue mod $17$. Write $a equiv x^2$ mod $17$. Then $2x^4 equiv c^4$ mod $17$, and then $2$ is a fourth power mod $17$. This is a contradiction.
number-theory prime-numbers diophantine-equations elliptic-curves
number-theory prime-numbers diophantine-equations elliptic-curves
edited Mar 19 at 5:41
SSF
asked Mar 19 at 5:33
SSFSSF
475111
475111
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Here's a rudimentary proof. Suppose $z^2=24x^4-5y^4$. Then looking modulo $4$ gives
begin{align}
z^2 &= 24x^4-5y^4\
&equiv -y^4mod 4
end{align}
Since the only squares modulo $4$ are $0$ and $1$, this implies $z^2equiv y^4equiv 0mod 4$, so $2|z,y$. Then setting $overline{y}=frac{y}{2}$ and $overline{z}=frac{z}{2}$, our original equation becomes
begin{align}
4overline{z}^2 &= 24x^4-16cdot5overline{y}^4\
overline{z}^2 &= 6x^4-4cdot5overline{y}^4\
end{align}
This then immediately implies that $2|overline{z}$, so we can again set $w=frac{overline{z}}{2}$ and find
begin{align}
4w^2 &= 6x^4-4cdot5overline{y}^4\
2w^2 &= 3x^4-2cdot5overline{y}^4\
end{align}
Now this gives $2|x$, so we finally set $overline{x}=frac{x}{2}$ and get
begin{align}
2w^2 &= 16cdot3overline{x}^4-2cdot5overline{y}^4\
w^2 &= 24overline{x}^4-5overline{y}^4.
end{align}
Thus we get a new solution with every term strictly smaller, so by infinite descent no solutions can exist.
$endgroup$
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%2f3153709%2fsolve-the-diophantine-equation-24x4-5y4-z2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Here's a rudimentary proof. Suppose $z^2=24x^4-5y^4$. Then looking modulo $4$ gives
begin{align}
z^2 &= 24x^4-5y^4\
&equiv -y^4mod 4
end{align}
Since the only squares modulo $4$ are $0$ and $1$, this implies $z^2equiv y^4equiv 0mod 4$, so $2|z,y$. Then setting $overline{y}=frac{y}{2}$ and $overline{z}=frac{z}{2}$, our original equation becomes
begin{align}
4overline{z}^2 &= 24x^4-16cdot5overline{y}^4\
overline{z}^2 &= 6x^4-4cdot5overline{y}^4\
end{align}
This then immediately implies that $2|overline{z}$, so we can again set $w=frac{overline{z}}{2}$ and find
begin{align}
4w^2 &= 6x^4-4cdot5overline{y}^4\
2w^2 &= 3x^4-2cdot5overline{y}^4\
end{align}
Now this gives $2|x$, so we finally set $overline{x}=frac{x}{2}$ and get
begin{align}
2w^2 &= 16cdot3overline{x}^4-2cdot5overline{y}^4\
w^2 &= 24overline{x}^4-5overline{y}^4.
end{align}
Thus we get a new solution with every term strictly smaller, so by infinite descent no solutions can exist.
$endgroup$
add a comment |
$begingroup$
Here's a rudimentary proof. Suppose $z^2=24x^4-5y^4$. Then looking modulo $4$ gives
begin{align}
z^2 &= 24x^4-5y^4\
&equiv -y^4mod 4
end{align}
Since the only squares modulo $4$ are $0$ and $1$, this implies $z^2equiv y^4equiv 0mod 4$, so $2|z,y$. Then setting $overline{y}=frac{y}{2}$ and $overline{z}=frac{z}{2}$, our original equation becomes
begin{align}
4overline{z}^2 &= 24x^4-16cdot5overline{y}^4\
overline{z}^2 &= 6x^4-4cdot5overline{y}^4\
end{align}
This then immediately implies that $2|overline{z}$, so we can again set $w=frac{overline{z}}{2}$ and find
begin{align}
4w^2 &= 6x^4-4cdot5overline{y}^4\
2w^2 &= 3x^4-2cdot5overline{y}^4\
end{align}
Now this gives $2|x$, so we finally set $overline{x}=frac{x}{2}$ and get
begin{align}
2w^2 &= 16cdot3overline{x}^4-2cdot5overline{y}^4\
w^2 &= 24overline{x}^4-5overline{y}^4.
end{align}
Thus we get a new solution with every term strictly smaller, so by infinite descent no solutions can exist.
$endgroup$
add a comment |
$begingroup$
Here's a rudimentary proof. Suppose $z^2=24x^4-5y^4$. Then looking modulo $4$ gives
begin{align}
z^2 &= 24x^4-5y^4\
&equiv -y^4mod 4
end{align}
Since the only squares modulo $4$ are $0$ and $1$, this implies $z^2equiv y^4equiv 0mod 4$, so $2|z,y$. Then setting $overline{y}=frac{y}{2}$ and $overline{z}=frac{z}{2}$, our original equation becomes
begin{align}
4overline{z}^2 &= 24x^4-16cdot5overline{y}^4\
overline{z}^2 &= 6x^4-4cdot5overline{y}^4\
end{align}
This then immediately implies that $2|overline{z}$, so we can again set $w=frac{overline{z}}{2}$ and find
begin{align}
4w^2 &= 6x^4-4cdot5overline{y}^4\
2w^2 &= 3x^4-2cdot5overline{y}^4\
end{align}
Now this gives $2|x$, so we finally set $overline{x}=frac{x}{2}$ and get
begin{align}
2w^2 &= 16cdot3overline{x}^4-2cdot5overline{y}^4\
w^2 &= 24overline{x}^4-5overline{y}^4.
end{align}
Thus we get a new solution with every term strictly smaller, so by infinite descent no solutions can exist.
$endgroup$
Here's a rudimentary proof. Suppose $z^2=24x^4-5y^4$. Then looking modulo $4$ gives
begin{align}
z^2 &= 24x^4-5y^4\
&equiv -y^4mod 4
end{align}
Since the only squares modulo $4$ are $0$ and $1$, this implies $z^2equiv y^4equiv 0mod 4$, so $2|z,y$. Then setting $overline{y}=frac{y}{2}$ and $overline{z}=frac{z}{2}$, our original equation becomes
begin{align}
4overline{z}^2 &= 24x^4-16cdot5overline{y}^4\
overline{z}^2 &= 6x^4-4cdot5overline{y}^4\
end{align}
This then immediately implies that $2|overline{z}$, so we can again set $w=frac{overline{z}}{2}$ and find
begin{align}
4w^2 &= 6x^4-4cdot5overline{y}^4\
2w^2 &= 3x^4-2cdot5overline{y}^4\
end{align}
Now this gives $2|x$, so we finally set $overline{x}=frac{x}{2}$ and get
begin{align}
2w^2 &= 16cdot3overline{x}^4-2cdot5overline{y}^4\
w^2 &= 24overline{x}^4-5overline{y}^4.
end{align}
Thus we get a new solution with every term strictly smaller, so by infinite descent no solutions can exist.
answered Mar 19 at 6:19
Ethan MacBroughEthan MacBrough
1,241617
1,241617
add a comment |
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%2f3153709%2fsolve-the-diophantine-equation-24x4-5y4-z2%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