Reply
Mon 4 Jul, 2005 08:25 pm
Prove Multiplication of Natural Numbers
I was asked to prove the following theorems:
1) If each of m and n is a natural number, then there is exactly one natural number k such that m*n=k
2) If each of k, m, and n is a natural number, then each of k*(m+n), k*m, and k*n is a natural number and k*(m+n)=(k*m)+(k*n).
You can prove them through mathematical induction..
http://en.wikipedia.org/wiki/Mathematical_induction
Start with the case of k=m=n=1 instead of the case of k=m=n=0.
Unique factorization may factor (pun) into part 1.
ok
I need to work on this a few more times.