{VERSION 3 0 "IBM INTEL LINUX" "3.0" }
{USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 
1 0 0 0 0 }{CSTYLE "2D Math" -1 2 "Times" 0 1 0 0 0 0 0 0 2 0 0 0 0 0 
0 }{CSTYLE "2D Output" 2 20 "" 0 1 0 0 255 1 0 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 256 "" 1 12 0 0 0 0 0 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 
257 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 258 "" 0 1 0 0 0 
0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 259 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 
0 }{CSTYLE "" -1 260 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 
261 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 262 "" 0 1 0 0 0 
0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 263 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 
0 }{CSTYLE "" -1 264 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 
265 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 266 "" 0 1 0 0 0 
0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 267 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 
0 }{CSTYLE "" -1 268 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 
269 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 270 "" 0 1 0 0 0 
0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 271 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 
0 }{PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 
0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Text Output" -1 2 
1 {CSTYLE "" -1 -1 "Courier" 1 10 0 0 255 1 0 0 0 0 0 1 3 0 3 }1 0 0 
-1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Heading 1" 0 3 1 {CSTYLE "" -1 -1 
"" 1 18 0 0 0 0 0 1 0 0 0 0 0 0 0 }1 0 0 0 8 4 0 0 0 0 0 0 -1 0 }
{PSTYLE "" 2 6 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 2 0 0 }0 
0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Warning" 2 7 1 {CSTYLE "" -1 
-1 "" 0 1 0 0 255 1 0 0 0 0 0 0 1 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 
0 }{PSTYLE "Error" 7 8 1 {CSTYLE "" -1 -1 "" 0 1 255 0 255 1 0 0 0 0 
0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Maple Output" 0 
11 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }3 3 0 -1 -1 
-1 0 0 0 0 0 0 -1 0 }{PSTYLE "Title" 0 18 1 {CSTYLE "" -1 -1 "" 1 18 
0 0 0 0 0 1 1 0 0 0 0 0 0 }3 0 0 -1 12 12 0 0 0 0 0 0 19 0 }{PSTYLE "R
3 Font 0" -1 256 1 {CSTYLE "" -1 -1 "Helvetica" 1 24 0 0 0 0 2 1 2 0 
0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "R3 Font 2" -1 
257 1 {CSTYLE "" -1 -1 "Courier" 1 11 0 0 0 0 2 1 2 0 0 0 0 0 0 }0 0 
0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 0 258 1 {CSTYLE "" -1 -1 "" 0 
1 0 0 0 0 0 0 0 0 0 0 0 0 0 }3 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }}
{SECT 0 {EXCHG {PARA 18 "" 0 "" {TEXT -1 31 "Promenne v Maplu, vyhodno
covani" }}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 23 "Prirazeni a vyhodnocen
i" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG 
{PARA 0 "" 0 "" {TEXT -1 105 "CAS systemy jsou schopny pracovat s form
ulemi a resit ulohy, ve kterych se vyskytuji nezname a parametry." }
{TEXT 256 0 "" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "solve(a*x^2+b*x+c,
x);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$,$*&,&%\"bG!\"\"*$-%%sqrtG6#,&*
$)F&\"\"#\"\"\"\"\"\"*&%\"aGF1%\"cGF1!\"%F0F1F0F3!\"\"#F1F/,$*&,&F&F'F
(F'F0F3F6F7" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 265 "Zde a,b a c jsou \+
parametry a x je neznama. Jsou pouzity jako symboly. Toto pouziti \"vo
lnych promennych\",\nktere neukazuji na zadnou hodnotu, krome jejich v
lastniho jmena, je charakteristicke pro symbolicke systemy.\n\nPromenn
ym prirazujeme hodnoty pomoci operatoru :=." }}{PARA 258 "" 0 "" 
{TEXT -1 15 "jmeno := vyraz;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 26 "pol
:=9*x^3-37*x^2+47*x-19;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$polG,**$
)%\"xG\"\"$\"\"\"\"\"**$)F(\"\"#F*!#PF(\"#Z!#>\"\"\"" }}}{EXCHG {PARA 
0 "" 0 "" {TEXT -1 30 "Urcime koreny tohoto polynomu." }}{PARA 0 "> " 
0 "" {MPLTEXT 1 0 11 "roots(pol);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#7
$7$#\"#>\"\"*\"\"\"7$F(\"\"#" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 38 "D
osazeni jednoho z korenu do polynomu:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 17 "subs(x=19/9,pol);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"!" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 343 "V promenne pol je ulozena hodnota
 9*x^3-....... . Kdykoliv se v Maplu dale objevi promenna pol, Maple p
racuje\ns jeji hodnotou. Tomu rikame vyhodnoceni. Promenna x stale nem
a jinou hodnotu krome sveho jmena. Prikazem\nsubs x v promenne pol nah
razeno pomoci 19/9, tomuto rikame substituce; x samo o sobe zustava ne
zmeneno. \nTo same plati pro pol." }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 
"x;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"xG" }}}{EXCHG {PARA 0 "> " 
0 "" {MPLTEXT 1 0 4 "pol;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#,**$)%\"x
G\"\"$\"\"\"\"\"**$)F&\"\"#F(!#PF&\"#Z!#>\"\"\"" }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 8 "x:=19/9;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%
\"xG#\"#>\"\"*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6##\"#>\"\"*" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 4 "pol;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"!" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 120 "Maple nejdrive vyhodnoti promenno
u pol do 9*x^3-...., potom vyhodnoti kazde z x do 19/9 a nakonec prove
de\nzjednoduseni.\n" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "x+1;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6##\"#G\"\"*" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 11 "x:=neznama;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"
xG%(neznamaG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "pol;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#,**$)%(neznamaG\"\"$\"\"\"\"\"**$)F&\"
\"#F(!#PF&\"#Z!#>\"\"\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "
neznama:=7;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%(neznamaG\"\"(" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#\"\"(" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "pol;
" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"%%e\"" }}}{EXCHG {PARA 0 "" 0 "
" {TEXT -1 119 "Maple vyhodnocuje tak hluboko, jak je to v danem stavu
 systemu mozne. Toto obecne pravidlo se nazyva uplne vyhodnoceni." }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 42 "Vyjimky z pravidla uplneho vyhodno
covani:\n" }{TEXT 258 66 " vyrazy, ktere jsou uzavreny v pravych uvozo
vkach se nevyhodnocuji" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;
" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"(" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 4 "'x';" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"xG" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 65 "Uzavreni do pravych uvozovek nezam
ezuje automaticke zjednoduseni:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 
1 0 14 "'p+q-i-p+3*q';" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#,&%\"qG\"\"%
%\"iG!\"\"" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 82 "Pokud do pravych uv
ozovek (apostrofu) uzavreme jednoduchou promennou, je vysledkem" }}
{PARA 0 "" 0 "" {TEXT -1 81 "jmeno teto promenne. Tohoto postupu muzem
e pouzit k zpetnemu vyhodnoceni promenne" }}{PARA 0 "" 0 "" {TEXT -1 
15 "pouze do jmena:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "x:='x
';" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xGF$" }}}{EXCHG {PARA 0 "" 
0 "" {TEXT 262 59 "jmena nalevo od prirazovaciho operatoru := se nevyh
odnocuji" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#%\"xG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "x:=1
;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG\"\"\"" }}}{EXCHG {PARA 0 "
> " 0 "" {MPLTEXT 1 0 5 "x:=7;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"
xG\"\"(" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "i:=1; A[i]:=2; A
[i]:=3;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"iG\"\"\"" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6#>&%\"AG6#\"\"\"\"\"#" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#>&%\"AG6#\"\"\"\"\"$" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 
-1 140 "Vidime, ze index u undexovane promenne je vyhodnocovan, ale in
dexovana promenna uz dale vyhodnocovana neni (v tretim prikazu je leva
 strana " }{TEXT 270 4 "A[i]" }{TEXT -1 16 " vyhodnocena do " }{TEXT 
271 4 "A[1]" }{TEXT -1 39 ", ale to uz dale neni vyhodnoceno do 2." }}
}{EXCHG {PARA 0 "" 0 "" {TEXT -1 107 "Zpetne vyhodnoceni promenne pouz
e do jmena s vyuzitim pravych uvozovek nefunguje u indexovanych promen
nych." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "A[i]:='A[i]';" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#>&%\"AG6#\"\"\"&F%6#%\"iG" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "A[i];" }}{PARA 8 "" 1 "" {TEXT -1 
35 "Error, too many levels of recursion" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 7 "x:=x+1;" }}{PARA 7 "" 1 "" {TEXT -1 37 "Warning, recur
sive definition of name" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG,&F$
\"\"\"F&F&" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;" }}{PARA 8 
"" 1 "" {TEXT -1 35 "Error, too many levels of recursion" }}}{EXCHG 
{PARA 0 "" 0 "" {TEXT -1 82 "K odstraneni prirazeni (ukazatele) u inde
xovanych promennych muzeme pouzit prikaz " }{TEXT 267 7 "evaln()" }
{TEXT -1 1 "." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 24 "A[i]:=eval
n(A[i]); A[i];" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>&%\"AG6#\"\"\"F$" }
}{PARA 11 "" 1 "" {XPPMATH 20 "6#&%\"AG6#\"\"\"" }}}{EXCHG {PARA 0 "" 
0 "" {TEXT 259 41 "argument procedury evaln se nevyhodnocuje" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 59 "Stejneho efektu jako x:='x' dosahn
eme i procedurou evaln()." }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "evaln(x
);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"xG" }}}{EXCHG {PARA 0 "> " 0 
"" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
13 "p:=q; r:=q*s;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"pG%\"qG" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"rG*&%\"qG\"\"\"%\"sGF'" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "anames();" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6$%\"pG%\"rG" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 48 "Vypi
suje vsechny promenne s prirazenou hodnotou." }}}{EXCHG {PARA 0 "> " 
0 "" {MPLTEXT 1 0 18 "anames('integer');" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6%%'DigitsG%+printlevelG%&OrderG" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 9 "unames():" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 34 "Vypi
suje vsechny \"volne\" promenne." }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 35 "select(s->length(s)=1, \{unames()\});" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#<*%\"IG%\".G%\"!G%\"sG%\"qG%\"yG%\"OG%\"xG" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }{TEXT 263 44 "argument procedury
 assigned se nevyhodnocuje" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
12 "assigned(r);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%%trueG" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 46 "Urcuje, zda je promenna \"volna\" \+
nebo \"vazana\"." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "assigne
d(q);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%&falseG" }}}{EXCHG {PARA 0 "
" 0 "" {TEXT -1 11 "\nProcedura " }{TEXT 268 24 "assign(name, expressi
on)" }{TEXT -1 170 " ma stejny efekt jako name:=expression s vyjimkou \+
toho,\nze prvni argument procedury assign je plne vyhodnocen, zatimco \+
leva strana prirazeni pomoci := neni vyhodnocovana." }}{PARA 0 "> " 0 
"" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
5 "x:=1;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG\"\"\"" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "x:=2;" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6#>%\"xG\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "assign
(x,3);" }}{PARA 8 "" 1 "" {TEXT -1 36 "Error, (in assign) invalid argu
ments" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 94 "Procedury assign s vyhod
ou pouzivame pri prirazeni hodnot promennym pri reseni systemu rovnic.
" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 27 "eqns:=\{x+y=a, b*x-1/3*y=c\};" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#>%%eqnsG<$/,&%\"xG\"\"\"%\"yGF)%\"aG/,&*&%\"bGF)F(
F)F)F*#!\"\"\"\"$%\"cG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "v
ars:=\{x,y\}:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "sols:=solv
e(eqns,vars);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%%solsG<$/%\"yG,$*&,
&*&%\"bG\"\"\"%\"aGF-F-%\"cG!\"\"\"\"\",&F,\"\"$F-F-!\"\"F3/%\"xG*&,&F
/F3F.F-F1F2F4" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "x;y;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"xG" }}{PARA 11 "" 1 "" {XPPMATH 20 
"6#%\"yG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "assign(sols);" 
}}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "x, y;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6$*&,&%\"cG\"\"$%\"aG\"\"\"\"\"\",&%\"bGF&F(F(!\"\",$*&,&
*&F+F(F'F(F(F%!\"\"F)F*F,F&" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 50 "\n
Unassign muzeme pouzit na vice promennych naraz:\n" }}{PARA 0 "> " 0 "
" {MPLTEXT 1 0 43 "readlib(unassign): #nacte funkci z knihovny" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 60 "Vsimneme si efektu opomenuti pravi
dla uplneho vyhodnocovani:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "unass
ign(x,y): x,y; " }}{PARA 8 "" 1 "" {TEXT -1 36 "Error, (in assign) inv
alid arguments" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$*&,&%\"cG\"\"$%\"aG
\"\"\"\"\"\",&%\"bGF&F(F(!\"\",$*&,&*&F+F(F'F(F(F%!\"\"F)F*F,F&" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "unassign('x','y'): x,y;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6$%\"xG%\"yG" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 70 "Upl
ne vyhodnocovani nam dale osvetli nasledujici posloupnost prikazu:\n" 
}}{PARA 0 "> " 0 "" {MPLTEXT 1 0 17 "a:=b; b:=c; c:=3;" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#>%\"aG%\"bG" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%
\"bG%\"cG" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"cG\"\"$" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "a;" }}{PARA 11 "" 1 "" {XPPMATH 20 "
6#\"\"$" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 59 "Pro zjisteni interni r
eprezentace pouzijeme procedury eval:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 10 "eval(a,1);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"bG" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "eval(a);" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#\"\"$" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 10 "eva
l(b,1);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"cG" }}}{EXCHG {PARA 0 ">
 " 0 "" {MPLTEXT 1 0 10 "eval(c,1);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6
#\"\"$" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 10 "eval(a,2);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"cG" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 10 "eval(a,3);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"$" 
}}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 9 "Prikazem " }{TEXT 257 5 "eval " 
}{TEXT -1 74 "bez doplnujiciho parametru ziskame uplne vyhodnoceni arg
umentu, doplnujici" }}{PARA 0 "" 0 "" {TEXT -1 35 "parametr urcuje uro
ven vyhodnoceni." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "c:=5;" }
}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"cG\"\"&" }}}{EXCHG {PARA 0 "> " 
0 "" {MPLTEXT 1 0 2 "a;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 10 "eval(a,1);" }}{PARA 11 "" 1 
"" {XPPMATH 20 "6#%\"bG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "a
:=4;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"aG\"\"%" }}}{EXCHG {PARA 
0 "> " 0 "" {MPLTEXT 1 0 12 "a;eval(a,1);" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#\"\"%" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"%" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "
> " 0 "" {MPLTEXT 1 0 11 "x:=y: y:=7:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 13 "eval(x,1); x;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%\"y
G" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"(" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 5 "x:=x:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "y
:=9:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;" }}{PARA 11 "" 1 
"" {XPPMATH 20 "6#\"\"(" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 90 "Nejjis
tejsi zpusob, jak zamezit vyhodnocovani, je uzavrit argument do apostr
ofu (' ');\nPr:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;
" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "podil:=0;" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6#>%&podilG\"\"!" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 31 "rem(x^3+x+1,x^2+x+1,x,'podil');" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#,&\"\"#\"\"\"%\"xGF%" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 6 "podil;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#,&%\"xG\"\"
\"!\"\"F%" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 65 "Co se stane, pokud z
apomeneme apostrofy v predchazejicim prikazu?" }}}{EXCHG {PARA 0 "> " 
0 "" {MPLTEXT 1 0 9 "podil:=0;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%&p
odilG\"\"!" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 29 "rem(x^3+x+1,x
^2+x+1,x,podil);" }}{PARA 8 "" 1 "" {TEXT -1 49 "Error, (in rem) illeg
al use of a formal parameter" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 9 "podil:=x;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%&podilG%\"xG" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 29 "rem(x^3+x+1,x^2+x+1,x,podil)
;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#,&\"\"#\"\"\"%\"xGF%" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 29 "eval(podil,1), eval(podil,2);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6$%\"xG,&F#\"\"\"!\"\"F%" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "podil;" }}{PARA 8 "" 1 "" {TEXT -1 
35 "Error, too many levels of recursion" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 5 "i:=0;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"iG\"\"!" 
}}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "sum(ithprime(i), i=1..5);
" }}{PARA 8 "" 1 "" {TEXT -1 56 "Error, (in ithprime) argument must be
 a positive integer" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 27 "sum(
ithprime('i'), i=1..5);" }}{PARA 8 "" 1 "" {TEXT -1 112 "Error, (in su
m) summation variable previously assigned,                 second argu
ment evaluates to, 0 = 1 .. 5" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 29 "sum(ithprime('i'), 'i'=1..5);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6
#\"#G" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 7 "prikaz " }{TEXT 260 3 "se
q" }{TEXT -1 71 " nevyhodnocuje svoje argumenty, vsimnete si rozdilneh
o chovani prikazu " }{TEXT 261 3 "sum" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 5 "i:=2;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"iG\"\"#" 
}}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 17 "seq(i^2, i=1..5);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6'\"\"\"\"\"%\"\"*\"#;\"#D" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "i;" }}{PARA 11 "" 1 "" {XPPMATH 20 "
6#\"\"#" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 86 "Datove struktury array
, table, matrix a proc maji pro vyhodnocovani specialni pravidla" }}
{PARA 0 "" 0 "" {TEXT -1 1 "(" }{TEXT 265 20 "last name evaluation" }
{TEXT -1 2 ")." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" 
}}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "x:=y;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#>%\"xG%\"yG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
5 "y:=z;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"yG%\"zG" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "z:=array([[1,2], [3,4]]);" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6#>%\"zG-%'matrixG6#7$7$\"\"\"\"\"#7$\"\"$\"\"
%" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "x;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#%\"zG" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 80 "Maple vyh
odnoti x do y, y do z a ukonci vyhodnocovani, protoze posledni promenn
a" }}{PARA 0 "" 0 "" {TEXT -1 87 "z by se mela vyhodnotit do jedne ze \+
specialnich struktur. Uplneho vyhodnoceni dosahneme" }}{PARA 0 "" 0 "
" {TEXT -1 12 "pomoci eval." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
8 "eval(x);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#-%'matrixG6#7$7$\"\"\"
\"\"#7$\"\"$\"\"%" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 135 "Lokalni pro
menne uvnitr procedur se vyhodnocuji pouze o jednu uroven. Pokud chcem
e dosahnout uplneho vyhodnoceni, musime pouzit funkce " }{TEXT 266 4 "
eval" }{TEXT -1 1 "." }}}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 16 "Jmena p
romennych" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 567 "Jmeno muze obsahovat pismena, cis
lice a podtrzitko, prvnim znakem musi byt\npismeno nebo podtrzitko. Ro
zlisuji se mala a velka pismena. Rezervovana jmena:\nand, by, do, done
, elif, else, end, fi, for, from, if, in, intersect, local, minus, mod
, not, od, option, options,\nor, proc, quit, read, save, stop, then, t
o, union, while nejsou povolena. Vyhnete se dale jmenum, ktera\njiz ma
ji v Maplu vyznam (cos, exp, sqrt, ...) a jmenum, zacinajicim podtrzit
kem.\nPokud chcete ve jmenu promenne pouzivat specialnich znaku (:, me
zera, atd.), uzavrete jmeno do levych  uvozovek:\n" }}{PARA 0 "> " 0 "
" {MPLTEXT 1 0 11 "`Odpoved:`;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%)Od
poved:G" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "Pi:=5;" }}{PARA 
8 "" 1 "" {TEXT -1 54 "Error, attempting to assign to `Pi` which is pr
otected" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "cos:=x;" }}{PARA 
8 "" 1 "" {TEXT -1 55 "Error, attempting to assign to `cos` which is p
rotected" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 37 "Pozor na rozdil (viz \+
minule cviceni)!" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "evalf([
Pi, pi]);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#7$$\"+aEfTJ!\"*%#piG" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "[Pi,pi];" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#7$%#PiG%#piG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
19 "[e^x, E^x, exp(x)];" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#7%)%\"eG%\"
xG)%\"EGF&-%$expG6#F&" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "lat
ex(%);" }}{PARA 6 "" 1 "" {TEXT -1 25 "[\{e\}^\{x\},\{E\}^\{x\},\{e^\{
x\}\}]" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 264 36 "Operator zretezeni (co
ncatenation):\n" }{TEXT -1 49 "Pouziva se pro vytvareni novych jmen pr
omennych ." }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "X.Y, X.1;" }}{PARA 11 
"" 1 "" {XPPMATH 20 "6$%#XYG%#X1G" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 10 "X . (Y,1);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$%#XYG%#
X1G" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "X . (1..8);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6*%#X1G%#X2G%#X3G%#X4G%#X5G%#X6G%#X7G%#X
8G" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "`` . (X, Y) . (1..4);
" }}{PARA 11 "" 1 "" {XPPMATH 20 "6*%#X1G%#X2G%#X3G%#X4G%#Y1G%#Y2G%#Y3
G%#Y4G" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 83 "Poznamka:  Pokud pouziv
ame operatoru zretezeni (.), prvni ze jmen se nevyhodnocuje." }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "a.b;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#%#abG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "a:=x
;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"aG%\"xG" }}}{EXCHG {PARA 0 ">
 " 0 "" {MPLTEXT 1 0 5 "b:=2;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"b
G\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "a.b;" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6#%#a2G" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
5 "c:=3;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"cG\"\"$" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "a.b.c;" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6#%$a23G" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "a:=x;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"aG%\"xG" }}}{EXCHG {PARA 0 "> " 0 
"" {MPLTEXT 1 0 7 "b:=y+1;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"bG,&
%\"yG\"\"\"F'F'" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "nove_jme
no:=a.b;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%+nove_jmenoG(%\"aG,&%\"y
G\"\"\"F)F)" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "y:=3;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"yG\"\"$" }}}{EXCHG {PARA 0 "> " 0 
"" {MPLTEXT 1 0 11 "nove_jmeno;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%#a
4G" }}}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 21 "Vlastnosti promennych" }}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "
> " 0 "" {MPLTEXT 1 0 11 "(-1)^(m+n);" }}{PARA 11 "" 1 "" {XPPMATH 20 
"6#)!\"\",&%\"mG\"\"\"%\"nGF'" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 12 "simplify(%);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#)!\"\",&%\"mG\"
\"\"%\"nGF'" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 64 "Provedeme nyni zje
dnoduseni za predpokladu, ze m a n jsou licha." }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 17 "assume(m, even): " }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 16 "assume(n, even);" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 11 "(-1)^(m+n);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#)!\"\"
,&%#m|irG\"\"\"%#n|irGF'" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 
"simplify(%);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"\"" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "about(m);" }}{PARA 6 "" 1 "" {TEXT 
-1 25 "Originally m, renamed m~:" }}{PARA 6 "" 1 "" {TEXT -1 43 "  is \+
assumed to be: LinearProp(2,integer,0)" }}{PARA 6 "" 1 "" {TEXT -1 0 "
" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 19 "additionally (m>0):" }}
}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "about(m);" }}{PARA 6 "" 1 "
" {TEXT -1 25 "Originally m, renamed m~:" }}{PARA 6 "" 1 "" {TEXT -1 
80 "  is assumed to be: AndProp(RealRange(Open(0),infinity),LinearProp
(2,integer,0))" }}{PARA 6 "" 1 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "" 
0 "" {TEXT -1 76 "Pokud priradime promenne hodnotu, zrusime vsechny pr
edchazejici predpoklady." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "
m:=3;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"mG\"\"$" }}}{EXCHG {PARA 
0 "> " 0 "" {MPLTEXT 1 0 9 "about(m);" }}{PARA 6 "" 1 "" {TEXT -1 2 "3
:" }}{PARA 6 "" 1 "" {TEXT -1 55 "  All numeric values are properties \+
as well as objects." }}{PARA 6 "" 1 "" {TEXT -1 52 "  Their location i
n the property lattice is obvious," }}{PARA 6 "" 1 "" {TEXT -1 23 "  i
n this case integer." }}{PARA 6 "" 1 "" {TEXT -1 0 "" }}}{EXCHG {PARA 
0 "" 0 "" {TEXT -1 4 "Ale:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
19 "assume(n, integer);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "
expr:=cos(n*Pi);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%%exprG)!\"\"%#n|
irG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "n:=2;" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#>%\"nG\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 
1 0 5 "expr;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#)!\"\"%#n|irG" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 87 "K cemu doslo? n je prirazena hodno
ta 2, coz rusi predchazejici predpoklad pro n. Vyraz " }{TEXT 269 4 "e
xpr" }{TEXT -1 64 " stale ukazuje na \"starou\" promennou n~. Jedno z \+
moznych reseni:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 19 "assume(N
, integer);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "expr:=N;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#>%%exprG%#N|irG" }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 12 "assign(N=2);" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 5 "expr;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"#" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "expr:=sqrt(x^2);" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6#>%%exprG*$-%%sqrtG6#*$)%\"xG\"\"#\"\"\"F-" }
}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 15 "simplify(expr);" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6#*&-%%csgnG6#%\"xG\"\"\"F'F(" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "assume(x>0):" }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 15 "simplify(expr);" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6#%#x|irG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "assume(x<0
);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 15 "simplify(expr);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#,$%#x|irG!\"\"" }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 16 "coulditbe (x=2);" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6#%&falseG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "coulditbe
(x<-1);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%%trueG" }}}{EXCHG {PARA 0 
"> " 0 "" {MPLTEXT 1 0 8 "is(x<0);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#
%%trueG" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 41 "Odstraneni vlnky (~) p
ri vypisu promenne:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "inte
rface(showassumed=0);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "as
sume(q>0);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "q;" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6#%#q|irG" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 25 "interface(showassumed=2);" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 2 "q;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%#q|irG" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "interface(showassumed=1);" }
}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 23 "(Implicitni nastaveni.)" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "q;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#%#q|irG" }}}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 11 "Datov
e typy" }}{EXCHG {PARA 0 "" 0 "" {TEXT -1 128 "Jiz jsme se seznamili s
 typy: integer, fraction, floating-point number.\nProcedura pro urceni
 datovych typu se jmenuje whattype.\n" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 14 "whattype(5.0);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%&floatG" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "whattype(1);" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#%(integerG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 
1 0 14 "whattype(1/2);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%)fractionG
" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 96 "Vysledkem prikazu whattype je
 popis hlavicky datoveho vektoru.\nPrehled ziskame pomoci ?surface.\n
" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "?surface;" }}}{EXCHG {PARA 0 "" 
0 "" {TEXT -1 54 "K testovani datovych typu se pouziva dale prikazu ty
pe" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 22 "type(1/2, 'fraction');" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#%%trueG" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 21 "type(1+2*I, complex);" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6#%%trueG" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 158 "Vyraz muze byt \+
naraz jednim z vice datovych typu.\nNa rozdil od programovacich jazyku
 nemusi byt predem deklarovan typ promenne a muze se behem vypoctu men
it:\n" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 28 "number:=1: whattype(number
);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%(integerG" }}}{EXCHG {PARA 0 ">
 " 0 "" {MPLTEXT 1 0 31 "number:=0.75: whattype(number);" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6#%&floatG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 
1 0 36 "number:=convert(number, 'fraction');" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#>%'numberG#\"\"$\"\"%" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 26 "convert(number, 'binary');" }}{PARA 8 "" 1 "" {TEXT 
-1 55 "Error, (in convert/binary) invalid argument for convert" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}{EXCHG {PARA 0 "" 0 "" 
{TEXT -1 114 "Posledni priklad ilustruje skutecnost, ze ne vsechny typ
y zmen jsou v Maplu povoleny. Zmena typu musi davat smysl." }}}}}
{MARK "4" 0 }{VIEWOPTS 1 1 0 1 1 1803 }