Lines Matching refs:sign
27 int sign;
73 sign = -1;
78 * -sign*X*a == B (mod |n|),
79 * sign*Y*a == A (mod |n|).
87 * (*) -sign*X*a == B (mod |n|),
88 * sign*Y*a == A (mod |n|)
110 * (**) sign*Y*a == D*B + M (mod |n|).
124 * sign*Y*a == D*A + B (mod |n|),
126 * sign*Y*a - D*A == B (mod |n|).
128 * -sign*X*a == A (mod |n|).
131 * sign*Y*a + D*sign*X*a == B (mod |n|),
133 * sign*(Y + D*X)*a == B (mod |n|).
135 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
136 * -sign*X*a == B (mod |n|),
137 * sign*Y*a == A (mod |n|).
150 sign = -sign;
157 * sign*Y*a == A (mod |n|),
161 if (sign < 0) {
203 int sign;
251 sign = -1;
256 * -sign*X*a == B (mod |n|),
257 * sign*Y*a == A (mod |n|).
273 * (1) -sign*X*a == B (mod |n|),
274 * (2) sign*Y*a == A (mod |n|)
328 * (1) -sign*X*a == B (mod |n|),
329 * (2) sign*Y*a == A (mod |n|),
334 /* -sign*(X + Y)*a == B - A (mod |n|) */
344 /* sign*(X + Y)*a == A - B (mod |n|) */
362 * (*) -sign*X*a == B (mod |n|),
363 * sign*Y*a == A (mod |n|)
415 * (**) sign*Y*a == D*B + M (mod |n|).
428 * sign*Y*a == D*A + B (mod |n|),
430 * sign*Y*a - D*A == B (mod |n|).
432 * -sign*X*a == A (mod |n|).
435 * sign*Y*a + D*sign*X*a == B (mod |n|),
437 * sign*(Y + D*X)*a == B (mod |n|).
439 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
440 * -sign*X*a == B (mod |n|),
441 * sign*Y*a == A (mod |n|).
474 sign = -sign;
482 * sign*Y*a == A (mod |n|),
486 if (sign < 0) {
634 /* remove possible negative sign */