this is for holding javascript data
Marisol Ontiveros edited untitled.tex
about 10 years ago
Commit id: c7d340ee1b0243fa90a400bb3ce6d388892c8620
deletions | additions
diff --git a/untitled.tex b/untitled.tex
index f545544..ddd4a55 100644
--- a/untitled.tex
+++ b/untitled.tex
...
$2$n+$1$=($4$m)($4$m)+$4$m+$3$
\smallskip
When solving for this the right hand side will be even since and odd plus and odd results in and even integer.The right hand side will be divisible by $2$ when m does not equal $1$ showing that $x$ and $y$ be both prime only when $x$=$3$,
becasue after that on When x does not equal 3 the right side will be even and divisible by 2 while the left side will be odd.