Solving
\[
\begin{align*}
n &\equiv 1 &\pmod 2 \\
n &\equiv 1 \text{ or } 0 &\pmod 3
\end{align*}
\]
we get
\[
n \equiv 1 \text{ or } 3 \pmod 6.
\]
:qed:
(Okay, #ProofInTwoToots)
Solving
\[
\begin{align*}
n &\equiv 1 &\pmod 2 \\
n &\equiv 1 \text{ or } 0 &\pmod 3
\end{align*}
\]
we get
\[
n \equiv 1 \text{ or } 3 \pmod 6.
\]
:qed:
(Okay, #ProofInTwoToots)
Solving
\[
\begin{align*}
n &\equiv 1 \pmod 2 \\
n &\equiv 1 \text{ or } 0 \pmod 3
\end{align*}
\]
we get
\[
n \equiv 1 \text{ or } 3 \pmod 6.
\]
:qed:
(Okay, #ProofInTwoToots)
Solving
\[
\begin{align*}
n &\equiv 1 (\mod 2) \\
n &\equiv 1 \text{ or } 0 (\mod 3)
\end{align*}
\]
we get
\[
n \equiv 1 \text{ or } 3 (\mod 6).
\]
:qed:
(Okay, #ProofInTwoToots)
Federati Nu: Federated N-series GNU Social is a social network, courtesy of Federati Networks. It runs on GNU social, version 2.0.0-dev, available under the GNU Affero General Public License.
All Federati Nu: Federated N-series GNU Social content and data are available under the Creative Commons Attribution 3.0 license.