Coursework.Info - Inspiration in an Instant

On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:

Maths Coursework The totient function ?(n), also called Euler's totient function, is defined as the number of positive integers <= n which are relatively prime to (i.e., do not contain any factor in common with) n, where 1 is counted as being relatively prime to all numbers. Since a number less than or equal to and relatively prime to a given number is called a totative, the totient function ? (n) can be simply defined as the number of totatives of n. For example, there are eight totatives of 24 (1, 5, 7, 11, 13, 17, 19, and 23), so ?24=8. The totient function is implemented in Mathematics as EulerPhi [n]. In this part of the coursework will be investigating the phi function of: 1) ?(p) 2) ?(m x n) = ?(m) x ?(n) 3) ?(pn) 4) Other methods of calculating the Phi values of an integer that I found from the net. Find the value...

To see the full version of this document, and 145,320 others