diff options
| author | kieutrang1729 <67156758+kieutrang1729@users.noreply.github.com> | 2021-07-11 16:28:54 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-07-11 16:28:54 +0200 |
| commit | a1286822de3f375b804bf95588d6ef53c4c14e6c (patch) | |
| tree | 48de6fae950a99beceadfa3becb1bf21f0cc6494 /set-theory.html.markdown | |
| parent | e4d92f0a65f25b4452b1e132acc02b0ef4e24d01 (diff) | |
[set-theory/fr] Added French translation for Set theory (#4168)
* 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
Diffstat (limited to 'set-theory.html.markdown')
| -rw-r--r-- | set-theory.html.markdown | 2 |
1 files changed, 1 insertions, 1 deletions
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 } |