Congruence, Equal, and EquivalenceThe maths in “The Amazing Spider Man”“A proof that algebraic topology can never have a non self-contradictory set of abelian groups” - Dr. Sheldon CooperWhat is fleventy five?Why is Lebesgue so often spelled “Lebesque”?Theory of reality by RamanujanBooks about maths for (basically) liberal arts studentsDid Pólya say, “can” or “cannot”?Modified version of Monty Hall problem?Proper way to present a problemBasic “Punctuation” and “words” used in basic Mathematics
Is being an extrovert a necessary condition to be a manager?
Department head said that group project may be rejected. How to mitigate?
Is there a solution to paying high fees when opening and closing lightning channels once we hit a fee only market?
Computing elements of a 1000 x 60 matrix exhausts RAM
Find this Unique UVC Palindrome ( ignoring signs and decimal) from Given Fractional Relationship
Why do the i8080 I/O instructions take a byte-sized operand to determine the port?
Salesforce bug enabled "Modify All"
Can someone get a spouse off a deed that never lived together and was incarcerated?
Keeping the dodos out of the field
Is there a word for pant sleeves?
How to become an Editorial board member?
Why is this integration method not valid?
Are there any tips to help hummingbirds find a new feeder?
Shell builtin `printf` line limit?
Meaning of "half-crown enclosure"
How did the Allies achieve air superiority on Sicily?
Is the default 512 byte physical sector size appropriate for SSD disks under Linux?
Congruence, Equal, and Equivalence
Gas chromatography flame ionization detector (FID) - why hydrogen gas?
Real Analysis: Proof of the equivalent definitions of the derivative.
How to make Flex Markers appear in Logic Pro X?
Is ideal gas incompressible?
Does the fact that we can only measure the two-way speed of light undermine the axiom of invariance?
To exponential digit growth and beyond!
Congruence, Equal, and Equivalence
The maths in “The Amazing Spider Man”“A proof that algebraic topology can never have a non self-contradictory set of abelian groups” - Dr. Sheldon CooperWhat is fleventy five?Why is Lebesgue so often spelled “Lebesque”?Theory of reality by RamanujanBooks about maths for (basically) liberal arts studentsDid Pólya say, “can” or “cannot”?Modified version of Monty Hall problem?Proper way to present a problemBasic “Punctuation” and “words” used in basic Mathematics
$begingroup$
I know this is very basic problem about math. But sometimes confusing.
What is the difference among
Equal Sign $left(,=,right)$
Congruence Sign (we saw this on number theory) $left(,equiv,right)$
Equivalence Sign $left(,iff,right)$
mathematicians popular-math
$endgroup$
add a comment |
$begingroup$
I know this is very basic problem about math. But sometimes confusing.
What is the difference among
Equal Sign $left(,=,right)$
Congruence Sign (we saw this on number theory) $left(,equiv,right)$
Equivalence Sign $left(,iff,right)$
mathematicians popular-math
$endgroup$
add a comment |
$begingroup$
I know this is very basic problem about math. But sometimes confusing.
What is the difference among
Equal Sign $left(,=,right)$
Congruence Sign (we saw this on number theory) $left(,equiv,right)$
Equivalence Sign $left(,iff,right)$
mathematicians popular-math
$endgroup$
I know this is very basic problem about math. But sometimes confusing.
What is the difference among
Equal Sign $left(,=,right)$
Congruence Sign (we saw this on number theory) $left(,equiv,right)$
Equivalence Sign $left(,iff,right)$
mathematicians popular-math
mathematicians popular-math
asked 5 hours ago
user516076user516076
476
476
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
There is a subtle difference between $=$ and $equiv$. $equiv$ means that the two sides are ALWAYS equal.
For example:
$$2+2 equiv 4$$
The $=$ is slightly weaker a claim. For example,
$$2x = 4$$
holds only when $x=2$.
Also note that $equiv implies =$ but $= notimplies equiv$
The last $iff$ when two claims imply each other.
For example:
$$2x = 4 iff x=2$$
This essentially means that $2x=4 implies x = 2$ AND $x =2 implies 2x = 4$.
Hope this helps.
$endgroup$
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
add a comment |
$begingroup$
The equal sign between two items mean they are the same. Depending the context this equality is defined or assumed to be understood.
For example if $A$ and $B$ are sets, then $A=B$ means every element of $A$ is an element of $B$ and every element of $B$ is an element of $A$.
On the other hand if $a/b$ and $c/d$ are fractions, then $a/b=c/d$ is defined as $ad=bc$
Congruence sign,$left(,equiv,right)$ comes with a (mod). The definition $aequiv b, pmod n $ is that $b-a$ is divisible by $n$
For example $27equiv 13 pmod 7$
The $iff$ sign is if and only if sign and $piff q$ means $p$ implies $q$ and $q$ implies $p$ where $p$ and $q$ are statements.
$endgroup$
add a comment |
$begingroup$
Equals can be generalized to an equivalence relation. This means a relation on a set $S$, $sim$ which satisfies the following properties:
$asim a$ for all $ain S$ (Reflexive)- If $asim b$, then $b sim a$ (Symmetric)
- If $a sim b$ and $bsim c$, then $a sim c$ (transitive).
Equals should satisfy those 3 properties.
Congruence goes one step further. It is used to indicate that it preserves some kind of operation on the set. In your case, congruence mod $n$ is indicating that $a (mod n)$ times $b (mod n)$ is the same thing as $ab (mod n)$. So you can exchange what it is equivalent to before doing the operation or after and you get the same thing. It is also congruence under addition.
$Leftrightarrow$ is usually talking about the equivalence of two statements. For instance $a in mathbbZ$ is even if and only if ($Leftrightarrow$) $a=2n$ for some $nin mathbbZ$.
$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
);
);
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%2f3232361%2fcongruence-equal-and-equivalence%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There is a subtle difference between $=$ and $equiv$. $equiv$ means that the two sides are ALWAYS equal.
For example:
$$2+2 equiv 4$$
The $=$ is slightly weaker a claim. For example,
$$2x = 4$$
holds only when $x=2$.
Also note that $equiv implies =$ but $= notimplies equiv$
The last $iff$ when two claims imply each other.
For example:
$$2x = 4 iff x=2$$
This essentially means that $2x=4 implies x = 2$ AND $x =2 implies 2x = 4$.
Hope this helps.
$endgroup$
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
add a comment |
$begingroup$
There is a subtle difference between $=$ and $equiv$. $equiv$ means that the two sides are ALWAYS equal.
For example:
$$2+2 equiv 4$$
The $=$ is slightly weaker a claim. For example,
$$2x = 4$$
holds only when $x=2$.
Also note that $equiv implies =$ but $= notimplies equiv$
The last $iff$ when two claims imply each other.
For example:
$$2x = 4 iff x=2$$
This essentially means that $2x=4 implies x = 2$ AND $x =2 implies 2x = 4$.
Hope this helps.
$endgroup$
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
add a comment |
$begingroup$
There is a subtle difference between $=$ and $equiv$. $equiv$ means that the two sides are ALWAYS equal.
For example:
$$2+2 equiv 4$$
The $=$ is slightly weaker a claim. For example,
$$2x = 4$$
holds only when $x=2$.
Also note that $equiv implies =$ but $= notimplies equiv$
The last $iff$ when two claims imply each other.
For example:
$$2x = 4 iff x=2$$
This essentially means that $2x=4 implies x = 2$ AND $x =2 implies 2x = 4$.
Hope this helps.
$endgroup$
There is a subtle difference between $=$ and $equiv$. $equiv$ means that the two sides are ALWAYS equal.
For example:
$$2+2 equiv 4$$
The $=$ is slightly weaker a claim. For example,
$$2x = 4$$
holds only when $x=2$.
Also note that $equiv implies =$ but $= notimplies equiv$
The last $iff$ when two claims imply each other.
For example:
$$2x = 4 iff x=2$$
This essentially means that $2x=4 implies x = 2$ AND $x =2 implies 2x = 4$.
Hope this helps.
edited 5 hours ago
answered 5 hours ago
VizagVizag
1,514314
1,514314
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
add a comment |
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
$begingroup$
Thanks for the answer, But now what if $3xequiv 5(textmod 13)$ it's true when depend on $x$ right? Still confusing actually.
$endgroup$
– user516076
4 hours ago
add a comment |
$begingroup$
The equal sign between two items mean they are the same. Depending the context this equality is defined or assumed to be understood.
For example if $A$ and $B$ are sets, then $A=B$ means every element of $A$ is an element of $B$ and every element of $B$ is an element of $A$.
On the other hand if $a/b$ and $c/d$ are fractions, then $a/b=c/d$ is defined as $ad=bc$
Congruence sign,$left(,equiv,right)$ comes with a (mod). The definition $aequiv b, pmod n $ is that $b-a$ is divisible by $n$
For example $27equiv 13 pmod 7$
The $iff$ sign is if and only if sign and $piff q$ means $p$ implies $q$ and $q$ implies $p$ where $p$ and $q$ are statements.
$endgroup$
add a comment |
$begingroup$
The equal sign between two items mean they are the same. Depending the context this equality is defined or assumed to be understood.
For example if $A$ and $B$ are sets, then $A=B$ means every element of $A$ is an element of $B$ and every element of $B$ is an element of $A$.
On the other hand if $a/b$ and $c/d$ are fractions, then $a/b=c/d$ is defined as $ad=bc$
Congruence sign,$left(,equiv,right)$ comes with a (mod). The definition $aequiv b, pmod n $ is that $b-a$ is divisible by $n$
For example $27equiv 13 pmod 7$
The $iff$ sign is if and only if sign and $piff q$ means $p$ implies $q$ and $q$ implies $p$ where $p$ and $q$ are statements.
$endgroup$
add a comment |
$begingroup$
The equal sign between two items mean they are the same. Depending the context this equality is defined or assumed to be understood.
For example if $A$ and $B$ are sets, then $A=B$ means every element of $A$ is an element of $B$ and every element of $B$ is an element of $A$.
On the other hand if $a/b$ and $c/d$ are fractions, then $a/b=c/d$ is defined as $ad=bc$
Congruence sign,$left(,equiv,right)$ comes with a (mod). The definition $aequiv b, pmod n $ is that $b-a$ is divisible by $n$
For example $27equiv 13 pmod 7$
The $iff$ sign is if and only if sign and $piff q$ means $p$ implies $q$ and $q$ implies $p$ where $p$ and $q$ are statements.
$endgroup$
The equal sign between two items mean they are the same. Depending the context this equality is defined or assumed to be understood.
For example if $A$ and $B$ are sets, then $A=B$ means every element of $A$ is an element of $B$ and every element of $B$ is an element of $A$.
On the other hand if $a/b$ and $c/d$ are fractions, then $a/b=c/d$ is defined as $ad=bc$
Congruence sign,$left(,equiv,right)$ comes with a (mod). The definition $aequiv b, pmod n $ is that $b-a$ is divisible by $n$
For example $27equiv 13 pmod 7$
The $iff$ sign is if and only if sign and $piff q$ means $p$ implies $q$ and $q$ implies $p$ where $p$ and $q$ are statements.
edited 4 hours ago
Bernard
126k743120
126k743120
answered 4 hours ago
Mohammad Riazi-KermaniMohammad Riazi-Kermani
43.5k42061
43.5k42061
add a comment |
add a comment |
$begingroup$
Equals can be generalized to an equivalence relation. This means a relation on a set $S$, $sim$ which satisfies the following properties:
$asim a$ for all $ain S$ (Reflexive)- If $asim b$, then $b sim a$ (Symmetric)
- If $a sim b$ and $bsim c$, then $a sim c$ (transitive).
Equals should satisfy those 3 properties.
Congruence goes one step further. It is used to indicate that it preserves some kind of operation on the set. In your case, congruence mod $n$ is indicating that $a (mod n)$ times $b (mod n)$ is the same thing as $ab (mod n)$. So you can exchange what it is equivalent to before doing the operation or after and you get the same thing. It is also congruence under addition.
$Leftrightarrow$ is usually talking about the equivalence of two statements. For instance $a in mathbbZ$ is even if and only if ($Leftrightarrow$) $a=2n$ for some $nin mathbbZ$.
$endgroup$
add a comment |
$begingroup$
Equals can be generalized to an equivalence relation. This means a relation on a set $S$, $sim$ which satisfies the following properties:
$asim a$ for all $ain S$ (Reflexive)- If $asim b$, then $b sim a$ (Symmetric)
- If $a sim b$ and $bsim c$, then $a sim c$ (transitive).
Equals should satisfy those 3 properties.
Congruence goes one step further. It is used to indicate that it preserves some kind of operation on the set. In your case, congruence mod $n$ is indicating that $a (mod n)$ times $b (mod n)$ is the same thing as $ab (mod n)$. So you can exchange what it is equivalent to before doing the operation or after and you get the same thing. It is also congruence under addition.
$Leftrightarrow$ is usually talking about the equivalence of two statements. For instance $a in mathbbZ$ is even if and only if ($Leftrightarrow$) $a=2n$ for some $nin mathbbZ$.
$endgroup$
add a comment |
$begingroup$
Equals can be generalized to an equivalence relation. This means a relation on a set $S$, $sim$ which satisfies the following properties:
$asim a$ for all $ain S$ (Reflexive)- If $asim b$, then $b sim a$ (Symmetric)
- If $a sim b$ and $bsim c$, then $a sim c$ (transitive).
Equals should satisfy those 3 properties.
Congruence goes one step further. It is used to indicate that it preserves some kind of operation on the set. In your case, congruence mod $n$ is indicating that $a (mod n)$ times $b (mod n)$ is the same thing as $ab (mod n)$. So you can exchange what it is equivalent to before doing the operation or after and you get the same thing. It is also congruence under addition.
$Leftrightarrow$ is usually talking about the equivalence of two statements. For instance $a in mathbbZ$ is even if and only if ($Leftrightarrow$) $a=2n$ for some $nin mathbbZ$.
$endgroup$
Equals can be generalized to an equivalence relation. This means a relation on a set $S$, $sim$ which satisfies the following properties:
$asim a$ for all $ain S$ (Reflexive)- If $asim b$, then $b sim a$ (Symmetric)
- If $a sim b$ and $bsim c$, then $a sim c$ (transitive).
Equals should satisfy those 3 properties.
Congruence goes one step further. It is used to indicate that it preserves some kind of operation on the set. In your case, congruence mod $n$ is indicating that $a (mod n)$ times $b (mod n)$ is the same thing as $ab (mod n)$. So you can exchange what it is equivalent to before doing the operation or after and you get the same thing. It is also congruence under addition.
$Leftrightarrow$ is usually talking about the equivalence of two statements. For instance $a in mathbbZ$ is even if and only if ($Leftrightarrow$) $a=2n$ for some $nin mathbbZ$.
answered 4 hours ago
CPMCPM
3,1101023
3,1101023
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%2f3232361%2fcongruence-equal-and-equivalence%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