3. Let n > 2 be an integer. Show that if 2" 1 is prime, then n must be prime. 4. Let a and b be positive integers. (a) Express the ged and lem of a and b in terms of the prime factors of a and b. (b) Show that ab = ged(a,b) - lem(a, b)