Purchase Solution

Euler totient function

Not what you're looking for?

Ask Custom Question

Q12: (i) Calculate phi(15) in THREE ways.
(ii) Express in modular arithmetic

[hint:the number of integers from 1 to m that are relatively prime to m is denoted by phi(m). it is the number of elements in the set a:1=a=m and gcd(a,m)=1 ]

Purchase this Solution

Solution Summary

The solution shows three different methods for solving Euler totient function. A specific example is given and worked through. The related Euler-Fermat theorem is also discussed and appplied.

Solution Preview

Attached are three methods to solve Euler's totient function ...

Purchase this Solution

Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.