Proof that $log_q(p)$ is (mostly) irrational for integers q,p
$begingroup$
Does this proof make sense, especially the last part?
Take $q>p$. We consider the equation $p^aq^b=p^{a'} q^{b'}$. Given that $a,b$ and $a',b'$ are distinct respectively. We solve, realising that $frac{a-a'}{b'-b} = log_p(q)$. Notice that the existence of solutions implies that the latter is rational. Also, in the same way, a solution for the second equation implies a solution for the first. Therefore solutions to
$p^aq^b=p^{a'} q^{b'}$ is equivalent to saying that $log_p(q)$ is rational.
If $p,q$ don't share the same prime factors, it is easy to see that there exist no distinct solutions.
Now consider the case in which they do. The multiplicity of a prime k on both sides is $k_p a + k_q b = k_p a' + k_q b'$ so $$frac{k_q}{k_p} = log_p(q)$$
This must be a constant and it must be the same for any prime factor $k$. Therefore $q = p^r$ where $r$ is a rational number. Or solutions exist $q^b = p^a$ . Can we simplify this condition further?
Alternatively we could assume $log_p(q) = frac{a}{b}$ is injective so $log_p(p^frac{a}{b})=log_p(q)$ so $p^a = q^b$. This leads us to the same condition.
I'm not sure about the clarity or validity of proof 1. Proof 2 seems cleaner but it assumes injectivity. Could someone help me clear this up so it is concise and conceptually clear?
proof-verification proof-writing logarithms irrational-numbers
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
$endgroup$
add a comment |
$begingroup$
Does this proof make sense, especially the last part?
Take $q>p$. We consider the equation $p^aq^b=p^{a'} q^{b'}$. Given that $a,b$ and $a',b'$ are distinct respectively. We solve, realising that $frac{a-a'}{b'-b} = log_p(q)$. Notice that the existence of solutions implies that the latter is rational. Also, in the same way, a solution for the second equation implies a solution for the first. Therefore solutions to
$p^aq^b=p^{a'} q^{b'}$ is equivalent to saying that $log_p(q)$ is rational.
If $p,q$ don't share the same prime factors, it is easy to see that there exist no distinct solutions.
Now consider the case in which they do. The multiplicity of a prime k on both sides is $k_p a + k_q b = k_p a' + k_q b'$ so $$frac{k_q}{k_p} = log_p(q)$$
This must be a constant and it must be the same for any prime factor $k$. Therefore $q = p^r$ where $r$ is a rational number. Or solutions exist $q^b = p^a$ . Can we simplify this condition further?
Alternatively we could assume $log_p(q) = frac{a}{b}$ is injective so $log_p(p^frac{a}{b})=log_p(q)$ so $p^a = q^b$. This leads us to the same condition.
I'm not sure about the clarity or validity of proof 1. Proof 2 seems cleaner but it assumes injectivity. Could someone help me clear this up so it is concise and conceptually clear?
proof-verification proof-writing logarithms irrational-numbers
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
$endgroup$
add a comment |
$begingroup$
Does this proof make sense, especially the last part?
Take $q>p$. We consider the equation $p^aq^b=p^{a'} q^{b'}$. Given that $a,b$ and $a',b'$ are distinct respectively. We solve, realising that $frac{a-a'}{b'-b} = log_p(q)$. Notice that the existence of solutions implies that the latter is rational. Also, in the same way, a solution for the second equation implies a solution for the first. Therefore solutions to
$p^aq^b=p^{a'} q^{b'}$ is equivalent to saying that $log_p(q)$ is rational.
If $p,q$ don't share the same prime factors, it is easy to see that there exist no distinct solutions.
Now consider the case in which they do. The multiplicity of a prime k on both sides is $k_p a + k_q b = k_p a' + k_q b'$ so $$frac{k_q}{k_p} = log_p(q)$$
This must be a constant and it must be the same for any prime factor $k$. Therefore $q = p^r$ where $r$ is a rational number. Or solutions exist $q^b = p^a$ . Can we simplify this condition further?
Alternatively we could assume $log_p(q) = frac{a}{b}$ is injective so $log_p(p^frac{a}{b})=log_p(q)$ so $p^a = q^b$. This leads us to the same condition.
I'm not sure about the clarity or validity of proof 1. Proof 2 seems cleaner but it assumes injectivity. Could someone help me clear this up so it is concise and conceptually clear?
proof-verification proof-writing logarithms irrational-numbers
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
$endgroup$
Does this proof make sense, especially the last part?
Take $q>p$. We consider the equation $p^aq^b=p^{a'} q^{b'}$. Given that $a,b$ and $a',b'$ are distinct respectively. We solve, realising that $frac{a-a'}{b'-b} = log_p(q)$. Notice that the existence of solutions implies that the latter is rational. Also, in the same way, a solution for the second equation implies a solution for the first. Therefore solutions to
$p^aq^b=p^{a'} q^{b'}$ is equivalent to saying that $log_p(q)$ is rational.
If $p,q$ don't share the same prime factors, it is easy to see that there exist no distinct solutions.
Now consider the case in which they do. The multiplicity of a prime k on both sides is $k_p a + k_q b = k_p a' + k_q b'$ so $$frac{k_q}{k_p} = log_p(q)$$
This must be a constant and it must be the same for any prime factor $k$. Therefore $q = p^r$ where $r$ is a rational number. Or solutions exist $q^b = p^a$ . Can we simplify this condition further?
Alternatively we could assume $log_p(q) = frac{a}{b}$ is injective so $log_p(p^frac{a}{b})=log_p(q)$ so $p^a = q^b$. This leads us to the same condition.
I'm not sure about the clarity or validity of proof 1. Proof 2 seems cleaner but it assumes injectivity. Could someone help me clear this up so it is concise and conceptually clear?
proof-verification proof-writing logarithms irrational-numbers
proof-verification proof-writing logarithms irrational-numbers
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
edited Dec 30 '18 at 9:43
Dis-integrating
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
asked Dec 30 '18 at 9:37
Dis-integratingDis-integrating
1,036426
1,036426
add a comment |
add a comment |
0
active
oldest
votes
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%2f3056649%2fproof-that-log-qp-is-mostly-irrational-for-integers-q-p%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3056649%2fproof-that-log-qp-is-mostly-irrational-for-integers-q-p%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
