mid-solutions - Midterm. Mathematics 312, Section 101...

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

View Full Document Right Arrow Icon
Midterm. Mathematics 312, Section 101 Thursday, October 21, 2010. Instructor: Z. Reichstein. Problem 1: (6 marks) Use mathematical induction to show that 2 n > n 2 for every integer n 5. Solution: Base case. For n = 5, 2 n = 32 and n 2 = 25, so the desired inequality holds. For the induction step assume (1) 2 n > n 2 for some n 5. We need to show that 2 n +1 > ( n + 1) 2 . Multiplying both sides of (1) by 2, we obtain 2 n +1 > 2 n 2 . It thus remains to show that 2 n 2 ( n + 1) 2 for every n 5. Indeed, 2 n 2 > 36 25 n 2 = (1 + 1 5 ) 2 n 2 (1 + 1 n ) 2 n 2 = ( n + 1) 2 , as claimed. This completes the proof. Problem 2: (6 marks) Find all integer solutions of the linear equation ax + (3 a + 1) y = 1 . Here a is a given positive integer and x , y are unknowns. Solution: One solution is clearly x 0 = - 3, y 0 = 1. Since it exists, gcd( a, 3 a + 1) divides 1 and hence, equals 1. The general solution is thus x = - 3 + (3 a + 1) n , y = 1 - an , as n ranges over the integers. Remark: The fact that gcd(3
Background image of page 1

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

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

This note was uploaded on 12/28/2010 for the course MATH 312 taught by Professor Zinovyreichstein during the Winter '10 term at The University of British Columbia.

Page1 / 2

mid-solutions - Midterm. Mathematics 312, Section 101...

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