Diophantine equation 3^a+1=3^b+5^c
$begingroup$
This is not a research problem, but challenging enough that I've decided to post it in here:
Determine all triples $(a,b,c)$ of non-negative integers, satisfying
$$
1+3^a = 3^b+5^c.
$$
nt.number-theory diophantine-equations elementary-proofs
$endgroup$
add a comment |
$begingroup$
This is not a research problem, but challenging enough that I've decided to post it in here:
Determine all triples $(a,b,c)$ of non-negative integers, satisfying
$$
1+3^a = 3^b+5^c.
$$
nt.number-theory diophantine-equations elementary-proofs
$endgroup$
add a comment |
$begingroup$
This is not a research problem, but challenging enough that I've decided to post it in here:
Determine all triples $(a,b,c)$ of non-negative integers, satisfying
$$
1+3^a = 3^b+5^c.
$$
nt.number-theory diophantine-equations elementary-proofs
$endgroup$
This is not a research problem, but challenging enough that I've decided to post it in here:
Determine all triples $(a,b,c)$ of non-negative integers, satisfying
$$
1+3^a = 3^b+5^c.
$$
nt.number-theory diophantine-equations elementary-proofs
nt.number-theory diophantine-equations elementary-proofs
asked 43 mins ago
kawakawa
1707
1707
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I can't resist this: The young Chris Skinner showed that if $a$, $b$, $c$, $d$ are fixed positive integers, and $p$ and $q$ are positive coprime integers then the equation
$$
ap^x bq^y = c+ dp^z q^w
$$
has a bounded number of solutions in $(x,y,z,w)$ and that a bound on these could be computed (and the equation solved in practice). This solves (in principle) the more general equation $1+3^a 5^d = 3^b+ 5^c$. Anyway, there is a large literature around such exponential diophantine equations, and Skinner's paper will give some references.
$endgroup$
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "504"
};
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%2fmathoverflow.net%2fquestions%2f328619%2fdiophantine-equation-3a1-3b5c%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$
I can't resist this: The young Chris Skinner showed that if $a$, $b$, $c$, $d$ are fixed positive integers, and $p$ and $q$ are positive coprime integers then the equation
$$
ap^x bq^y = c+ dp^z q^w
$$
has a bounded number of solutions in $(x,y,z,w)$ and that a bound on these could be computed (and the equation solved in practice). This solves (in principle) the more general equation $1+3^a 5^d = 3^b+ 5^c$. Anyway, there is a large literature around such exponential diophantine equations, and Skinner's paper will give some references.
$endgroup$
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
add a comment |
$begingroup$
I can't resist this: The young Chris Skinner showed that if $a$, $b$, $c$, $d$ are fixed positive integers, and $p$ and $q$ are positive coprime integers then the equation
$$
ap^x bq^y = c+ dp^z q^w
$$
has a bounded number of solutions in $(x,y,z,w)$ and that a bound on these could be computed (and the equation solved in practice). This solves (in principle) the more general equation $1+3^a 5^d = 3^b+ 5^c$. Anyway, there is a large literature around such exponential diophantine equations, and Skinner's paper will give some references.
$endgroup$
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
add a comment |
$begingroup$
I can't resist this: The young Chris Skinner showed that if $a$, $b$, $c$, $d$ are fixed positive integers, and $p$ and $q$ are positive coprime integers then the equation
$$
ap^x bq^y = c+ dp^z q^w
$$
has a bounded number of solutions in $(x,y,z,w)$ and that a bound on these could be computed (and the equation solved in practice). This solves (in principle) the more general equation $1+3^a 5^d = 3^b+ 5^c$. Anyway, there is a large literature around such exponential diophantine equations, and Skinner's paper will give some references.
$endgroup$
I can't resist this: The young Chris Skinner showed that if $a$, $b$, $c$, $d$ are fixed positive integers, and $p$ and $q$ are positive coprime integers then the equation
$$
ap^x bq^y = c+ dp^z q^w
$$
has a bounded number of solutions in $(x,y,z,w)$ and that a bound on these could be computed (and the equation solved in practice). This solves (in principle) the more general equation $1+3^a 5^d = 3^b+ 5^c$. Anyway, there is a large literature around such exponential diophantine equations, and Skinner's paper will give some references.
answered 21 mins ago
LuciaLucia
34.9k5151177
34.9k5151177
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
add a comment |
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
$begingroup$
Lucia, many thanks for the paper.
$endgroup$
– kawa
17 mins ago
add a comment |
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f328619%2fdiophantine-equation-3a1-3b5c%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