> rt(28);

> 2+2;

> 2+3;

> 2*7;

> 4;

> 2/7;

> 2/3;

> 2/3+5;

> 2/3+5/7;
> 

> 6/7;

> sqrt(5);

> Pi;

> pi;

> e-exp(1);

> exp(1);

> 1+i;

> 1+I;

> (1+i)*(1-i);

> (1+I)*(1-I);

> a:=5;b:=2;c:=3;x:=sqrt(5);y:=sqrt(2);a+b;b*c;x^2+y;

> z:=x+I*y:z^2;

> a:='a';t:=1;t:=t+1;

> restart;b;A:=(2*x+2)*(5*x-3);B:=subs(x=(y+2)/(y-1),A);x;A;B;

> 2/3;evalf(2/3);Digits:=20;evalf(2/3);

> 1/(1+sqrt(3));y:=3;x:=y^2;p:=x^2+x+1;

> evalf(cos(Pi/3));

> Digits:=30;evalf(1/(1+sqrt(3)));

> 1+(1/(1+1/2));

> Digits:=10;evalf(1+(1/(1+1/2)));

> ((1+2/3)*(3+5/4))/((1-2/3)*(3+7/3));

> Digits:=10;evalf(((1+2/3)*(3+5/4))/((1-2/3)*(3+7/3)));

> x:=7+sqrt(2);
> 

> x^3;

> 1/x;
> 

> expand(x^3);

> rationalize(1/x);

> x:=7+sqrt(2);y:=1-5*sqrt(3);

> x*y;
> 

> evalf(x*y);

> x^2*y^3;

> x/y;

> (x+y)/(x^2-y);

> evalf(cos (Pi/8));

> x;

> evalf(cos(2*x));

> evalf(2*cos(x)*cos(x)-1);

> (1+i)/(2+3*i);

> evalf((1+i)/(2+3*i));

> evalf((1+i)^3);

> evalf((5+5*i)^2);

> z:=(1+i*sqrt(3))*(2+3*i);

> evalf(z);

> x;

> x:=2+3*I*sqrt(5);

> y:=2-I*sqrt(3);

> evalf(x+y/x^2-y);

> x:=1+I*sqrt(3);

abs(x)*
> evalf(abs(x)*exp(argument(x)));
> 

> evalf(argument(x));
> 

> argument(2+3*I);

> A:=2*x+t(y+4); whattype(A);nops(A);op(2,A);op(A);

> 
> L:=1,2,a,x+y,1/x;LL:=[1,2,a,x+y,1/x];whattype(L);nops(L);whattype(LL);nops(LL);

Error, wrong number (or type) of parameters in function nops

> L:=1,2,a,x+y,1/x;LL:=[1,2,a,x+y,1/x];whattype(L);nops(L);whattype(LL);nops(LL);

Error, wrong number (or type) of parameters in function nops

> for j from 1 to 5 do op(j,LL) od;

> S:=seq(k^2,k=1..10);LLL:=[S];

> 3!;

> S:=seq((12!)/(p!*(12-p)!),p=0..12);

> A:=5*x^2-6*x+2;convert(A,list);convert(A,`*`);

> L:=[seq(x-k,k=1..6)];convert(L,`*`);convert([seq(x-k,k=1..6)],`*`);

> 
> 
Error, the argument to factorial should be non-negative

> S:=seq((n!)/(p!*(n-p)!),p=0..n); for n from 0 to 12 do op(n,S) od; convert(S,`+`);

Error, wrong number (or type) of parameters in function op

Error, wrong number (or type) of parameters in function convert

>  for n from 0 to 12 do (seq((n!)/(p!*(n-p)!),p=0..n)) od;
> 

> f:=x->1/x;A:=x+y+z;map(f,A);

> f:=x->x^2;

> map(f,x+1);

> A=((x+1)/(x-1))+(2*x+1);

> f:=x->ln(1+x);

> x:=[0.1,0.5,1,2,3,4,10];

> Y=map(evalf@f,x);

>  A:=0;for n from  1 to 20 do A:=A+n^2 od;
> 
> 
> A;
> 
> 

> f:=x->x^2;

> x:=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20];

> Y:=map(evalf@f,x);

> convert(Y,`+`);

> a^2-b^2;

> factor(a^2-b^2);

> factor(x^2-3,sqrt(3));

> ifactor(x^2+3,complex);
Error, (in ifactor) invalid arguments

> factors(exp(a+b)+exp(a));

> for n from 0 to 10 do (print(seq(expand((x+1)^p),p=n))) od;

> expand(x+1)^4;
> t:=tan(x/2);

> expand(t,trig);

> simplify(sin(x)+sin(2*x)+sin(3*x)+sin(4*x)+sin(5*x));

> simplify(sin(x)^6*cos(x)^5);

> factor(simplify((2*t)/(1-t^2)));

> expand(sin(x),t);

> x:=2*arctan(t);
Error, recursive assignment

> clear;

> restart;
> x:=2*arctan(t);

> 
> combine(subs(x=2*arctan(t),sin(x)),trig);

> 
> for p from 0 to 100 do 
   imax:=round(sqrt(p)):
   premier:=1: 
    for i from 2 to imax do
        div:= evalf(p/i):
        if frac(div)=0 then
           premier:=0:
       fi:  
   od:
    if premier=1 then
          lprint(p, est_premier):
   fi:
 od:
0, est_premier
1, est_premier
2, est_premier
3, est_premier
5, est_premier
7, est_premier
11, est_premier
13, est_premier
17, est_premier
19, est_premier
23, est_premier
29, est_premier
31, est_premier
37, est_premier
41, est_premier
43, est_premier
47, est_premier
53, est_premier
59, est_premier
61, est_premier
67, est_premier
71, est_premier
73, est_premier
79, est_premier
83, est_premier
89, est_premier
97, est_premier
>