Understanding Cryptography by Christof Paar and Jan Pelzl - Chapter 1 Solutions - Ex1.10

- 2 mins

Exercise 1.10

Find all integers between that are relatively prime to for . We denote the number of integers which fulfill the condition by , e.g. . This function is called “Euler’s phi function”. What is for ?

Solution

I haven’t yet verified this solution independently. If you spot any mistakes, please leave a comment in the Disqus box at the bottom of the page.

:

:

:

:


Thomas Busby

Thomas Busby

I write about computing stuff

comments powered by Disqus
rss facebook twitter github youtube mail spotify instagram linkedin google google-plus pinterest medium vimeo stackoverflow reddit quora