This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ( n r ) .] 3(d) By considering the numbers of subsets of diï¬€erent sizes of a set of n elements, explain why (4pts) Â± n Â¶ + Â± n 1 Â¶ + Â·Â·Â· + Â± n n Â¶ = 2 n 4. Work out the two values of (5pts) âˆš 1 + i [Use any reasonable method.] 5. (a) Write out the quotient and remainder obtained by dividing 525 by 231. (5pts) (b) Use Euclidâ€™s algorithm to work out the greatest common divisor of 525 and 231. (5pts) 5(c) Express the greatest common divisor of 525 and 231 in the form (5pts) 525 a + 231 b where you must work out the integers a and b ....
View
Full Document
 Spring '08
 Staff
 Math, Algebra, Division, Natural number, Prime number, Greatest common divisor, Euclidean algorithm

Click to edit the document details