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+1) satisfying; ϕ (n) = ϕ (n+1) = U (n) = U (n+1). Furthermore, we give some examples and proofs for our results.
| Original language | English |
|---|---|
| Pages (from-to) | 311-330 |
| Number of pages | 20 |
| Journal | Miskolc Mathematical Notes |
| Volume | 20 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2019 |
Keywords
- Divisor functions
- Euler totient function
- Möbius Function
Quacquarelli Symonds(QS) Subject Topics
- Mathematics
Fingerprint
Dive into the research topics of 'Certain combinatoric convolution sums arising from Bernoulli and Euler Polynomials'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver