Certain combinatoric convolution sums arising from Bernoulli and Euler Polynomials

This note presents the restricted divisor functions and describes the amicable pairs and their iterations and the iterated stable numbers derived from these new functions. These arithmetic functions are related to (2)-type Mersenne primes 2 p − 1, (2, 3)-type Mersenne primes 2 i • 3 j − 1 and multiperfect numbers. Using Mathematica 11.2, we have tabulated all iterated stable numbers and iterated amicable pairs up to 2 20 . We establish several interesting arithmetical properties of the iterated restricted divisor functions. The tables obtained suggested many open problems on iterated stable numbers, and iterated amicable pairs from iteration of the restricted divisor functions, some of which are proven here. For any natural number n, we studied the order of its iteration relative to the restricted divisor functions. Moreover, the generating series of the iterated restricted divisor functions are found.

show abstract

Iterated stable numbers and iterated amicable pairs

Kim

Bayad

Park

2021

Math Methods in App Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Certain combinatoric convolution sums arising from Bernoulli and Euler Polynomials

Abstract: In this study, we introduce the absolute Möbius divisor function U .n/. According to some numerical computational evidence, we consider integer pairs .n; n C 1/ satisfying; ' .n/ D ' .n C 1/ D U .n/ D U .n C 1/ : Furthermore, we give some examples and proofs for our results.

Cited by 1 publication

References 6 publications

Iterated stable numbers and iterated amicable pairs

Iterated stable numbers and iterated amicable pairs

Contact Info

Product

Resources

About