An Extension of the Euler Phi-function to Sets of Integers Relatively Prime to 30
- Mbakiso Mothebe
- Ben T. Modise
Abstract
Let $n \geq 1$ be an integer and let $S= \{1,7,11,13,17,19,23,29\},$ the set of integers which are both less than and relatively prime to $30.$ Define $\phi_3(n)$ to be the number of integers $x, \; 0 \leq x \leq n-1,$ for which $\gcd(30n, 30x+i) = 1$ for all $i \in S.$ In this note we show that $\phi_3$ is multiplicative, that is, if $\gcd(m, n)=1,$ then $\phi_3(mn)=\phi_3(m)\phi_3(n).$ We make a conjecture about primes generated by S.- Full Text: PDF
- DOI:10.5539/jmr.v8n2p45
This work is licensed under a Creative Commons Attribution 4.0 License.
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org