Scribd
Upload
275 views

Euler's Phi Fuction

This document discusses Euler's phi function, which counts the number of positive integers less than or equal to n that are relatively prime to n. It provides several theorems about the phi function, including that if n is prime then phi(n) is n-1, and if n is the product of distinct primes then phi(n) can be calculated by multiplying the phi values of the prime factors. The phi function is useful in number theory and cryptography.

Uploaded by

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

Euler's Phi Fuction

This document discusses Euler's phi function, which counts the number of positive integers less than or equal to n that are relatively prime to n. It provides several theorems about the phi function, including that if n is prime then phi(n) is n-1, and if n is the product of distinct primes then phi(n) can be calculated by multiplying the phi values of the prime factors. The phi function is useful in number theory and cryptography.

Uploaded by

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

Coding Euler’s

phi(ø)
Function : Exploring
Its Application In
Number Theory
introducti0n
Euler’s phi(ø) Function:
Euler’s phi function often denoted as ø(n) .
It is a crucial tool in number theory and
cryptography, it is also used in modular
arithmetic and prime factorization.
It also plays a significant role in the field of
cybersecurity
definition
For n≥1, ø(n) denotes
the number of positive
integers not exceeding n
and that are relatively
prime to n.
Example of the definition
Calculate the value of ø(30)
Among the positive integers that do not exceed 30 only 8
numbers are relatively prime to 30 they are
1,7,11,13,17,19,23,29
therefore ø(30)=8

->Note that ø(1)=1 because gcd(1,1)=1


Theorem 1:
If n is a prime number, then every integer less than n is
relatively prime to
therefore ø(n)=n-1 where n is a prime number

Example: ø(5)=5-1=4
i.e.; 1,2,3,4
Theorem 2:
If p is a prime number and k>0,then
ø(𝑃𝑘 )=𝑃𝑘 − 𝑃𝑘−1
Example: ø(9)=ø(32 )=32 -3=6
i.e.; 1,2,4,5,7,8
Theorem 3:
The function ø is a multiplicative function
ø(mn)=ø(m)ø(n) where m and n are relatively prime and
m>1 and n>1

Example: ø(45)=ø(9)ø(5)
therefore ø(45)=6*4=24
Theorem 4:
If the integer n>1 has the prime factorization
𝑘1 𝑘2 𝑘𝑛
n=𝑃1 𝑃2 ………...𝑃𝑛
1 1 1
ø(n)=n(1- )(1- )…………..(1- )
𝑃1 𝑃2 𝑃𝑛
Theorem 5:
If n=2𝑘 then
Ø(n)=ø(2𝑘 )=2𝑘−1
Thank you!!
Presented by:
N.Manideep(23071A6244)
K.Karthikeya(23071A6226)
P.Vignesh(23071A6248)

You might also like