Scribd
Upload
580 views17 pages

Multiplicative Function: Reporter: Airah G. Mondonedo

τ(n) is a multiplicative function that represents the sum of the divisors of n. It is multiplicative when the integers m and n are relatively prime (their greatest common divisor is 1). In that case, τ(mn) = τ(m)τ(n). Several examples are provided to demonstrate calculating τ for composite numbers by breaking them into prime factors and using the property of multiplicativity when the factors are relatively prime. τ is shown to be both a multiplicative function and, in some cases when the factors are not relatively prime, a completely multiplicative function.

Uploaded by

Karen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
580 views17 pages

Multiplicative Function: Reporter: Airah G. Mondonedo

τ(n) is a multiplicative function that represents the sum of the divisors of n. It is multiplicative when the integers m and n are relatively prime (their greatest common divisor is 1). In that case, τ(mn) = τ(m)τ(n). Several examples are provided to demonstrate calculating τ for composite numbers by breaking them into prime factors and using the property of multiplicativity when the factors are relatively prime. τ is shown to be both a multiplicative function and, in some cases when the factors are not relatively prime, a completely multiplicative function.

Uploaded by

Karen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

MULTIPLICATIVE

FUNCTION
Reporter: Airah G. Mondonedo
OBJECTIVES
At the end of the lesson you should be able to:
 Define multiplicative function.
 Differentiate multiplicative function and completely
multiplicative function.
 Solve problems involving multiplicative functions.
 Solve problems involving Tau as multiplicative function.
MULTIPLICATIVE FUNCTION
 In number theory, an arithmetic function is called
multiplicative if f is not congruent to 0.
 f is also multiplicative if f(mn) = f(m) f(n) for all m; n ∈ N
such that (m;n) = 1
 Whenever gcd (m,n) =1, when they are coprime.
 A multiplicative function is completely determined by its
behavior on the prime powers.
COMPLETELY MULTIPLICATIVE
FUNCTION
 An arithmetic function is called completely multiplicative if
f(1) = 1 and f(mn) = f(m) f(n), holds for all positive integer m
and n, even when they are not coprime.
COMPLETELY
MULTIPLICATIVE
MULTIPLICATIVE
FUNCTION
FUNCTION
Given: m = 3 & n = 2 Given: f(mn) = 25
f(mn) = f(m) f(n) f(mn) = f(m) f(n)
f(6) = f(3) f(2) f(25) = f(52)
f(m) = 3 f(m) = 5
f(n) = 2 f(n) = 5
gcd(m,n) = 1 gcd(m,n) = 5
COMPLETELY
MULTIPLICATIVE
MULTIPLICATIVE
FUNCTION
FUNCTION
Given: f(15) Given: f(98)
f(mn) = f(m) f(n) f(mn) = f(m) f(n)
f(15) = f(5) f(3) f(98) = f(72) f(2)
f(m) = 5 f(m) = 72 =49
f(n) = 3 f(n) = 2
gcd(m,n) = 1 gcd(m,n) = 1
•  Given: f (1,3)
f(mn) = f(m) f(n)
f(3) = f(1) f(3)
f(m) = 1
f(n) = 3
gcd(m,n) = 1
 m= 1 and n=3 are coprime.
 gcd (1,3) = 1
f (3) = f(1) f(3) is multiplicative function.
  Given: f(164)
f(mn) = f(m) f(n)
f(164) = f(22) f(41)
f(m) = 22 = 4
f(n) = 41
gcd(m,n) = 1
 m = 4 and n = 41 are not coprime.
f(164) = f(4) f(41) is completely
multiplicative function.
  Given: f(7, 11)
f(mn) = f(m) f(n)
f(77) = f(7) f(11)
f(m) = 7
f(n) = 11
gcd(m,n) = 1
 m = 7 and n = 11 are coprime.
 gcd (7,11) = 1
f (77) = f(7) f(11) is multiplicative
function.
  Given: f(144)
f(mn) = f(m) f(n)
f(144) = f(24) f(32)
f(m) = 24 = 16
f(n) = 32 = 9
gcd(m,n) = 1
 m = 16 and n = 9 are not coprime.
f(144) = f(16) f(9) is completely
multiplicative function.
TAU, SIGMA and PHI as
MULTIPLICATIVE
FUNCTION
TAU as MULTIPLICATIVE FUNCTION

•  𝜏(n) = the sum of divisor of n, where n ∈ Z, n 0.


The arithmetic function 𝜏(mn) is multiplicative, if m and n are
relatively prime. 𝜏(mn) = 𝜏(m) 𝜏(n) provided that the gcd(m,n)
= 1.
Solution 1 Solution 2
Given: 𝜏(117)
Given: 𝜏(117) 𝜏(mn) = 𝜏(m) 𝜏(n)
𝜏(mn) = 𝜏(m) 𝜏(n) for mn = p1k1p2k2…prkr
𝜏(117)= 𝜏(32) 𝜏(13) 𝜏(mn) = (k1+1)(k2+1)…(kr+1)

𝜏(117)= 𝜏(9) 𝜏(13)


𝜏(117)= 𝜏(32) 𝜏(131 )
𝜏(117) = (3) (2) 𝜏(117) = (2+1) (1+1)
𝜏(117) = 6 𝜏(117)= (3) (2)
𝜏(117) = 6
m=9
m = 32 = 9
n = 13 n = 131 = 13
gcd(m,n) = gcd (9,13) =1 gcd(m,n) = gcd(9,13) =1

 
∴ 𝜏(117)  is  completely   multiplicative .
Solution 1 Solution 2
Given: 𝜏(35)
Given: 𝜏(35) 𝜏(mn) = 𝜏(m) 𝜏(n)
𝜏(mn) = 𝜏(m) 𝜏(n) for mn = p1k1p2k2…prkr
𝜏(mn) = (k1+1)(k2+1)…(kr+1)
𝜏(35)= 𝜏(7) 𝜏(5)
𝜏(35) = (2) (2) 𝜏(35)= 𝜏(71) 𝜏(51 )
𝜏(35) = (1+1) (1+1)
𝜏(35) = 4 𝜏(35)= (2) (2)
m=7 𝜏(35) = 4
m = 71 = 7
n=5 n = 51 = 5
gcd(m,n) = gcd (7,5) =1 gcd(m,n) = gcd(7,5) =1

 
∴ 𝜏 ( 35 )  is   multiplicative .
Solution 1 Solution 2
Given: 𝜏(24)
Given: 𝜏(24) 𝜏(mn) = 𝜏(m) 𝜏(n)
𝜏(mn) = 𝜏(m) 𝜏(n) for mn = p1k1p2k2…prkr
𝜏(24)= 𝜏(23) 𝜏(3) 𝜏(mn) = (k1+1)(k2+1)…(kr+1)

𝜏(24) = (8) (3)


𝜏(24)= 𝜏(23) 𝜏(31 )
𝜏(24) = (4) (2) 𝜏(24) = (3+1) (1+1)
𝜏(24) = 8 𝜏(24)= (4) (2)
𝜏(24) = 8
m=8
m = 23 = 8
n=3 n = 31 = 3
gcd(m,n) = gcd (8,3) =1 gcd(m,n) = gcd(8,3) =1

 
∴ 𝜏( 24 )  is   completely   multiplicative .
Solution 1 Solution 2
Given: 𝜏(391)
Given: 𝜏(391) 𝜏(mn) = 𝜏(m) 𝜏(n)
𝜏(mn) = 𝜏(m) 𝜏(n) for mn = p1k1p2k2…prkr
𝜏(mn) = (k1+1)(k2+1)…(kr+1)
𝜏(391)= 𝜏(17) 𝜏(23)
𝜏(391) = (2) (2) 𝜏(391)= 𝜏(171) 𝜏(231 )
𝜏(391) = (1+1) (1+1)
𝜏(391) = 4 𝜏(391)= (2) (2)
m = 17 𝜏(391) = 4
m = 171 = 17
n = 23 n = 231 = 23
gcd(m,n) = gcd (17,23) =1 gcd(m,n) = gcd(17,23) =1

 
∴ 𝜏 ( 391 )  is   multiplicative .
THANK YOU 

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy