1. The problem statement, all variables and given/known data prove by induction that K|n!+k for all integers [tex]n \ge 2 [/tex] and k = 2,3,4,......,n this one is different than other proofs I have had because Ive only dealt with n changing but now n and k change. k goes up to n, does this mean k and n have the same values? for instance, P(2) [tex]2|2! + 2 \Rightarrow 2|4[/tex] so p(k) is [tex]k|n!+k; n=k[/tex] [tex]k|k!+k[/tex] ??