Prove n + (n + 1) + (n + 2)... + 2n = 3N (n + 1) / 2 by induction

Prove n + (n + 1) + (n + 2)... + 2n = 3N (n + 1) / 2 by induction

1. Suppose that when n = k, the proposition holds, that is, K + (K + 1) + (K + 2)... + 2K = 3K (K + 1) / 2. When n = K + 1, K + 1 + (K + 1 + 1) + (K + 1 + 2) +2K + (2k + 1) + (2k + 2) from the hypothesis, we can see that the original formula = 3K (K + 1) / 2 - K + 2K + 1 + 2K + 2 = 3 (K + 1) (K + 2) / 2 can be