06-14-2011, 04:17 AM
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.
a[B][/B]
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]
