# The sage example in Crypto (Stallings)

When I doing the exercise of the textbook in Append -C I confront a question, it says " Write a function that takes a bitlength n and generates a modulus N of bitlength n and g less than N and relatively prime to it. "

I am confused about the meaning

does is mean that I have to use the bitlength n and generate the modulus N? ( len(bin(n)) % N)?

Could you give the precise reference of the exercise in appendix C ?

I got it... exercise 11.1 in the 5th edition.