Lines Matching defs:sign
213 int sign;
248 sign = -1;
252 * -sign*X*a == B (mod |n|),
253 * sign*Y*a == A (mod |n|).
269 * (1) -sign*X*a == B (mod |n|),
270 * (2) sign*Y*a == A (mod |n|)
319 * (1) -sign*X*a == B (mod |n|),
320 * (2) sign*Y*a == A (mod |n|),
326 /* -sign*(X + Y)*a == B - A (mod |n|) */
334 /* sign*(X + Y)*a == A - B (mod |n|) */
351 * (*) -sign*X*a == B (mod |n|),
352 * sign*Y*a == A (mod |n|)
399 * (**) sign*Y*a == D*B + M (mod |n|).
411 * sign*Y*a == D*A + B (mod |n|),
413 * sign*Y*a - D*A == B (mod |n|).
415 * -sign*X*a == A (mod |n|).
418 * sign*Y*a + D*sign*X*a == B (mod |n|),
420 * sign*(Y + D*X)*a == B (mod |n|).
422 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
423 * -sign*X*a == B (mod |n|),
424 * sign*Y*a == A (mod |n|).
458 sign = -sign;
466 * sign*Y*a == A (mod |n|),
470 if (sign < 0)
513 int sign;
549 sign = -1;
553 * -sign*X*a == B (mod |n|),
554 * sign*Y*a == A (mod |n|).
563 * (*) -sign*X*a == B (mod |n|),
564 * sign*Y*a == A (mod |n|)
579 * (**) sign*Y*a == D*B + M (mod |n|).
591 * sign*Y*a == D*A + B (mod |n|),
593 * sign*Y*a - D*A == B (mod |n|).
595 * -sign*X*a == A (mod |n|).
598 * sign*Y*a + D*sign*X*a == B (mod |n|),
600 * sign*(Y + D*X)*a == B (mod |n|).
602 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
603 * -sign*X*a == B (mod |n|),
604 * sign*Y*a == A (mod |n|).
614 sign = -sign;
621 * sign*Y*a == A (mod |n|),
625 if (sign < 0)
