From ea6b3092dbd23e5ec1132a39e79d4a627d221403 Mon Sep 17 00:00:00 2001
From: Spencer Burris <sburris@posteo.net>
Date: Sat, 27 Feb 2021 18:28:37 -0800
Subject: [set-theory/en] use not equal ASCII symbol

---
 set-theory.html.markdown | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'set-theory.html.markdown')

diff --git a/set-theory.html.markdown b/set-theory.html.markdown
index 6be7aa00..ae8b5388 100644
--- a/set-theory.html.markdown
+++ b/set-theory.html.markdown
@@ -41,7 +41,7 @@ The cardinality, or size, of a set is determined by the number of items in the s
 For example, if `S = { 1, 2, 4 }`, then `|S| = 3`.
 
 ### The Empty Set
-* The empty set can be constructed in set builder notation using impossible conditions, e.g. `∅ = { x : x =/= x }`, or `∅ = { x : x ∈ N, x < 0 }`;
+* The empty set can be constructed in set builder notation using impossible conditions, e.g. `∅ = { x : x ≠ x }`, or `∅ = { x : x ∈ N, x < 0 }`;
 * the empty set is always unique (i.e. there is one and only one empty set);
 * the empty set is a subset of all sets;
 * the cardinality of the empty set is 0, i.e. `|∅| = 0`.
-- 
cgit v1.2.3


From a1286822de3f375b804bf95588d6ef53c4c14e6c Mon Sep 17 00:00:00 2001
From: kieutrang1729 <67156758+kieutrang1729@users.noreply.github.com>
Date: Sun, 11 Jul 2021 16:28:54 +0200
Subject: [set-theory/fr] Added French translation for Set theory  (#4168)
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

* Update set-theory.html.markdown

Fixed a minor typo.

* Add files via upload

Added a french translation for set theory.

* Add suggested changes

J'ai fait presque tous les changements suggérés.

* Fix spacing before semicolons
---
 set-theory.html.markdown | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'set-theory.html.markdown')

diff --git a/set-theory.html.markdown b/set-theory.html.markdown
index ae8b5388..c6e72960 100644
--- a/set-theory.html.markdown
+++ b/set-theory.html.markdown
@@ -87,7 +87,7 @@ D = { 2x : x ∈ N } = { 0, 2, 4, 6, 8, ... }
 ## Special Sets
 
 ### The Power Set
-* Let `A` be any set. The set that contains all possible subsets of `A` is called a "power set" and is written as `P(A)`. If the set `A` contains `n` elements, then `P(A)` contains `2^N` elements.
+* Let `A` be any set. The set that contains all possible subsets of `A` is called a "power set" and is written as `P(A)`. If the set `A` contains `n` elements, then `P(A)` contains `2^n` elements.
 
 ```
 P(A) = { x : x ⊆ A }
-- 
cgit v1.2.3


From eed9734dfc7fc4c9073a58d99e9e51686585c93e Mon Sep 17 00:00:00 2001
From: Nathan <nibudd@gmail.com>
Date: Mon, 3 Jan 2022 10:53:13 -0500
Subject: fix typo (#4192)

compliment -> complement
---
 set-theory.html.markdown | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'set-theory.html.markdown')

diff --git a/set-theory.html.markdown b/set-theory.html.markdown
index c6e72960..d55ab7d5 100644
--- a/set-theory.html.markdown
+++ b/set-theory.html.markdown
@@ -13,7 +13,7 @@ Set theory is a branch of mathematics that studies sets, their operations, and t
 * the union operator, `∪`, pronounced "cup", means "or";
 * the intersection operator, `∩`, pronounced "cap", means "and";
 * the exclusion operator, `\`, means "without";
-* the compliment operator, `'`, means "the inverse of";
+* the complement operator, `'`, means "the inverse of";
 * the cross operator, `×`, means "the Cartesian product of".
 
 ### Qualifiers 
-- 
cgit v1.2.3