◀ ▲ ▶Branches / Numbertheory / Definition: Sets of Integers CoPrime To a Given Integer
Definition: Sets of Integers CoPrime To a Given Integer
Let \(d\in\mathbb Z\) be an integer. By \(\mathbb Z_d\subseteq \mathbb Z\) we denote the subset of integers relatively prime to \(d\). Formally
\[n\in \mathbb Z_d\Longleftrightarrow n\perp d.\]
Examples
 \(\mathbb Z_0=\{1\}\), since \(\gcd(n,0)=1\) only for \(n=1\).
 \(\mathbb Z_1=\mathbb Z\), since \(\gcd(n,1)=1\) for all \(n\in\mathbb Z\).
 \(\mathbb Z_2\) are all odd numbers, since \(\gcd(n,2)=1\) holds for odd numbers, only.
 \(\mathbb Z_p\), $p$ being a prime number \(p\) are all integers not divisible by this prime number, since only for those we have \(\gcd(n,p)=1.\)
 etc.
Table of Contents
 Lemma: Sets of Integers CoPrime to a given Integer are DivisorClosed
Mentioned in:
Lemmas: 1
Proofs: 2
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Piotrowski, Andreas: "Anmerkungen zur Verteilung der Primzahlzwillinge", Masterâ€™s thesis, Frankfurt am Main, 1999