-1 Compute the inverse a modb with Fermat's Theorem (if applicable) for the following pairs of a and b otherwise, use the extended Euclidian Algorithm: i . ‚a = 4, b = 9 ii.,a= 5,b= 13 iii. a = 6,b=13 iv.‚a = 21,b = 212Use Euler's Theorem to find the following: i. The last digit of 554 ii. The last two digits of 33' 24242 803 iii. The last 3 digits of 51 iv. The last two digits of 11 1234

-1 Compute the inverse a modb with Fermat's Theorem (if applicable) for the following pairs of a and b otherwise, use the extended Euclidian Algorithm: i . ‚a = 4, b = 9 ii.,a= 5,b= 13 iii. a = 6,b=13 iv.‚a = 21,b = 212Use Euler's Theorem to find the following: i. The last digit of 554 ii. The last two digits of 33' 24242 803 iii. The last 3 digits of 51 iv. The last two digits of 11 1234

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.5: Shortest Path Models

Problem 30P

See similar textbooks