#SMALL SAMPLE OF THE EXAMPLES IN THE FIRST 30 PAGES (and more):
#OK to post
>105/25 - 1/5;
                               4
>f := %;
                             f := 4
>simplify(%);
                           csgn(x) x
>assume(0 < x);
>simplify(`%%`);
                               x

>a := (y + z)*(y + k - z):
>b := k*y*z + y^2 + y*z + z^2:
>c := a/b;
                         (y + z) (y + k - z) 
                   c := ---------------------
                                 2          2
                        k y z + y  + y z + z 
>numer(c);
                      (y + z) (y + k - z)
>denom(c);
                              2          2
                     k y z + y  + y z + z 
>p := t + 2;
>subs(t = 2, p);
                               4
>eqn := x^2 - x = 1:
>R := solve(eqn):   
>simplify(R[1]*R[2]);
                               -1
gcd(1111, 111111);
                               11
>ifactor(1111);
                           (11) (101)
>ifactor(111111);
                     (3) (7) (11) (13) (37)
>ithprime(728);
                              5507





#Code for generalized procedure of CC:

CCg:=proc(P1,A1,k1) local T1,i1:
for i1 from 1 to nops(A1) do
 T1[A1[i1]]:=A1[(i1+k1-1 mod nops(A1))+1]:
od:

[seq(T1[P1[i1]],i1=1..nops(P1))]:

end: