Let p be an odd prime and r a primitive root of p. Show that if a and b are positive integers in ZP then logr(ab) ? logr a + logr b (mod p ? 1).
Step 1 of 3
Chapter 1: Sections 1-6 1.1 What is a Function A function is a rule that takes certain numbers as inputs and assigns to each a definite output number. Domain: the set of all input numbers Range: the set of all output numbers Independent Variable: input Dependent Variable: output Interval Notation: Closed Intervals: a ⦤ t ⦤b and is written [a,b] Open Intervals: a <...
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Since the solution to 56E from 4.4 chapter was answered, more than 239 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 56E from chapter: 4.4 was answered by , our top Math solution expert on 06/21/17, 07:45AM. This full solution covers the following key subjects: log, Positive, integers, mod, odd. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The answer to “Let p be an odd prime and r a primitive root of p. Show that if a and b are positive integers in ZP then logr(ab) ? logr a + logr b (mod p ? 1).” is broken down into a number of easy to follow steps, and 36 words. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.