{VERSION 6 0 "IBM INTEL NT" "6.0" }
{USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 1 10 128 0 0 1 2 1 2 
0 1 2 0 0 0 1 }{PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "Times" 1 12 
0 0 0 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 3 0 3 0 2 2 0 1 }{PSTYLE "R3 \+
Font 0" -1 256 1 {CSTYLE "" -1 -1 "Helvetica" 1 9 128 0 128 1 2 2 2 2 
2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "R3 Font 2" -1 257 
1 {CSTYLE "" -1 -1 "Courier" 1 8 0 128 128 1 1 2 2 2 2 2 1 1 1 1 }1 1 
0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "Seitenumbruch" -1 258 1 {CSTYLE "" 
-1 -1 "Times" 1 10 0 0 0 1 2 1 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 1 
2 0 1 }{PSTYLE "Normal" -1 259 1 {CSTYLE "" -1 -1 "Times" 1 14 0 0 0 
1 2 1 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "Heading 1
" -1 260 1 {CSTYLE "" -1 -1 "Times" 1 18 0 0 0 1 2 1 2 2 2 2 1 1 1 1 }
3 1 0 0 8 4 1 0 1 0 2 2 0 1 }{PSTYLE "Normal" -1 261 1 {CSTYLE "" -1 
-1 "Times" 1 14 0 0 0 1 2 1 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 3 0 3 0 2 2 
0 1 }{PSTYLE "Normal" -1 262 1 {CSTYLE "" -1 -1 "Times" 1 12 0 0 0 1 
2 1 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 3 0 3 0 2 2 0 1 }}
{SECT 0 {EXCHG {PARA 262 "" 0 "" {TEXT -1 0 "" }}{PARA 262 "" 0 "" 
{TEXT -1 51 "Maple-Arbeitsblatt zu Aufgabe 29a von Anne Hoffmann" }}
{PARA 262 "" 0 "" {TEXT -1 8 "6.1.2005" }}{PARA 0 "" 0 "" {TEXT -1 0 "
" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "f:=x*y^2*z^2+x*y-y*z;" }}}{EXCHG 
{PARA 0 "" 0 "" {TEXT -1 162 "Ich definiere die Funktion sl, die ein P
olynom nach der lex-Ordnung sortiert. M\366chte man nach der grlex-Ord
nung sortieren, muss man den Eintrag (,plex) entfernen." }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 36 "sl:=u->sort(expand(u),[x,y,z],plex)
:" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 78 "Jetzt definiere ich die Poly
nome f1, f2, f3 und gebe sie bereits sortiert aus." }}}{EXCHG {PARA 0 
"> " 0 "" {MPLTEXT 1 0 48 "F[1]:=sl(x-y^2);F[2]:=sl(y-z^3);F[3]:=sl(z^
2-1);" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 66 "Nun m\374ssen noch die A
nfangswerte des Algorithmus definiert werden." }}}{EXCHG {PARA 0 "> " 
0 "" {MPLTEXT 1 0 43 "s:=3:a[1]:=0:a[2]:=0:a[3]:=0:r:=0:p:=sl(f);" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 87 "Au\337erdem werden im Algorithmus \+
die Leitterme ben\366tigt, die wie folgt definiert werden. " }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 73 "LTp:=op(1,p);\nLTF[1]:=op(1,
F[1]);\nLTF[2]:=op(1,F[2]);\nLTF[3]:=op(1,F[3]);" }}}{EXCHG {PARA 0 "
" 0 "" {TEXT -1 22 "Jetzt zum Algorithmus:" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 482 "while (p<>0)\ndo\n  i:=1:\n  while (i<(s+1))\n  do
\n    if (divide(LTp,LTF[i])=true)\n    then\n      a[i]:=a[i]+LTp/LTF
[i];\n      p:=sl(p-F[i]*LTp/LTF[i]);\n      LTp:=`if`(type(p,`+`)=tru
e,op(1,p),p);\n      i:=s+1;\n    else\n      if (i=s)\n      then\n  \+
      r:=r+LTp;\n        p:=p-LTp;\n        LTp:=`if`(type(p,`+`)=true
,op(1,p),p);\n        i:=s+1;\n      else i:=i+1;\n      end if;\n    \+
end if;\n  end do;\nend do:\n'a1'=a[1];\n'a2'=a[2];\n'a3'=a[3];\n'r'=r
;\n'f'=a[1]*F[1]+a[2]*F[2]+a[3]*F[3]+r;" }}}{EXCHG {PARA 0 "" 0 "" 
{TEXT -1 74 "Zum Schluss noch eine Kontrolle, ob der Algorithmus richt
ig gerechnet hat:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 56 "expand
(    a[1]*F[1]+a[2]*F[2]+a[3]*F[3]+r    -   f   );" }}}{EXCHG {PARA 0 
"> " 0 "" {MPLTEXT 1 0 0 "" }}}}{MARK "0 1 0" 51 }{VIEWOPTS 1 1 0 1 1 
1803 1 1 1 1 }{PAGENUMBERS 0 1 2 33 1 1 }