I am trying to write down the set of all ordered pairs $(n,m)$ such that $n=2k+1:k\in\mathbb{Z}^{+}$ and $m=2l+1:l\in\mathbb{Z}^{+}$. How would that be written in set notation?
Set Notation: Write set of ordered pairs of odd integers
1
$\begingroup$
elementary-set-theory
notation
3 Answers
2
I would use $$\left\{(n,m)\in \mathbb{Z}^2 \mid \exists k, l \in \mathbb{Z}^+:n=2k+1,m=2l+1\right\}$$
-
0@BMehta should the $\exists$ be replaced with $\forall$ if I want all ordered pairs $(n,m)$? – 2017-02-23
-
1@AaronHendrickson No, "all" is implicit in the set notation: $\{ x \mid P(x) \}$ denotes the set of *all* $x$ such that $P(x)$ holds. In this particular case, you want the set of all $(n,m)$ for which there *exist* $k$ and $l$ with the desired property. – 2017-02-23
1
One way is: $$ \{ (2k+1, 2l+1) \mid k, l \in \mathbb{Z}^+ \} $$
0
one another way is: $$ \{x|\exists y, z\in \Bbb{Z}: x=(y,z) \wedge \exists k, l \in \Bbb{Z}^+: y=2k+1 \wedge z=2l+1\}$$