version 1.1, 1999/12/08 05:47:44 |
version 1.2, 1999/12/10 06:58:49 |
|
|
|
|
$B9=B$BN$rMQ$$$k$^$G$b$J$$MWAG$N=89gBN$r(B, $B%j%9%H$GI=$9$3$H$,$G$-(B, |
$B9=B$BN$rMQ$$$k$^$G$b$J$$MWAG$N=89gBN$r(B, $B%j%9%H$GI=$9$3$H$,$G$-(B, |
C $B$GD>@\=q$/>l9g$KHf3S$7$F%W%m%0%i%`$,C;$/(B, $BFI$_$d$9$/=q$1$k(B. |
C $B$GD>@\=q$/>l9g$KHf3S$7$F%W%m%0%i%`$,C;$/(B, $BFI$_$d$9$/=q$1$k(B. |
|
|
|
@item |
|
$B%f!<%6Dj5AH!?t$K$*$1$k%*%W%7%g%s;XDj(B. |
|
|
|
$B$3$l$K4X$7$F$O(B, @xref{$B%*%W%7%g%s;XDj(B}. |
@end itemize |
@end itemize |
|
|
@node $B%f!<%6Dj5AH!?t$N=q$-J}(B,,, $B%f!<%68@8l(B Asir |
@node $B%f!<%6Dj5AH!?t$N=q$-J}(B,,, $B%f!<%68@8l(B Asir |
Line 124 C $B$GD>@\=q$/>l9g$KHf3S$7$F%W%m%0%i%`$,C;$/(B, $BF |
|
Line 129 C $B$GD>@\=q$/>l9g$KHf3S$7$F%W%m%0%i%`$,C;$/(B, $BF |
|
* $B%k!<%W(B break return continue:: |
* $B%k!<%W(B break return continue:: |
* $B$5$^$6$^$J<0(B:: |
* $B$5$^$6$^$J<0(B:: |
* $B%W%j%W%m%;%C%5(B:: |
* $B%W%j%W%m%;%C%5(B:: |
|
* $B%*%W%7%g%s;XDj(B:: |
@end menu |
@end menu |
|
|
@node $B%f!<%6Dj5AH!?t(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B |
@node $B%f!<%6Dj5AH!?t(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B |
Line 631 A-- $BCM$O85$N(B A $B$NCM(B, A = A-1 |
|
Line 637 A-- $BCM$O85$N(B A $B$NCM(B, A = A-1 |
|
#define TS(a) car(cdr(car(a))) |
#define TS(a) car(cdr(car(a))) |
#define MAX(a,b) ((a)>(b)?(a):(b)) |
#define MAX(a,b) ((a)>(b)?(a):(b)) |
@end example |
@end example |
|
|
|
|
|
@node $B%*%W%7%g%s;XDj(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B |
|
@subsection $B%*%W%7%g%s;XDj(B |
|
|
|
$B%f!<%6Dj5A4X?t$,(B @var{N} $BJQ?t$G@k8@$5$l$?>l9g(B, $B$=$N4X?t$O(B, @var{N} |
|
$BJQ?t$G$N8F$S=P$7$N$_$,5v$5$l$k(B. |
|
|
|
@example |
|
[0] def factor(A) @{ return fctr(A); @} |
|
[1] factor(x^5-1,3); |
|
evalf : argument mismatch in factor() |
|
return to toplevel |
|
@end example |
|
|
|
$BITDj8D0z?t$N4X?t$r%f!<%68@8l$G5-=R$7$?$$>l9g(B, $B%j%9%H(B, $BG[Ns$rMQ$$$k$3$H$G(B |
|
$B2DG=$H$J$k$,(B, $B<!$N$h$&$J$h$jJ,$+$j$d$9$$J}K!$b2DG=$G$"$k(B. |
|
|
|
@example |
|
% cat factor |
|
def factor(F) |
|
@{ |
|
Mod = getopt(mod); |
|
ModType = type(Mod); |
|
if ( ModType == 1 ) /* 'mod' is not specified. */ |
|
return fctr(F); |
|
else if ( ModType == 0 ) /* 'mod' is a number */ |
|
return modfctr(F,Mod); |
|
@} |
|
@end example |
|
|
|
@example |
|
[0] load("factor")$ |
|
[1] factor(x^5-1); |
|
[[1,1],[x-1,1],[x^4+x^3+x^2+x+1,1]] |
|
[2] factor(x^5-1|mod=11); |
|
[[1,1],[x+6,1],[x+2,1],[x+10,1],[x+7,1],[x+8,1]] |
|
@end example |
|
|
|
2 $BHVL\$N(B @code{factor()} $B$N8F$S=P$7$K$*$$$F(B, $B4X?tDj5A$N:]$K@k8@$5$l$?0z(B |
|
$B?t(B @var{x^5-1}$B$N8e$m$K(B @var{|mod=11} $B$,CV$+$l$F$$$k(B. $B$3$l$O(B, $B4X?t<B9T;~(B |
|
$B$K(B, @var{mod} $B$H$$$&(B keyword $B$KBP$7$F(B @var{11} $B$H$$$&CM$r3d$jEv$F$k$3$H(B |
|
$B$r;XDj$7$F$$$k(B. $B$3$l$r%*%W%7%g%s;XDj$H8F$V$3$H$K$9$k(B. $B$3$NCM$O(B |
|
@code{getopt(mod)} $B$G<h$j=P$9$3$H$,$G$-$k(B. 1 $BHVL\$N8F$S=P$7$N$h$&$K(B |
|
@var{mod} $B$KBP$9$k%*%W%7%g%s;XDj$,$J$$>l9g$K$O(B, @code{getopt(mod)} $B$O7?(B |
|
$B<1JL;R(B -1 $B$N%*%V%8%'%/%H$rJV$9(B. $B$3$l$K$h$j(B, $B;XDj$,$J$$>l9g$NF0:n$r(B if $BJ8(B |
|
$B$K$h$j5-=R$G$-$k(B. @samp{|} $B$N8e$m$K$O(B, $BG$0U8D$N%*%W%7%g%s$r(B, @samp{,} |
|
$B$G6h@Z$C$F;XDj$9$k$3$H$,$G$-$k(B. |
|
|
|
@example |
|
[100] xxx(1,2,x^2-1,[1,2,3]|proc=1,index=5); |
|
@end example |
|
|
|
|