mod 5 2

Http://mathforum.org/library/drmath/view/52343.htmlMod function and negative numbers Date: 04/28/2000 at 11:17:09From: AnneSubject: Using the mod() function with negative numbersI work in IT - Technical Support. I am trying to sort out a problem for

2^X mod n = 1Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 13341 Accepted Submission (s): 4143Problem descriptiongive a number n, find the minimum x (x>0) that satisfies 2^x mod n = 1.Inputone

The beauty of the original root G of the modulo prime p is reflected in the presence of a non-zero number G power of each modulo p. Therefore, for any number 1 G, G ^ 2, G ^ 2, ''', G ^ (P-2), G ^ (pm) Exactly the same as model a P. The

Ask for the smallest X to make a ^ x = B (mod C) Question: [Expand the baby step giant step to solve the discrete logarithm problem] Author aekdycoin![Normal baby step giant step][Problem model]Solution0 [Idea]We can make an equivalentX = I

Long time no write, in fact, has been doing, but not the mood to write a summary of the article, so or later to do a little bit to write it.Recently the state is very poor very bad, the water problem all can not pass, I am also drunk.Redo last

Time Limit: 2 seconds memory limit: 65536 KB Give a number N, find the minimum X that satisfies 2 ^ x mod n = 1. Input One positive integer on each line, the value of N. Output If the minimum x exists, print a line with 2 ^ x mod n =

2^X mod n = 1Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 14349 Accepted Submission (s): 4438Problem descriptiongive a number n, find the minimum x (x>0) that satisfies 2^x mod n = 1.Inputone

2^x mod n = 1Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others) total submission (s): 12605 Accepted Submission (s): 3926Problem DescriptionGive a number n, find the minimum x (x>0) that satisfies 2^x mod n = 1.InputOne

/*2 ^ x mod n = 1Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 11800 accepted submission (s): 3673Problem descriptionGive a number N, find the minimum x (x> 0) that satisfies 2 ^ x mod n =

2 ^ x mod n = 1 Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 11542 accepted submission (s): 3577 Problem descriptiongive a number N, find the minimum x (x> 0) that satisfies 2 ^ x mod n = 1.