Modulo p operation
Given a positive integer p, any integer n must have an equation
n = kp + r
Where K and R are integers and 0 ≤ r
For positive integers p and integers A and B, the following operations are defined:
Modulo operation: A
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
A ^ B mod C
Assume 0
1. The original method is to first obtain a ^ B and finally mod C.
However, this method is inefficient, and the time complexity is O (B), and a ^ B must be less than N to avoid overflow. It has great limitations.
2.
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
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
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
1. Residual: The remainder after the division is divided, for example:
MOD 4 = 2; -17 MOD 4 =-1; -3 MOD 4 =-3; 4 MOD (-3) = 1; -4 MOD 3 =-1;
If a mod B is an XOR, then the resulting symbol is the same as a; Of course, a mod B is equivalent
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): 11800 accepted submission (s): 3673Problem descriptionGive a number N, find the minimum x (x> 0) that satisfies 2 ^ x mod n =
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.