Calculating Euler phi function

AI Thread Summary
To compute the Euler phi function for a large integer, knowing its prime factorization is essential. For a product of two primes, N = p * q, the function can be calculated using the formula phi(N) = (p-1)(q-1). Implementing this in Matlab requires understanding how to factor N into its prime components. The discussion highlights the challenge of prime factorization, especially for large numbers, which is a key aspect in RSA encryption. Overall, the calculation simplifies significantly when the prime factors are known.
paton51
Messages
8
Reaction score
0
How do i comput the euler phi function of a large interger?
i know that if p is prime then phi(p)=p-1 and I've found a formula for computing non primes but i don't know how to implement in something like Matlab.
Does anyone know how?
 
Mathematics news on Phys.org
AFAIK, computing the Euler phi function requires you to know the prime factorization of the input. Unless you can find it, there's not much you can do.
 
Yes i know the factorisation problem is hard. I am workin with RSA encryption so we know two large primes, the product of which is N this is what i want to do euler phi on.
Since N is the product of two primes (p and q) is phi(N) simply (p-1)(q-1)?
 

Thread 'What Exactly is Dirac’s Delta Function? - Insight'

Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
View full post »

Thread 'Fermat's Last Theorem'

Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
View full post »
Thread 'Imaginary Pythagorus'

Thread 'Imaginary Pythagorus'

I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
View full post »

Similar threads

B Calculating the coprime probability of two integers in a different way
Replies
13
Views
2K
I Connection of zeta to primes: less Euler than error or L-functions?
Replies
2
Views
2K
I Extend Euler Product Convergence Over Primes: Basic Qs
Replies
0
Views
1K
A Help needed with derivation: solving a complex double integral
Replies
1
Views
2K
I Am I misapplying something here? (Exponentials; Euler's identity)
Replies
3
Views
148
Insights Investigating Some Euler Sums
Replies
0
Views
2K
Insights The History and Importance of the Riemann Hypothesis
Replies
0
Views
2K
I Can Angular Velocity Accurately Control Ragdoll Limbs in Game Physics?
Replies
6
Views
3K
A How do I express an equation in Polar coordinates as a Cartesian one.
Replies
1
Views
2K
MHB Prove congruence for powers of 2
Replies
3
Views
3K

Hot Threads

Recent Insights

Back
Top