sol3 115A - MAT 115A University of California Fall 2010...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: MAT 115A University of California Fall 2010 Solutions Homework 3 1. Rosen 3.3 #20, pg. 95 Let a 1 ,a 2 ,...,a n be integers not all equal to zero. Is it true that the greatest common divisor of these integers ( a 1 ,...,a n ) is the least posi- tive integer of the form m 1 a 1 + m 2 a 2 + + m n a n where m 1 ,...,m n Z ? If so, prove it. If not, give a counterexample. Solution: The statement is true. Let d be the smallest positive linear combination of the a k . Let us write (1) d = m 1 a 1 + + m n a n with m i Z . We claim that d | a i for all 1 i n . To prove this use the division algorithm to write a i = q i d + r i where 0 r i < d . Then r i = a i- q i d = (1- m i ) a i- n X k =1 ,k 6 = i m k a k is a linear combination of the a k . Since 0 r i < d and d was the smallest positive such linear combination, we conclude that r i = 0. Hence d | a i for all 1 i n ....
View Full Document

Page1 / 2

sol3 115A - MAT 115A University of California Fall 2010...

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