Is taking modulus on both sides of an equation valid?Square root of a squared number changes sign, which to apply first?Why is it valid to multiply both sides of an equation by its complex conjugate?Will there be two square roots for a Complex number?Taking Mod on both sides, mathematically correct?Solving and graphing all values of $z$.When do you take into account the +2kpi for complex numbers arguments in complex equations$z^2 = sqrt3+ 3i$ (complex equation)Range of sum of complex numberssolve $(x+iy)^2= a+ ib$Question on the logic of a proof involving complex numbers
Usefulness of complex chord names?
How can Thor be worthy?
Does kinetic energy warp spacetime?
How to Access data returned from Apex class in JS controller using Lightning web component
How do I compare the result of "1d20+x, with advantage" to "1d20+y, without advantage", assuming x < y?
Would an 8% reduction in drag outweigh the weight addition from this custom CFD-tested winglet?
Why was the Ancient One so hesitant to teach Dr. Strange the art of sorcery?
Extracting sublists that contain similar elements
51% attack - apparently very easy? refering to CZ's "rollback btc chain" - How to make sure such corruptible scenario can never happen so easily?
Run script for 10 times until meets the condition, but break the loop if it meets the condition during iteration
How do I tell my supervisor that he is choosing poor replacements for me while I am on maternity leave?
How to slow yourself down (for playing nice with others)
SSD - Disk is OK, one bad sector
Plastic-on-plastic lubricant that wont leave a residue?
What is Plautus’s pun about frustum and frustrum?
Why does the Earth follow an elliptical trajectory rather than a parabolic one?
Is the schwa sound consistent?
How can I answer high-school writing prompts without sounding weird and fake?
Is taking modulus on both sides of an equation valid?
Create a list of all possible Boolean configurations of three constraints
"Right on the tip of my tongue" meaning?
Proof that the inverse image of a single element is a discrete space
As programers say: Strive to be lazy
Extrude the faces of a cube symmetrically along XYZ
Is taking modulus on both sides of an equation valid?
Square root of a squared number changes sign, which to apply first?Why is it valid to multiply both sides of an equation by its complex conjugate?Will there be two square roots for a Complex number?Taking Mod on both sides, mathematically correct?Solving and graphing all values of $z$.When do you take into account the +2kpi for complex numbers arguments in complex equations$z^2 = sqrt3+ 3i$ (complex equation)Range of sum of complex numberssolve $(x+iy)^2= a+ ib$Question on the logic of a proof involving complex numbers
$begingroup$
This might look like a copy of another question, but what I'm about to propose here is new. There's this question,
Find the least positive integral value of n for which $(frac1+i1-i)^n = 1$
While solving, if we multiply what is within the bracket, by the conjugate of denominator and divide by the same thing, we get $i$ in the bracket, that means, the question boils down to
$i ^ n= 1$
We know that the least positive value $n$ can have is $4$, for $i^n$ to be $1$.
Done.
Now,
IF I were to solve it by taking mod on both sides of the given equation,
I would get
$Big(frac1+iBig)^n = |1|$
$Big(fracsqrt2sqrt2Big)^n = 1$
$1^n = 1$
NOTE that the least positive value of $n$ changes from $4$ to $1$.
Why is it so?
I read an answer on stack exchange, that it is valid to do anything with the equation until it maintains the equality. I didn't destroy the equality, so why does the answer vary?
Is there any restriction as to where to use the "taking-mod-both-sides" thing?
complex-numbers
New contributor
$endgroup$
add a comment |
$begingroup$
This might look like a copy of another question, but what I'm about to propose here is new. There's this question,
Find the least positive integral value of n for which $(frac1+i1-i)^n = 1$
While solving, if we multiply what is within the bracket, by the conjugate of denominator and divide by the same thing, we get $i$ in the bracket, that means, the question boils down to
$i ^ n= 1$
We know that the least positive value $n$ can have is $4$, for $i^n$ to be $1$.
Done.
Now,
IF I were to solve it by taking mod on both sides of the given equation,
I would get
$Big(frac1+iBig)^n = |1|$
$Big(fracsqrt2sqrt2Big)^n = 1$
$1^n = 1$
NOTE that the least positive value of $n$ changes from $4$ to $1$.
Why is it so?
I read an answer on stack exchange, that it is valid to do anything with the equation until it maintains the equality. I didn't destroy the equality, so why does the answer vary?
Is there any restriction as to where to use the "taking-mod-both-sides" thing?
complex-numbers
New contributor
$endgroup$
2
$begingroup$
If $a=b$, then $|a|=|b|$. In this sense, it is "valid" to take the modulus of both sides. It is not necessarily the case, however, that if $|a|=|b|$, then $a=b$. Assuming this latter statement is what is leading you to incorrectly conclude that $n=1$ is a solution to the original problem.
$endgroup$
– jawheele
42 mins ago
add a comment |
$begingroup$
This might look like a copy of another question, but what I'm about to propose here is new. There's this question,
Find the least positive integral value of n for which $(frac1+i1-i)^n = 1$
While solving, if we multiply what is within the bracket, by the conjugate of denominator and divide by the same thing, we get $i$ in the bracket, that means, the question boils down to
$i ^ n= 1$
We know that the least positive value $n$ can have is $4$, for $i^n$ to be $1$.
Done.
Now,
IF I were to solve it by taking mod on both sides of the given equation,
I would get
$Big(frac1+iBig)^n = |1|$
$Big(fracsqrt2sqrt2Big)^n = 1$
$1^n = 1$
NOTE that the least positive value of $n$ changes from $4$ to $1$.
Why is it so?
I read an answer on stack exchange, that it is valid to do anything with the equation until it maintains the equality. I didn't destroy the equality, so why does the answer vary?
Is there any restriction as to where to use the "taking-mod-both-sides" thing?
complex-numbers
New contributor
$endgroup$
This might look like a copy of another question, but what I'm about to propose here is new. There's this question,
Find the least positive integral value of n for which $(frac1+i1-i)^n = 1$
While solving, if we multiply what is within the bracket, by the conjugate of denominator and divide by the same thing, we get $i$ in the bracket, that means, the question boils down to
$i ^ n= 1$
We know that the least positive value $n$ can have is $4$, for $i^n$ to be $1$.
Done.
Now,
IF I were to solve it by taking mod on both sides of the given equation,
I would get
$Big(frac1+iBig)^n = |1|$
$Big(fracsqrt2sqrt2Big)^n = 1$
$1^n = 1$
NOTE that the least positive value of $n$ changes from $4$ to $1$.
Why is it so?
I read an answer on stack exchange, that it is valid to do anything with the equation until it maintains the equality. I didn't destroy the equality, so why does the answer vary?
Is there any restriction as to where to use the "taking-mod-both-sides" thing?
complex-numbers
complex-numbers
New contributor
New contributor
edited 44 mins ago
Ryan Shesler
40711
40711
New contributor
asked 53 mins ago
user231094user231094
111
111
New contributor
New contributor
2
$begingroup$
If $a=b$, then $|a|=|b|$. In this sense, it is "valid" to take the modulus of both sides. It is not necessarily the case, however, that if $|a|=|b|$, then $a=b$. Assuming this latter statement is what is leading you to incorrectly conclude that $n=1$ is a solution to the original problem.
$endgroup$
– jawheele
42 mins ago
add a comment |
2
$begingroup$
If $a=b$, then $|a|=|b|$. In this sense, it is "valid" to take the modulus of both sides. It is not necessarily the case, however, that if $|a|=|b|$, then $a=b$. Assuming this latter statement is what is leading you to incorrectly conclude that $n=1$ is a solution to the original problem.
$endgroup$
– jawheele
42 mins ago
2
2
$begingroup$
If $a=b$, then $|a|=|b|$. In this sense, it is "valid" to take the modulus of both sides. It is not necessarily the case, however, that if $|a|=|b|$, then $a=b$. Assuming this latter statement is what is leading you to incorrectly conclude that $n=1$ is a solution to the original problem.
$endgroup$
– jawheele
42 mins ago
$begingroup$
If $a=b$, then $|a|=|b|$. In this sense, it is "valid" to take the modulus of both sides. It is not necessarily the case, however, that if $|a|=|b|$, then $a=b$. Assuming this latter statement is what is leading you to incorrectly conclude that $n=1$ is a solution to the original problem.
$endgroup$
– jawheele
42 mins ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The problem is, "taking-mod-of-both-sides" is valid, but only gives a one way implication. If $z_1 = z_2$ then $|z_1| = |z_2|$. But there are lots of possibilities for $z_3$,$z_4$ with $|z_3| = |z_4|$ and $z_3 neq z_4$, since modulus is not a one-to-one map.
When you look at $left(frac1+mathrmi1-mathrmiright)^n$, this always has modulus $1$ for all values of $n$. But this just means it lies on the unit circle in the complex plane, it does not mean that it is equal to 1.
$endgroup$
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
1
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
add a comment |
$begingroup$
I'm sure you have learned that when solving equations, if you square both sides you can introduce spurious solutions. The point is that
$$A = B implies A^2 = B^2
$$
but the converse can fail. That's why we teach algebra students to check their answers back in the original equation.
Taking the modulus on both sides of the equation has the same effect:
$$A = B implies |A| = |B|
$$
but the converse can fail, for example $|i|=|1|$ but $i ne 1$.
When you took the modulus on both sides of your equation, you introduced spurious solutions. So you have to check each answer to see if it satisfies the original equation.
$endgroup$
add a comment |
Your Answer
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
);
);
user231094 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3222731%2fis-taking-modulus-on-both-sides-of-an-equation-valid%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$
The problem is, "taking-mod-of-both-sides" is valid, but only gives a one way implication. If $z_1 = z_2$ then $|z_1| = |z_2|$. But there are lots of possibilities for $z_3$,$z_4$ with $|z_3| = |z_4|$ and $z_3 neq z_4$, since modulus is not a one-to-one map.
When you look at $left(frac1+mathrmi1-mathrmiright)^n$, this always has modulus $1$ for all values of $n$. But this just means it lies on the unit circle in the complex plane, it does not mean that it is equal to 1.
$endgroup$
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
1
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
add a comment |
$begingroup$
The problem is, "taking-mod-of-both-sides" is valid, but only gives a one way implication. If $z_1 = z_2$ then $|z_1| = |z_2|$. But there are lots of possibilities for $z_3$,$z_4$ with $|z_3| = |z_4|$ and $z_3 neq z_4$, since modulus is not a one-to-one map.
When you look at $left(frac1+mathrmi1-mathrmiright)^n$, this always has modulus $1$ for all values of $n$. But this just means it lies on the unit circle in the complex plane, it does not mean that it is equal to 1.
$endgroup$
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
1
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
add a comment |
$begingroup$
The problem is, "taking-mod-of-both-sides" is valid, but only gives a one way implication. If $z_1 = z_2$ then $|z_1| = |z_2|$. But there are lots of possibilities for $z_3$,$z_4$ with $|z_3| = |z_4|$ and $z_3 neq z_4$, since modulus is not a one-to-one map.
When you look at $left(frac1+mathrmi1-mathrmiright)^n$, this always has modulus $1$ for all values of $n$. But this just means it lies on the unit circle in the complex plane, it does not mean that it is equal to 1.
$endgroup$
The problem is, "taking-mod-of-both-sides" is valid, but only gives a one way implication. If $z_1 = z_2$ then $|z_1| = |z_2|$. But there are lots of possibilities for $z_3$,$z_4$ with $|z_3| = |z_4|$ and $z_3 neq z_4$, since modulus is not a one-to-one map.
When you look at $left(frac1+mathrmi1-mathrmiright)^n$, this always has modulus $1$ for all values of $n$. But this just means it lies on the unit circle in the complex plane, it does not mean that it is equal to 1.
edited 30 mins ago
answered 41 mins ago
Morgan RodgersMorgan Rodgers
9,95731440
9,95731440
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
1
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
add a comment |
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
1
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
It is a many to one map
$endgroup$
– Arjang
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
$begingroup$
So while solving questions relating to this, how am I supposed to know that my taking mod would yield me a valid result? With reference to the quoted example question, of course.
$endgroup$
– user231094
38 mins ago
1
1
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
$begingroup$
@user231094 In order to know, you can explicitly check the result you obtain after taking the modulus. For instance, in the originally posed problem, we can explicitly check that $n=1$ is not a solution, i.e. $fraci+1i-1 neq 1$. Sometimes taking the modulus might help you narrow down the possible solutions, even if it doesn't tell you the solutions exactly. Oftentimes, it's more useful in determining what the solutions aren't.
$endgroup$
– jawheele
32 mins ago
add a comment |
$begingroup$
I'm sure you have learned that when solving equations, if you square both sides you can introduce spurious solutions. The point is that
$$A = B implies A^2 = B^2
$$
but the converse can fail. That's why we teach algebra students to check their answers back in the original equation.
Taking the modulus on both sides of the equation has the same effect:
$$A = B implies |A| = |B|
$$
but the converse can fail, for example $|i|=|1|$ but $i ne 1$.
When you took the modulus on both sides of your equation, you introduced spurious solutions. So you have to check each answer to see if it satisfies the original equation.
$endgroup$
add a comment |
$begingroup$
I'm sure you have learned that when solving equations, if you square both sides you can introduce spurious solutions. The point is that
$$A = B implies A^2 = B^2
$$
but the converse can fail. That's why we teach algebra students to check their answers back in the original equation.
Taking the modulus on both sides of the equation has the same effect:
$$A = B implies |A| = |B|
$$
but the converse can fail, for example $|i|=|1|$ but $i ne 1$.
When you took the modulus on both sides of your equation, you introduced spurious solutions. So you have to check each answer to see if it satisfies the original equation.
$endgroup$
add a comment |
$begingroup$
I'm sure you have learned that when solving equations, if you square both sides you can introduce spurious solutions. The point is that
$$A = B implies A^2 = B^2
$$
but the converse can fail. That's why we teach algebra students to check their answers back in the original equation.
Taking the modulus on both sides of the equation has the same effect:
$$A = B implies |A| = |B|
$$
but the converse can fail, for example $|i|=|1|$ but $i ne 1$.
When you took the modulus on both sides of your equation, you introduced spurious solutions. So you have to check each answer to see if it satisfies the original equation.
$endgroup$
I'm sure you have learned that when solving equations, if you square both sides you can introduce spurious solutions. The point is that
$$A = B implies A^2 = B^2
$$
but the converse can fail. That's why we teach algebra students to check their answers back in the original equation.
Taking the modulus on both sides of the equation has the same effect:
$$A = B implies |A| = |B|
$$
but the converse can fail, for example $|i|=|1|$ but $i ne 1$.
When you took the modulus on both sides of your equation, you introduced spurious solutions. So you have to check each answer to see if it satisfies the original equation.
answered 31 mins ago
Lee MosherLee Mosher
53k33892
53k33892
add a comment |
add a comment |
user231094 is a new contributor. Be nice, and check out our Code of Conduct.
user231094 is a new contributor. Be nice, and check out our Code of Conduct.
user231094 is a new contributor. Be nice, and check out our Code of Conduct.
user231094 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3222731%2fis-taking-modulus-on-both-sides-of-an-equation-valid%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
2
$begingroup$
If $a=b$, then $|a|=|b|$. In this sense, it is "valid" to take the modulus of both sides. It is not necessarily the case, however, that if $|a|=|b|$, then $a=b$. Assuming this latter statement is what is leading you to incorrectly conclude that $n=1$ is a solution to the original problem.
$endgroup$
– jawheele
42 mins ago