|
|
PROG
| (PARI) n = 1035; for (j = 1, 8, f = factor(n); m = matsize(f)[1]; a = vector(2^m); count = 0; moz = vector(m, x, [ -1, 0]); forvec(x = moz, count++; r = chinese(Mod(x[1], f[1, 1]^f[1, 2]), Mod(x[2], f[2, 1]^f[2, 2])); for (i = 3, m, r = chinese(r, Mod(x[i], f[i, 1]^f[i, 2]))); a[count] = lift(r)); a = vecsort(a); b = vector(2^m, i, a[i]*(a[i] + 1)/2); i = 3; while (!(b[i]%2), i++); n = b[i])); (Wasserman)
|
