Question: Write your own python function called DiscreteLog(,) which inputs an integer a and a positive integer n, and returns the smallest positive integer k such
Write your own python function called DiscreteLog(,) which inputs an integer a and a positive integer n, and returns the smallest positive integer k such that 2^k is congruent to a (modulo n), if such a k exists. If the k doesn't exists, return 0. Use function to find k such that 2^k is congruent to 452 (mod 1019)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
