and how to prove this make x and y are conjugate by an element of  N?

with(GroupTheory):
with(group):
G := AlternatingGroup(3);

IsFinite(G);

GroupOrder(G);

spg := SylowSubgroup(3, G);

IsAbelian(spg);

Elements(spg);
lprint(%);

H := Subgroup(G, spg);
got error, invalid input here,

GroupTheory:-SylowSubgroup(3, module () local labels, minSupp,

maxSupp, suppSize, AtkinsonsAlgorithm, IsSimpleGroupOrder,

doDerivedSeries, doLowerCentralSeries, Intersection2,

RightCosetRepresentatives, LeftCosetRepresentatives, PRA,

`Giant?`, `Even?`, doStab1, doStab, CycleIndexMonomial;

export generator_list, n, supergroup, Sylows, pCores,

ModulePrint, ModuleDeconstruct, Generators, Orbit, Orbits,

IsTransitive, Transitivity, IsPrimitive, GroupOrder,

Elements, IsAbelian, IsElementary, IsSimple, ConjugacyClass,

ConjugacyClasses, CayleyTable, Centre, DerivedSubgroup,

IsPerfect, DerivedSeries, LowerCentralSeries, NilpotencyClass\

, IsNilpotent, doUpperCentralSeries, UpperCentralSeries,

SylowSubgroup, IsSubgroup, IsNormal, Core, NormalClosure,

Normaliser, Conjugator, AreConjugate, Centraliser,

Intersection, `intersect`, LeftCoset, RightCoset,

RightCosets, LeftCosets, Factor, RandomElement, IsAlternating\

, IsSymmetric, PCore, FittingSubgroup, FrattiniSubgroup,

MatrixRepresentation, Stabiliser, CycleIndexPolynomial,

properties; option object; end module)
Error, invalid input: GroupTheory:-Subgroup expects its 1st argument, generators, to be of type {list, set, identical(undefined)}, but received module () local labels, minSupp, maxSupp, suppSize, AtkinsonsAlgorithm, IsSimpleGroupOrder, doDerivedSeries, doLowerCentralSeries, Intersection2, RightCosetRepresentatives, LeftCosetRepresentatives, PRA, `Giant?`, `Even?`, doStab1, doStab, CycleIndexMonomial; export generator_list, n, supergroup, Sylows, pCores, ModulePrint, ModuleDeconstruct, Generators, Orbit, Orbits, IsTransitive, Transitivity, IsPrimitive, GroupOrder, Elements, IsAbelian, IsElementary, IsSimple, ConjugacyClass, ConjugacyClasses, ...

N := Normaliser(G, spg);

H2 := Subgroup(G, G);

how to find the subgroup G which is finite group here?

elist := Elements(H2);
AreConjugate(elist[1], elist[2], N);

originally x and y are not conjugate,

how to prove this make x and y are conjugate by an element of  N if spg is abelian

where x and y are elements of H2 which is subgroup of G, which is finite group

i guess find subgroup with following command, however, normaliser N can not

make elements of x and y conjugate

H2 := Subgroup(Elements(G), G);
elist := Elements(H2);
AreConjugate(elist[2], elist[3], N); #N*elist[1]*N^(-1) = elist[2]

but it is false,

i use G := AlternatingGroup(5); it is true,

does it mean that this theorem is not for all cases?

To saving my time i create a function like this:

LTTS:=proc(ff)

local ll,r,r1,r2,r3;

ll:=rhs(ff)-lhs(ff);
solve01(ll):
solve02(ll):
solve03(ll):
solve04(ll):
solve05(ll):
end:

 But when i run it, it is only give me the result of solve05(ll). when i run alone from solve01 to solve05 it still give me result.

I also try:

myfunction:solve01(ll):solve02(ll):solve03(ll):solve04(ll):solve05(ll):

It still the same :(

que funciones equivalentes en Maple son las que tiene Matlab con

[K,v] = convexHull(DT) also returns the area or volume bounded by the convex hull.

This one really has me baffled.

What the proc does is not important. This is just about as simple an example as I could write. Maple 2015 is complaining anytime I try to declare a local variable. The second example shows that the local declaration is needed - Maple even introduces it into the procedure that it defines.

restart;

test := proc(  )
 local a;
 a := 3
end proc;
Error, unexpected `local` declaration in procedure body

test := proc(  )
# local a;
 a := 3
end proc;
Warning, `a` is implicitly declared local to procedure `test`
test := proc(x) local a; a := x end proc

Here's the version information for my current Maple.

interface( version );
Standard Worksheet Interface, Maple 2015.0, Windows 7, February 17 2015 Build ID 1022128

Can someone explain what is happening, and why I'm just now seeing this?

Doug

---------------------------------------------------------------------
Douglas B. Meade  <><
Math, USC, Columbia, SC 29208  E-mail: mailto:meade@math.sc.edu
Phone:  (803) 777-6183         URL:    http://www.math.sc.edu

Hello,

I would like to build a periodic curve but starting from a parametric curve and not with a function.

Thanks to you tips, I could obtain a periodic function with a piecewise function starting from a function (http://www.mapleprimes.com/questions/208795-Periodic-Piecewise-Function)

I would like to do the same approach but starting from this parametric curve f :

V:=Vector([cos(t),sin(t)]);
f:=unapply(V, t);
plot( [f(t)[1],f(t)[2], t = 0..evalf(Pi)],color=red, scaling=constrained);

And I would like to build a periodic curve (the period is defined on the x axis) g such as :

Unfortunately, the approach presented in the post http://www.mapleprimes.com/questions/208795-Periodic-Piecewise-Function does'nt work anymore.

Do you have ideas to build this periodic curve starting from the parametric curve defined above ?

The aim of my question is more linked to the methodolody than the result.

Thank you for your help.

A lot of my life is at the moment spent using solve to solve systems of equations, and then trying to weed through the solutions maple gives to find the ones I am interested in. Specifically i'd like to have a program that can weed through the solutions and eliminate those that include equalities of the  form p[i]=-p[j] or p[i]=0  where i and j are integers (or equalities of that form with the letter q replacing p). Specifically i don't want to exclude equalities of the form p[i]=-p[j]*something+something else-another thing.... as they can be useful (or equalities of that form with the letter q replacing p).

Here is a (simple) example of the kind of equations I am likely to be solving and their output from solve:
A := solve([p[1]*p[2]*p[3] = q[1]*q[2]*q[3], p[1]+p[3] = q[1]+q[3], p[2]^2+p[3]^2 = q[2]^2+q[3]^2])

I have some code which gets rid of solutions where one variable is set to 0 

with(ArrayTools);
GetRidOfDumbSolutions := proc (sols)
local Nsols, Npars, GoodSol, GoodSols, GoodSolsCounter, i, j;
Nsols := numelems(sols); Npars := numelems(sols[1]);
GoodSols := []; GoodSolsCounter := 0;
for i to Nsols do
GoodSol := 1;
for j to Npars do
if IsZero(rhs(sols[i, j]))
then GoodSol := 0
end if
end do;
if GoodSol = 1 then
GoodSols := Concatenate(1, GoodSols, sols[i])
end if
end do;
GoodSols
end proc

but i can't see how (in maple) to detect an expression of the form p[i]=-p[j] especiall if that is being written in 2-d math. (i don't quite understand the different maths environments or how to convert from one to another or to string)

Good Morning,

This is the script that I have used to to an integration, as the command ''int'' didn't work because the coputation was really heavy.

p_old := 0;

g := 0; #index

E_tot_net_Point := 0;

for g to 2 do

 h := g+1;

 loopstart := SP_time[g];

 loopend := SP_time[h];

  for tt from loopstart by 0.01 to loopend do

   t := tt;

   P_tot_net_Fkt := t -> C_motore[g]*omega_motore[g]

if t≠SP_time[g] and t ≠ SP_time[h] then

 P_tot_net_Point := P_tot_net_Fkt(t);

 P_tot_net_Point_next := P_tot_net_Fkt(t+0.001);

 plt_P_tot_net_plt[t] := pointplot([t, P_tot_net_Point]);

 E_tot_net_Point := E_tot_net_Point+(P_tot_net_Point*0.01);

 plt_E_tot_net_plt[t] := pointplot([t, E_tot_net_Point]);

 p_old := P_tot_net_Point;

end if;      

  end do:

end do:

plots:-display(entries(plt_E_tot_net_plt, 'nolist'), title = "Energy", color = "Red", symbol = point, symbolsize = 20, gridlines = true, size = [1000, 500], labels = ['[s]', '[Watt*s]'], font = [axes, 12])


I have plotted the function as a series of points over the orizontal axis (t).

Now I would like to calculate the last value of the curve (which is itself a point) as a function of the orizontal axes t. How can I do it?

Something like E_tot_net_Point = f(t)

Thank you for the help

I have a maple homework on the collatz conjecture, but i am new to maple and does not know how to program it.

our professor gave us the first part, i tried a lot of different loop, but keep getting errors. Need HELP.

I need to test all integer m <= 60, i dont know how to set up a loop that can test all 60 numbers.

> restart;

> k := proc (x) options operator, arrow; piecewise(type(x, even), (1/2)*x, 3*x+1) end proc;
/ 1 \
x -> piecewise|type(x, even), - x, 3 x + 1|
\ 2 /
> 
> m := 3;
> k(m);
> for j to 200 while k(%) > 1 do k(%) end do;
> print(m, j+1);

I have a homework ask you to find the first string of (at least)10, 50, 100 consecutive composites. I have no idea how to use maple. HELP

all i can think of is 

>ithprime(i+1) - ithprime(i) = 10

>print(i+1, i)

and combine it with some loop

i dont know how to set up a loop

 need a lot of help 

I saw a presentation Calculus 1 -- I'm pretty sure it was Maple -- that showed how to set up a volume of solid of revolutionvisually rotated the region and looked at it from different points of view.

Is there someplace I could go to find out ho0w to do that.  I am new and in experienced in using Maple.

Thanks in advance.

Tim Wisecarver

Georgetown preparatory School

twisecarver@gprep.org

Hi so im trying to create a loop which allows me to find the first square after this number 
zahl:=1234567: could you guys tell me whats wrong and explain me why it is wrong, i suck at this :/

thank you so much 

zahl:=1234567:
 while sqrt(zahl)<> round(sqrt(zahl)) do  
   zahl:=zahl +1  
     if sqrt(zahl)<> round(sqrt(zahl))then  
  print(zahl):  
 end if:
 end do;

I assume that I'm not providing the correct input to the simplify command to get the simplification that I want.  In particular, for the following code:

assume(n, positive);
simplify(3^(-(1/2)*n)*2^((1/6)*n)-2^((2/3)*n)*6^(-(1/2)*n));
simplify(log(3^(-(1/2)*n)*2^((1/6)*n))-log(2^((2/3)*n)*6^(-(1/2)*n))); 

The expression should evaluate to 0.  However, the first expression does not simplify to 0 (it does not simplify at all in Maple) while the second expression simplifies to 0.

The simplification is fairly easy for the first expression by factoring 6 and combining terms; it seems like I'm not entering the command to simplify in this way.

Hai everyone

may i ask why solution have an error?

hope i have an answer

r

Download soret.mw

I want to build a custom component by the material’s stress-strain curve ,for the component signal input is the x(t)(displacement-time curve), then I can simulate the material’s acceleration-time curve，the stress-strain equation , parameter and the custom component I built has been given in the picture，but the x(t) is same as the s[rel](t),so how to solve this problem? Thanks first.