Revision as of 19:19, 28 August 2008 by Aifrank (Talk)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood