1. The problem statement, all variables and given/known data neither my professor nor my TA could figure this out. so they are offering fat extra credit for the following problem Let n be a positive integer greater than 1 and let p1,p2,...,pt be the primes not exceeding n. show that p1p2...pt<4n 3. The attempt at a solution I really dont know where to start here. just throwing this out there, im guessing they got 4k by having the sum of something like 2k+1 choose k but thats just a complete guess.