Talk:Number Theory/Elementary Divisibility

Some things to do
needs to be changed, or a theorem needs to be added. Doctormatt 05:16, 11 October 2006 (UTC)
 * definition of a prime number and composite number
 * definition of a divisor
 * Theorem 4 says let "p be a prime divisor of n" without explaining/justifiying the existance of such a divisor. Either Theorem 4
 * an "end of proof" symbol should probably be added to the proofs
 * lots more stuff!

Theorems 1 - 3 use divisibility (the | symbol), but theorems 4, 5 use actual division, even where the numbers require a fractional represention.

JeremyBoden

Fix the induction proof. The following statement in the proof:

If $$N+1$$ is composite, then $$N+1$$ is divisible by some prime

is using the theorem (or at least a very close one that N+1 is divisible by at least one prime).

Bill

Discret mathematics
Proofs to properties of divisibility Mikolisis (discuss • contribs) 12:03, 8 February 2016 (UTC)