Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Mestechkin, M.
Affiliations: Independent Scholar, 12773 Seabreeze Farms Dr. # 33, San Diego, CA, USA | E-mail: [email protected]
Correspondence: [*] Corresponding author: Independent Scholar, 12773 Seabreeze Farms Dr. # 33, San Diego, CA, USA. E-mail: [email protected].
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.
Keywords: Stirling numbers, Faulhaber formula, Chinese remainder theorem, Bowen’s hypothesis, averaged natural power
DOI: 10.3233/JCM-240001
Journal: Journal of Computational Methods in Sciences and Engineering, vol. 24, no. 4-5, pp. 3333-3339, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]