pinealservo
/
wiki
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

An un-summarized change.

master
Levi Pearson 2014-01-24 12:10:52 -07:00 committed by git repository hosting
parent 92c3437ba4
commit 3d40971529
1 changed files with 14 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
math/number_theory/notes.page
View File

@ -61,3 +61,17 @@ b\mid a &\to bc\mid ac\\
and and
$$c\mid a \cdot c\mid b \to c\mid ma + nb$$ $$c\mid a \cdot c\mid b \to c\mid ma + nb$$
for all integers $m$ and $n$ for all integers $m$ and $n$
A number $p$ is *prime* if:
i. $p > 1$
ii. $p$ has no positive divisors except $1$ and $p$
The number $1$ is not considered prime.
A number is *composite* if it is greater than $1$ and not prime.
**Theorem 1**
: Every positive integer, except $1$, is a product of primes.