Talk:Multiplicative function

From Wikipedia, the free encyclopedia

Somebody wrote:

the function d(n) - the number of positive divisors of n, σ(n) - the sum of all the positive divisors of n, σ_k(n) - the sum of the k-th powers of all the positive divisors of n (where k may be any complex number)

How ks can look like? Any example.? Aren't ks just simple natural numbers here?
XJam [2002.04.16]] 2 Tuesday (0)

Normally, the k is taken to be a natural number, that's correct, but the definition works fine for complex numbers, and yields a multiplicative function. Here's how to work with complex exponents, for instance k=i: 5ⁱ = e^ln(5)i = cos(ln(5)) + i sin(ln(5)) (using Eulers formula in complex analysis). AxelBoldt

Yes Axel that is quite OK. But I really don't see any necessity to extend ks over the set of natural numbers. We just have examples for σ_k(n) where k goes from 0, 1, 2 and so on. In fact special cases with k=0 and k=1 are functions d(n) ≡ σ₀(n) and σ(n) ≡ σ₁(n). It is for example with n=144, d(144)= 15, σ(144)=403. For k=2 and for n=2⁴·3²=144 we have:

σ₂(144) = σ₂(2⁴)σ₂(3²) = (1²+2²+4²+8²+16²)(1²+3²+9²) = 341 · 91 = 31031.

Because of the multiplicativity of σ_k(n) it is easier to calculate product of powers than adding all the squares of all the positive divisors of n. Futher on we have:

σ₃(144) = σ₃(2⁴)σ₃(3²) = (1³+2³+4³+8³+16³)(1³+3³+9³) = 4681 &middot 757 = 3543517,

σ₄(144) = ... = 464378915,

σ₅(144) = ... = 64178802493,

σ₆(144) = ... = 9070067614091,

σ₇(144) = ... = 1294620020196997,

σ₈(144) = ... = 185637589303481315,

σ₉(144) = ... = 26676789058694821933,

σ₁₀(144) = ... = 3837572548050547502651,

σ₁₁(144) = ... = 552334249790915518944277 and all the way to "funny" ∞.

We don't have function σ_5i(n) or do we? k is just counter here for this arithmetical function. And finally according to extension into the complex the value for σ_2i(144) is (2¹⁰ⁱ-1)(3⁶ⁱ-1)/(2²ⁱ-1)(3²ⁱ-1). But is this a mathematical reality in this particular case? What in fact ki-th powers of all the positive divisors of n are doing in arithmetical function? I guess nothing. If there are any mathematical meanings, then we should put these facts in the article, don't you agree. --XJam [2002.04.17]] 3 Wednesday (0)

σ_5i(n) is just as real a multiplicative arithmetical function as σ₁₁(n), σ_π(n) or σ_-2(n) for that matter. Personally, I don't know what they are being used for, if at all. AxelBoldt

Yes, strange. Mathematicians can 'produce' something and they can't use it anywhere. Just what Hardy dreamed about and also worked and lived on about. But perhaps we should somehow consider these cases too. Let us just not forget on negative numbers and on complex ones. There were times when people din't know what to do with them and nowadays we can find them in physical reality. And values of σ_ξ(n) become into the set of ξ and are no more part of the set of natural numbers as they are when ξ is natural number. --XJam [2002.04.18]] 4 Thur's day (0)

---

Convolution equations are not easier without an argument by no means. We have to be more carefull to read them - because e (which is defined elsewhere) can mean many things in math. And accidentally e also means more famous base of natural logarithm. So I guess we have to write e(n) to distinguish anyway. If I would write in this way at math exam, I wouldn't finish my mechanical engineering after all. I can recall all those long terms in Taylor's formulas for several variables. But every eyes have their own whitewasher... --XJam [2002.04.18]] 4 Thur's day (1st ed)

Good point, I'll call it ε. The arguments were all in the wrong places: it's not f(n)*g(n), but (f*g)(n). AxelBoldt

Yes - I was a little bit confused with (f*g)(n) too and I believe other Wikipedians also. Axel can you please clear one more another thing. Why is multiplicative function more general term than arithmetic one? Or is this just your opinion? I prefer arithmetical one because it tells me more. (And futhermore I am constantly confuseing in English natural number (N) and integer (Z).) --XJam [2002.04.18]] 4 Thur's day (2nd ed)

[edit] Classic totient identity

The part on proving the totient identity seems to be flawed... what if n is not a power of a prime? I'm not sure how to prove this identity... could somebody fix this? There might be a proof on the totient function page. CecilBlade 12:23, 6 December 2006 (UTC)