Vuhelper
06-12-2011, 03:29 AM
Maximum Marks: 15
Due Date: June 16, 2011
Question 1; Mark: 7
Prove by mathematical induction
for all non-negative integers.
Question 2; Marks: 3
Use the Euclidean algorithm to find gcd(430, 174).
Question 3; Marks: 5
A box contains 3 red and 5 black balls; find the total number of ways such that all red balls stay together and all black balls stay together in the row.
Due Date: June 16, 2011
Question 1; Mark: 7
Prove by mathematical induction
for all non-negative integers.
Question 2; Marks: 3
Use the Euclidean algorithm to find gcd(430, 174).
Question 3; Marks: 5
A box contains 3 red and 5 black balls; find the total number of ways such that all red balls stay together and all black balls stay together in the row.