Assignment3

Assignment3 - n 2 1(mod 8 5 Compute using the Euclidean...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Math 240, Fall 2009 — Assignment 3 — Due: Monday, October 19 1. Show that if f ( x ) is a polynomial of degree n with real coefficients, then f ( x ) is Ω( x n ). 2. Prove, using induction, that 1 3 + 2 3 + 3 3 + ··· + n 3 = ± n ( n + 1) 2 ² 2 for all positive integers n . 3. Prove, using induction, that 1 2 n 1 · 3 · 5 ··· (2 n - 1) 2 · 4 · 6 ··· (2 n ) whenever n is a positive integer. 4. Prove that if n is an odd positive integer then
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n 2 ≡ 1 (mod 8). 5. Compute using the Euclidean algorithm: (a) GCD(1529, 14039) (b) GCD(1529, 14038) (c) GCD(1111111, 11111111) 6. Compute 10 785 (mod 23). Math 240 — Assignment 3 — Fall 2009 Marker: Gabriel Charette Instructor: Benjamin Young Date: Name: Student Number:...
View Full Document

This note was uploaded on 10/03/2010 for the course MATH 240 taught by Professor Szabo during the Spring '08 term at McGill.

Page1 / 2

Assignment3 - n 2 1(mod 8 5 Compute using the Euclidean...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online