intsu11h5

intsu11h5 - and this is just an example to make sure we are...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Introductory Number Theory. Homework 5 Due: Tuesday, June 21, 2011, 4:45PM 1. Textbook, Exercise 21.3. This exercise has 5 parts. 2. Textbook, Exercise 21.6, parts (b), (c). 3. Let p 3 be prime and let g be a primitive root modulo p . Show there exists k , 1 k p - 1 such that g k +1 g k + 1 (mod p ). For example,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and this is just an example to make sure we are all on the same page! , if p = 13 and g = 7 (7 is a primitive root mod 13), then 7 5 ≡ 11 (mod 13) and 7 6 ≡ 12 = 11+1 (mod 13), so k = 5. 4. Textbook, Exercise 22.4. 5. Textbook,Exercise 24.1...
View Full Document

  • Summer '11
  • STAFF
  • primitive root mod, Primitive root modulo n, primitive root, primitive root modulo, introductory number theory

{[ snackBarMessage ]}

Ask a homework question - tutors are online