2013 UI UNDERGRADUATE MATH CONTEST Solutions 1. Let a1 = 2 and an 1 = a2n − an 1 for n = 1, 2, . . . . (i) Prove that the integers a1 , a2 , . . . are pairwise coprime (i.e., do not have a common prime factor). P 1 - Pairwise coprime - Document - PDFSEARCH.IO

First Page	Meta Content
	2013 UI UNDERGRADUATE MATH CONTEST Solutions 1. Let a1 = 2 and an+1 = a2n − an + 1 for n = 1, 2, . . . . (i) Prove that the integers a1 , a2 , . . . are pairwise coprime (i.e., do not have a common prime factor). P 1 Add to Reading List Document Date: 2013-03-03 21:07:08 Open Document File Size: 142,14 KB Share Result on Facebook Product Pentax K-x Digital Camera / / SocialTag Series Summability methods Fourier analysis Cesàro summation Fourier series Mathematical analysis Mathematics Calculus

2013 UI UNDERGRADUATE MATH CONTEST Solutions 1. Let a1 = 2 and an+1 = a2n − an + 1 for n = 1, 2, . . . . (i) Prove that the integers a1 , a2 , . . . are pairwise coprime (i.e., do not have a common prime factor). P 1Add to Reading List