#Dayoon Kim, 2024-2-4, HW1

###HW1. Maple Book
#Chapter 1
105/21;
f:=%;
g:=4;
f+g;
?index[function]
?worksheet[how to]

#Chapter 2
tan(pi/5);
evalf(%);
E := exp(1): evalf(E, 20);
Digits:=30;
evalf(E);
conver(%, rational);

#Chapter 3
p:=y^2+2*y+1;
factor(p);
q:=(y + 1)^2;
expand(q);
p1:= y*z^2 + z^3 + y^2 + y*z + 2*y;
collect(p1, y);

###HW3
CCg:=proc(P,A,k) local T,i1:
for i1 from 1 to nops(A) do
 T[A[i1]]:=A[(i1+k-1 mod nops(A))+1]:
od:

# Check if all members of P belong to A
for i1 from 1 to nops(P) do
 if not member(P[i1], A) then
  return FAIL:
 end if:
od:

[seq(T[P[i1]],i1=1..nops(P))]:

end: