x := 1;y := 3;a := [1,2,3,4,5,6,7,8,9,10];z := Matrix([seq([seq(a[k], k = x+m .. y+m)], m = 0 .. 2)]);ListTools:-Occurrences(1, Vector(z(.., 1)));

how to tune with kernelopts when memory is not enough for combinatorics package?

i guess that there is a limit on the memory used by maple

if would like to give more memory for it to use and not influence too slow to move my mouse in order to press terminate button when used too much memory

a := [1,1,1,2,2,3];

number of appearance of 1 is 3

number of appearance of 2 is 2

number of appearance of 3 is 1

any short code can count this

if given a permutation group

1 2 3

2 1 3

How to calculate the cycle factorization and type of permutation group f in polya counting in maple

with(Statistics):

F := ((1/6)*z+(1/3)*z^2)/(1+(1/6)*z+(1/3)*z^2);

Dist := subs(z=t,F);

RealDist := Distribution(CDF = unapply(Dist(t-1),t)); # using this Distribution for Maple DistributionX:=RandomVariable(RealDist); # Random Variable

Pgraph := DensityPlot(X, range = -1 .. 1);

A := Sample(X, 1):

when i look help example, it has a very high range 3500,

when i want to change the range to small , it run very long time at Sample function like endless