Lines Matching full:sign
214 int sign;
249 sign = -1;
253 * -sign*X*a == B (mod |n|),
254 * sign*Y*a == A (mod |n|).
270 * (1) -sign*X*a == B (mod |n|),
271 * (2) sign*Y*a == A (mod |n|)
320 * (1) -sign*X*a == B (mod |n|),
321 * (2) sign*Y*a == A (mod |n|),
327 /* -sign*(X + Y)*a == B - A (mod |n|) */
335 /* sign*(X + Y)*a == A - B (mod |n|) */
352 * (*) -sign*X*a == B (mod |n|),
353 * sign*Y*a == A (mod |n|)
400 * (**) sign*Y*a == D*B + M (mod |n|).
412 * sign*Y*a == D*A + B (mod |n|),
414 * sign*Y*a - D*A == B (mod |n|).
416 * -sign*X*a == A (mod |n|).
419 * sign*Y*a + D*sign*X*a == B (mod |n|),
421 * sign*(Y + D*X)*a == B (mod |n|).
423 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
424 * -sign*X*a == B (mod |n|),
425 * sign*Y*a == A (mod |n|).
459 sign = -sign;
467 * sign*Y*a == A (mod |n|),
471 if (sign < 0)
514 int sign;
550 sign = -1;
554 * -sign*X*a == B (mod |n|),
555 * sign*Y*a == A (mod |n|).
564 * (*) -sign*X*a == B (mod |n|),
565 * sign*Y*a == A (mod |n|)
580 * (**) sign*Y*a == D*B + M (mod |n|).
592 * sign*Y*a == D*A + B (mod |n|),
594 * sign*Y*a - D*A == B (mod |n|).
596 * -sign*X*a == A (mod |n|).
599 * sign*Y*a + D*sign*X*a == B (mod |n|),
601 * sign*(Y + D*X)*a == B (mod |n|).
603 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
604 * -sign*X*a == B (mod |n|),
605 * sign*Y*a == A (mod |n|).
615 sign = -sign;
622 * sign*Y*a == A (mod |n|),
626 if (sign < 0)
