Lines Matching defs:sign
248 int sign;
266 sign = -1;
270 // -sign*X*a == B (mod |n|),
271 // sign*Y*a == A (mod |n|).
281 // (1) -sign*X*a == B (mod |n|),
282 // (2) sign*Y*a == A (mod |n|)
336 // (1) -sign*X*a == B (mod |n|),
337 // (2) sign*Y*a == A (mod |n|),
341 // -sign*(X + Y)*a == B - A (mod |n|)
351 // sign*(X + Y)*a == A - B (mod |n|)
371 // sign*Y*a == A (mod |n|),
374 if (sign < 0) {
482 int sign;
506 sign = -1;
510 // -sign*X*a == B (mod |n|),
511 // sign*Y*a == A (mod |n|).
517 // (*) -sign*X*a == B (mod |n|),
518 // sign*Y*a == A (mod |n|)
528 // (**) sign*Y*a == D*B + M (mod |n|).
539 // sign*Y*a == D*A + B (mod |n|),
541 // sign*Y*a - D*A == B (mod |n|).
543 // -sign*X*a == A (mod |n|).
546 // sign*Y*a + D*sign*X*a == B (mod |n|),
548 // sign*(Y + D*X)*a == B (mod |n|).
550 // So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
551 // -sign*X*a == B (mod |n|),
552 // sign*Y*a == A (mod |n|).
565 sign = -sign;
577 // sign*Y*a == A (mod |n|),
580 if (sign < 0) {
