Sixth grade math (number related) problem
$begingroup$
We have this statement (about rational numbers, btw):
If $m-n+p = p$ and $ m neq n neq 0$ then $ m = -n$
Is this true?
a) always
b) never
c) sometimes
The given answer is b) but:
1) this textbook often has some wrong answers and
2) this question got me really thinking...
According to the truth table of the implication if the premise is false, then the whole implication is true, no matter what the conclusion is.
In this case the premise is a conjunction of several facts, two of which are contradictory ($m = n $ and $m neq n$).
So the premise is false. And so I conclude the whole implication is true.
Then... what does that mean? I guess it means the correct answer is a).
logic education rational-numbers
$endgroup$
add a comment |
$begingroup$
We have this statement (about rational numbers, btw):
If $m-n+p = p$ and $ m neq n neq 0$ then $ m = -n$
Is this true?
a) always
b) never
c) sometimes
The given answer is b) but:
1) this textbook often has some wrong answers and
2) this question got me really thinking...
According to the truth table of the implication if the premise is false, then the whole implication is true, no matter what the conclusion is.
In this case the premise is a conjunction of several facts, two of which are contradictory ($m = n $ and $m neq n$).
So the premise is false. And so I conclude the whole implication is true.
Then... what does that mean? I guess it means the correct answer is a).
logic education rational-numbers
$endgroup$
add a comment |
$begingroup$
We have this statement (about rational numbers, btw):
If $m-n+p = p$ and $ m neq n neq 0$ then $ m = -n$
Is this true?
a) always
b) never
c) sometimes
The given answer is b) but:
1) this textbook often has some wrong answers and
2) this question got me really thinking...
According to the truth table of the implication if the premise is false, then the whole implication is true, no matter what the conclusion is.
In this case the premise is a conjunction of several facts, two of which are contradictory ($m = n $ and $m neq n$).
So the premise is false. And so I conclude the whole implication is true.
Then... what does that mean? I guess it means the correct answer is a).
logic education rational-numbers
$endgroup$
We have this statement (about rational numbers, btw):
If $m-n+p = p$ and $ m neq n neq 0$ then $ m = -n$
Is this true?
a) always
b) never
c) sometimes
The given answer is b) but:
1) this textbook often has some wrong answers and
2) this question got me really thinking...
According to the truth table of the implication if the premise is false, then the whole implication is true, no matter what the conclusion is.
In this case the premise is a conjunction of several facts, two of which are contradictory ($m = n $ and $m neq n$).
So the premise is false. And so I conclude the whole implication is true.
Then... what does that mean? I guess it means the correct answer is a).
logic education rational-numbers
logic education rational-numbers
asked 4 hours ago
peter.petrovpeter.petrov
5,422821
5,422821
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I believe this is a poorly worded math problem, sixth grade or otherwise. The statement
$$m neq n neq 0$$
is possibly meant to be something like
$$m, n neq 0$$
instead. This would be to ensure that $m = n$ and $m = -n$ can't both be true simultaneously as it only occurs when $m = n = 0$.
This is only a guess, but it would mean the question would then be consistent with the textbook's provided answer.
$endgroup$
add a comment |
$begingroup$
It's unclear what $m neq n neq 0$ means. But, suppose that instead the statement were:
"If $m - n + p = p$ and $m neq n$ then $m = -n$."
In this case, the statement would be true (vacuously true). I wouldn't describe the statement as "always true" ; the statement is simply "true".
$endgroup$
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
|
show 1 more 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%2f3079912%2fsixth-grade-math-number-related-problem%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 believe this is a poorly worded math problem, sixth grade or otherwise. The statement
$$m neq n neq 0$$
is possibly meant to be something like
$$m, n neq 0$$
instead. This would be to ensure that $m = n$ and $m = -n$ can't both be true simultaneously as it only occurs when $m = n = 0$.
This is only a guess, but it would mean the question would then be consistent with the textbook's provided answer.
$endgroup$
add a comment |
$begingroup$
I believe this is a poorly worded math problem, sixth grade or otherwise. The statement
$$m neq n neq 0$$
is possibly meant to be something like
$$m, n neq 0$$
instead. This would be to ensure that $m = n$ and $m = -n$ can't both be true simultaneously as it only occurs when $m = n = 0$.
This is only a guess, but it would mean the question would then be consistent with the textbook's provided answer.
$endgroup$
add a comment |
$begingroup$
I believe this is a poorly worded math problem, sixth grade or otherwise. The statement
$$m neq n neq 0$$
is possibly meant to be something like
$$m, n neq 0$$
instead. This would be to ensure that $m = n$ and $m = -n$ can't both be true simultaneously as it only occurs when $m = n = 0$.
This is only a guess, but it would mean the question would then be consistent with the textbook's provided answer.
$endgroup$
I believe this is a poorly worded math problem, sixth grade or otherwise. The statement
$$m neq n neq 0$$
is possibly meant to be something like
$$m, n neq 0$$
instead. This would be to ensure that $m = n$ and $m = -n$ can't both be true simultaneously as it only occurs when $m = n = 0$.
This is only a guess, but it would mean the question would then be consistent with the textbook's provided answer.
edited 3 hours ago
answered 4 hours ago
John OmielanJohn Omielan
1,47629
1,47629
add a comment |
add a comment |
$begingroup$
It's unclear what $m neq n neq 0$ means. But, suppose that instead the statement were:
"If $m - n + p = p$ and $m neq n$ then $m = -n$."
In this case, the statement would be true (vacuously true). I wouldn't describe the statement as "always true" ; the statement is simply "true".
$endgroup$
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
|
show 1 more comment
$begingroup$
It's unclear what $m neq n neq 0$ means. But, suppose that instead the statement were:
"If $m - n + p = p$ and $m neq n$ then $m = -n$."
In this case, the statement would be true (vacuously true). I wouldn't describe the statement as "always true" ; the statement is simply "true".
$endgroup$
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
|
show 1 more comment
$begingroup$
It's unclear what $m neq n neq 0$ means. But, suppose that instead the statement were:
"If $m - n + p = p$ and $m neq n$ then $m = -n$."
In this case, the statement would be true (vacuously true). I wouldn't describe the statement as "always true" ; the statement is simply "true".
$endgroup$
It's unclear what $m neq n neq 0$ means. But, suppose that instead the statement were:
"If $m - n + p = p$ and $m neq n$ then $m = -n$."
In this case, the statement would be true (vacuously true). I wouldn't describe the statement as "always true" ; the statement is simply "true".
edited 3 hours ago
answered 3 hours ago
littleOlittleO
29.5k645109
29.5k645109
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
|
show 1 more comment
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
"always" because it is never true that $(m-n+p=p) land(mneq n)$.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
The phrase "always true" seems redundant. There is no need for the word "always". The statement I mentioned is simply "true".
$endgroup$
– littleO
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
Could be "true for all values of $p$".
$endgroup$
– dbx
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
It is always true in the sense that $forall m, forall n, forall pBig((mneq n land m-n+p=p)to (m= -n)Big)$ is true. Don't be so patronizing in your tone, please. Be kind.
$endgroup$
– jordan_glen
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
$begingroup$
I didn't intend for my tone to sound patronizing, sorry if it did! However, I stand by my point that the word "always" is unnecessary. For example, one wouldn't describe Fermat's Last Theorem as being "always true", it's just a statement that is true.
$endgroup$
– littleO
3 hours ago
|
show 1 more 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%2f3079912%2fsixth-grade-math-number-related-problem%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