drygdryg/calc
1
0
Fork 0
mirror of https://github.com/lcn2/calc.git synced 2025-08-16 01:03:29 +03:00
Code Issues Packages Projects Releases Wiki Activity

Fix many spelling errors

Browse Source
This commit is contained in:
Landon Curt Noll
2021-02-12 22:09:47 -08:00
parent 486f4c5626
commit 507fe026e5
154 changed files with 482 additions and 476 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
zfunc.c
View File

@@ -377,7 +377,7 @@ zcomb(ZVALUE z1, ZVALUE z2, ZVALUE *res)
* the result is 1 if m == x^2 (mod n) for some x.
* otherwise the result is -1.
*
* If n is not prime, then the result does not prove that n is not prine
* If n is not prime, then the result does not prove that n is not prime
* when the value of the Jacobi is 1.
*
* Jacobi evaluation of (m / n), where n > 0 is odd AND m > 0 is odd:
@@ -456,7 +456,7 @@ zfib(ZVALUE z, ZVALUE *res)
{
long n;
int sign;
ZVALUE fnm1, fn, fnp1; /* consecutive fibonacci values */
ZVALUE fnm1, fn, fnp1; /* consecutive Fibonacci values */
ZVALUE t1, t2, t3;
FULL i;