Fix any errors in my proof (beginner)
Critique my proof on correctness, structure, etc.
Theorem. For every integer n, $6 \vert n$ $\ \text iff$ $2 \vert n$ and $3 \vert n$.
Proof. Let $n$ be an arbitrary integer.
$(\rightarrow)$ Suppose $6 \vert n$. $\exists k \in \mathbb{Z}(6k = n)$, so $3(2k) = n$ and $n \vert3$. Likewise, $6k = 2(3k) = n$, so $2 \vert n$. Thus, $2 \vert n$ and $3 \vert n$.
$(\leftarrow)$ Suppose $n \vert 3$ and $n \vert 2$. $\exists j \in \mathbb{Z} (3j = n)$ and $\exists k \in \mathbb{Z} (2k = n)$. Thus $6(k - j) = 6k - 6j = 3(2k) - 2(3j) = 3n - 2n = n$. Becaus $k - j$ is an integer, it follows that $n \vert 6$.
$\therefore$ $\forall n \in \mathbb{Z}$, $6 \vert n$ $\ \text iff$ $2 \vert n$ and $3 \vert n$.
Answer
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
- answered
- 594 views
- $5.00
Related Questions
- Given $|f(x) - f(y)| \leq M|x-y|^2$ , prove that f is constant.
- Fix any errors in my proof (beginner)
- Advice for proving existence claims
- Proof through inclusion (A∆B) ∪ A = A ∪ B
- Fix any errors in my proof (beginnner)
- Topic: Large deviations, in particular: Sanov's theorem
-
Math Proofs: "An alternative notation is sometimes used for the union or intersection of an indexed family of sets."
- proof by induction