In the proof of Theorem 2.6 in [1], we reduced the comparison of Ii(n) and Ii+1(n) to Ii−k(n − k) and Ii+1(n − k). Then, we mistakenly stated: “Suppose i − k > k, then we repeat the same reduction.” In fact, the reduction can be repeated only if i′ = n − k − i = i − k + 1. Consequently, Theorem 2.6 was proved only for t = 2. For similar reasons, Corollary 2.7 was proved only for t = 2, and Theorem 2.8 only for t = 1.