“…They first proved that all integer solutions of equation (1.4) such that n > 1 and d = x are (x, y) = (0, 0), (x, y, n) = (1, ±2, 2), (2, ±5, 2), (24, ±182, 2) or (x, y) = (−1, −1) with 2 ∤ n. Secondly, they showed that if p ≡ ±5 (mod 12) is prime, p | d and v p (d) ≡ 0 (mod n), then equation (1.4) has no integer solution (x, y) with k = 2. In 2014, the equation (x − 1) k + x k + (x + 1) k = y n x, y, n ∈ Z, n ≥ 2, (1.5) was solved completely by Zhang [22], for k = 2, 3, 4 and the next year, Bennett, Patel and Siksek [4], extend Zhang's result, completely solving equation (1.5) in the cases k = 5 and k = 6. In 2016, Bennett, Patel and Siksek [5], considered the equation (1.4).…”