Abstract
The explicit formulae for remainder of sum of powers of successive natural numbers (SPSN) divided by any prime factor p of the number N of sum terms is derived. The remainder is zero, if N contains pj, j>1. It is also 0, if j=1 and the exponent is not divisible by p-1. The expression (N-N/p) (mod p), named “eigen-remainder” introduced for N is the remainder of SPSN in the rest of cases. All natural numbers, having all eigen-remainders equal to 1, are found not exceeding 42. It is demonstrated that in all other cases, there exists a prime divisor of N, which dividing SPSN gives the remainder ≠ 1. This proves Bowen’s hypothesis.
Reference11 articles.
1. Rose HE, Course in Number Theory, 2nd ed. Oxford: Oxford University Press; 1994.
2. Problem;Erdős;Amer Math Monthly,1935
3. Advanced problem 4347;Erdős;Amer Math Monthly,1949
4. Guy RK, Unsolved problems in number theory. Springer; 2004.
5. On two combinatorial identities;Mestechkin;J Comp Meth Sci & Eng,2017