I use Mathematica. This code finds integer points on the sphere

(x-2)^2 + (y-4)^2 + (c-6)^2 =15

and select two of them so that distance of two this points equal to 4.

ClearAll[a, b, r, c];
a = 2;
b = 4;
c = 6;
r = 15; ss =
Subsets[{x, y, z} /.
Solve[{(x \[Minus] a)^2 + (y \[Minus] b)^2 + (z \[Minus] c)^2 ==
r^2, x != a, y != b, z != c, x y z != 0}, {x, y, z},
Integers], {2}];
t = Select[ss, And @@ Unequal @@@ Subsets[Flatten[#], {2}] &];
Length[t]
Select[ss, Apply[EuclideanDistance, #] === 4 &]

and this code select four points on the shere so that none of three points make a right triangle

ClearAll[a, b, r, c];
a = 2;
b = 4;
c = 6;
r = 15;
ss = Subsets[{x, y, z} /.
Solve[{(x - a)^2 + (y - b)^2 + (z - c)^2 == r^2, x != a, y != b,
z != c, x y z != 0, x > y}, {x, y, z}, Integers], {4}];
nonright =
Pick[ss, (FreeQ[#, \[Pi]/2] &) /@ ({VectorAngle[#2 - #1, #3 - #1],
VectorAngle[#1 - #2, #3 - #2],
VectorAngle[#1 - #3, #2 - #3]} & @@@ ss)];
Select[nonright, (12 == Length[Union @@ #] &)]

 I am looking for a  procedure in Maple.  I have some problems with this sphere. For example:

Choose four points so that 12 coordinates difference and it makes a square.

Can your code improve with sphere?

Hello everyone,

I'm new at maple.Sorry if this question asked before me, but i couldnt find it.

As i said i am new

so when I open new document (mode) at maple2015 i can do basic calculations for instance additon substraction multipicitaions. But when i want the  calculate x^2+5-3 and enter it supposed to be say to me blue line as a answer. But maple says nothing.

is there any point that i missing? 

Thank you very much all you in advance.

When I wish to perform a "save as" or "export" operation on the menu bar, how do I make Maple default to the same directory as the file is located? On one of my installations, once I select a file, the directory becomes the default "save as" or "export" directory. On my other installation, it first offers me to save to the desktop and I have to search for the subdirectory desired. (This difference occurs across many versions of Maple). Installation is Windows 10.

Is this deliberate or a bug?  If deliberate, what is the reason?

> Algebraic[GetAlgebraics]( 1*I );

                                        {I}

> Algebraic[GetAlgebraics]( 1.0*I );

                                        {}

I want to solve the following equation for E[k]:

fr = 1.64*10^6*E[k]^2*exp(-8.5/E[k]);

Maple 17 gives

solve(fr = 1640000.00*E[k]^2*exp(-8.5/E[k]), E[k]);

          4.25000000000000             4.25000000000000     
    ----------------------------, --------------------------
            /  5442.65560181792\          /5442.65560181792\
    LambertW|- ----------------|  LambertW|----------------|
            |        (1/2)     |          |      (1/2)     |
            \      fr          /          \    fr          /

Maple 2015 gives:

solve(fr = 1.64*10^6*E[k]^2*exp(-8.5/E[k]),E[k]);
Error, (in solve) invalid input: `evalf/LambertW` uses a 2nd argument, zz, which is missing

This is Maple 2015.2 on OS X 10.10 Yosemite.

I can copy-paste Maple 17's solution into Maple2015 and it evaluates correctly (for a given value of fr).

Is this a bug or am I missing something? Help on LambertW looks identical for both versions of Maple.

M.D.

Hello,

Is it possible to obtain a nice indentation with a automatic process? Do you have some tips on this subject?

My objective is to improve the indentation of my code so as to make my worksheet easier to read.

Thank you for your help.

Hello,

Thanks to different posts of the subject "Exporting data from Excel to Maple", I could learn the method to do it and conduct it.

Now, I would like to store the data exported from Excel to Maple in the worksheet and make my worksheet independent from the excel sheet.

The idea is that I can send my worksheet to a collegue and he can use without the excel sheet.

May you advice me a strategy to store the imported data ?

The copy/ paste works but it doesn't look smart.

Thank you for your help.

Hello All.

Why Maple can’t do this Simple indefinite integral?

I'm have a integral :

Please compare to Mathematica:

Thanks in advance for your help.

I_Mariusz

test.mw

Hello people in mapleprime

maxi:=proc(obj,expre,x,y)
local eq1,eq2,eq3,lagrangean;
lagrangean:=obj+lambda*expre;
eq1:=diff(lagrangean,x)=0:
eq2:=diff(lagrangean,y)=0:
eq3:=diff(lagrangean,lambda)=0:
solve({eq1,eq2,eq3},{x,y});
end proc;

Using the above procedure, next code will not return the values of a and b, or a[2] and b[2].

Can you teach me the reason why?

maxi(a*b,z-a-b,a,b);

maxi(a[2]*b[2],z-a[2]-b[2],a[2],b[2])

Thanks in advance.

taro

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)