Purchase Solution

Totient function proof

Not what you're looking for?

Ask Custom Question

** Please see the attached file for the complete problem description **

For n in Z, n>=2 let phi n denote Euler's totient function.....

Attachments
Purchase this Solution
Solution Summary

This provides an example of a set of proofs regarding Euler's totient function.

Solution Preview

(a) Recall that the field of complex numbers C has phi (n) primitive n-th roots of unity,
hence the n-th cyclotomic polynomial PHI_n also has degree phi(n), where

PHI_n (x) = Product_{e primitive} (x - e)

(b) If C_n denotes the cyclic group of order n, then C_{mn} ~ C_m x C_n if and only if m and n
are relatively (coprime). Also, C_n has phi(n) elements of order n.

It is ...

Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

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

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Probability Quiz

Some questions on probability

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.

View More Free Quizzes
Related BrainMass Solutions

  • Euler Totient Function (Six Problems)

    27707 Euler Totient Function (Six Problems) For this problem it helps to know that: 3x7x13 = 273 (a) Define the Euler Totient function, (SYMBOL) For (b) to (f) please see attached.

  • Euler totient function

    360918 Number theory: Euler Totient function (phi) and Euler-Fermat Theorem Q12: (i) Calculate phi(15) in THREE ways.

  • Applying Euler's Totient Theory to Cryptography

    For any a relatively prime to n, we have a^(phi(n)) = 1 (mod n) where phi(n) is the totient function of n and it means the number of integers relatively prime to n within Zn.

  • Sophie Germain Primes

    It is obvious that , according to Euler's Totient Theorem, we have (mod ). Since we also have (mod ), let , then we must have (mod ). Now we find out the possible value of . Since and , then .

  • Discrete logarithm problem

    Familiarity with Euler's totient function is assumed.

  • Period of a Fraction

    Can you give mathematical proof for this? Here is a link to the problem being discussed: http://boards.straightdope.com/sdmb/showthread.php?t=720360 For the fixed a = b/c, let's define a function f(n) as follows.

  • Determinant function proof

    Please see the attached proof. This is a proof regarding the determinant function.

  • Probability density function

    205583 Probability density function proof See file. thanks Show that the function...defines a PDF of some random variable. see attached This provides an example of working with a proof regarding a probability density function.

  • Integrate an Inequality and Find a Density Function

    Proof: Since is uniformly distributed on , then its density function is and its distribution function is .

View More Related Solutions