``Good'' numbers (Q1817509)

The authors say that a number \(a\) is ``good'' for \(h\) if \(((a+1)^h-1)h^{-1}\) is an integer. Several conjectures, suggested by a computer search, are proposed concerning the sequence of all numbers good for a fixed \(h\). The sequence of the differences of consecutive good numbers is periodical, and the authors call any squarefree \(h\) whose associated period is 1 a \(g\)-prime and explore the existence of \(g\)-primes in the Fibonacci, Mersenne and Fermat sequences. Tables and diagrams summarizing their computer search are included. In the second part of the paper the authors prove some of their conjectures. The proofs are elementary in character, and exploit well-known properties of polynomials and congruences.