Number TheoryHardFactors & Multiples ShareFactors & Multiples · Hard problemLet PkP_kPk be the product of the first kkk primes, 2⋅3⋅5⋯pk2\cdot3\cdot5\cdots p_k2⋅3⋅5⋯pk. Which statement is true for every k≥1k \ge 1k≥1?AEvery prime factor of Pk+1P_k + 1Pk+1 is larger than pkp_kpk.BPk+1P_k + 1Pk+1 is prime.CPk+1P_k + 1Pk+1 is divisible by the next prime pk+1p_{k+1}pk+1.DPk+1P_k + 1Pk+1 has at least one prime factor smaller than pkp_kpk.Check Show answer Walk through it step by step Practice more like this Review this concept