(Homework 4.1) |
m (User:Aifrank moved to 4.1 Homework: wrong name) |
(No difference)
| |
Revision as of 01:13, 29 August 2008
Does anyone know how to go about starting problem 50 for 4.1
Use mathematical induction to show that given a set of n + 1 positive integers, none exceeding 2n, there is at least one integer in this set that divides another integer in the set.
