圆锥曲线因子分解算法
本帖最后由 wsc810 于 2020-2-1 17:22 编辑B = 7; n = 45113; v = 1; u = 1; a = 2;
For <= B, j++,
p = Prime; l = Floor/Log]];
For[i = 1, i <= 10, i++, c = v; d = u;
f[{s_, t_}] := Mod[{s c + a t d, s d + t c}, n];
{v, u} = Nest]];
GCD
选取整数a ,使得雅克比符号 $(a/n)=-1$, n 为要分解的数
这里的i 怎么理解，B怎样选取
页:
[1]