this is for holding javascript data
Marisol Ontiveros edited untitled.tex
about 10 years ago
Commit id: 480143c99c55e5ef4037f4280b577958da630247
deletions | additions
diff --git a/untitled.tex b/untitled.tex
index 8476e6b..f068b8b 100644
--- a/untitled.tex
+++ b/untitled.tex
...
\end{problem}
\begin{solution}
If $x$=$0$ (mod $3$),then for $x$ to be prime $x$ must be $3$. If $x$=$1$(mon$3$), then $x$ has to be $4$.
The this shows that the next $x$ will be prime relative to $3$.
We can then assume $x$=$2$$m$+$1$, and $y$=$2n$+$1$, since odd numbers can be represented as $2$$m$+$1$ and
$2n$+$1$ where $m$ and $n$ are integers.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{problem}