Abstract
Let n ≥ 1 be an integer. Define ϕ2(n) to be the number of positive integers x, 1 ≤ x ≤ n, for which both 6x−1 and 6x+1 are relatively prime to 6n. The primary goal of this study is to show that ϕ2 is a multiplicative function, that is, if gcd(m, n) = 1, then ϕ2(mn) = ϕ2(m)ϕ2(n). Key words: Euler phi-function, multiplicative function.
| Original language | English |
|---|---|
| Pages (from-to) | 12-14 |
| Number of pages | 3 |
| Journal | African Journal of Mathematics and Computer Science Research |
| Volume | 9 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2016 |