Generally speaking, one can solve equations, inequalities, or systems of them. One can't solve polynomials. They can be evaluated though,

eval(x^2 + 5*x + 5, x=.25);

                                6.3125

or

f:=x->x^2+5*x+5:

f(.25);

                                6.3125

If you want to find values of x for which the value of that polynomial is .25, that can be done using fsolve,

fsolve(x^2 + 5*x + 5 = .25);

                      -3.724744871, -1.275255129

Alec

Generally speaking, one can solve equations, inequalities, or systems of them. One can't solve polynomials. They can be evaluated though,

eval(x^2 + 5*x + 5, x=.25);

                                6.3125

or

f:=x->x^2+5*x+5:

f(.25);

                                6.3125

If you want to find values of x for which the value of that polynomial is .25, that can be done using fsolve,

fsolve(x^2 + 5*x + 5 = .25);

                      -3.724744871, -1.275255129

Alec

The usual arithmetic operations, such as +, -, *, ^, matrix product (for which Maple uses a dot, .), and some others, such as ^%T for the transposed matrix, can be done without loading LinearAlgebra. The construction of a Matrix or a Vector also can be done without it. But the operations the names of which one can see by typing

with(LinearAlgebra);

such as Determinant, for example, need either this package loaded, or have to be used in a long form, LinearAlgebra:-Determinant in this example.

Alec

The usual arithmetic operations, such as +, -, *, ^, matrix product (for which Maple uses a dot, .), and some others, such as ^%T for the transposed matrix, can be done without loading LinearAlgebra. The construction of a Matrix or a Vector also can be done without it. But the operations the names of which one can see by typing

with(LinearAlgebra);

such as Determinant, for example, need either this package loaded, or have to be used in a long form, LinearAlgebra:-Determinant in this example.

Alec

Which now can be done as

[a,b] /~ [1,2];

                               [a, b/2]

Alec

Which now can be done as

[a,b] /~ [1,2];

                               [a, b/2]

Alec

I don't exactly understand what you mean by one direction. You can visualize correlations as the cosines of angles between vectors. If the vectors are perpendicular, it is 0, if the angle is acute, it is positive, and if the angle is obtuse, it is negative. So if you choose unit vectors not randomly distributed, but from some specific spherical regions, you can get desirable signs. For example, choosing them close to each other, you get all dot products (i.e.correlations) positive. Choosing them close to the different vertices of a regular simplex, you can get all of them negative (except the values on the diagonal.) etc.

Alec

I don't exactly understand what you mean by one direction. You can visualize correlations as the cosines of angles between vectors. If the vectors are perpendicular, it is 0, if the angle is acute, it is positive, and if the angle is obtuse, it is negative. So if you choose unit vectors not randomly distributed, but from some specific spherical regions, you can get desirable signs. For example, choosing them close to each other, you get all dot products (i.e.correlations) positive. Choosing them close to the different vertices of a regular simplex, you can get all of them negative (except the values on the diagonal.) etc.

Alec

It is a part of Visual Studio. Also, the binary can be read in any binary (or hex as they often called) editor, and grep can be used directly on binaries. But all of these seem to be going out of the range of normal Maple usage.

Alec

Then there seem to be no a normal way of finding all functions (including built-in) depending on the given one, unless the kernel source will be available.

Just for comparison, in Python the usual documentation tools, such as epydoc, for example, produce a picture of the tree of classes and functions, with all dependencies easily seen.

Alec

Another possibility is to use march to list all entries in the libraries, then print their contents in a list of strings, then search this list for, say, sin, and search recursively for the names of all entries containing sin etc. That may be rather slow (i didn't try it), but should work. Modules might create some problems, but I'm sure that they could be also worked with.

The kernel and dlls with functions used for external calling can not be searched that way, but I don't know any example of a kernel function or a function called externally from a dll using some function from a library. So that may be not needed.

Alec

That can be more or less easily done by disassembling the maple libraries into series of .m files (using march, for instance) and then using grep recursively (or writing a simple semantic analyzer). Such things as disassembling and reverse engineering may be not legal though.

Alec

I would be just happy to receive another Maplesoft mug and a copy of Maple 13 (download would be fine.)

Especially since one of threads with my comments was mentioned as getting 100 hits a month.

Now, thinking about that, it is more than 1000 hits a year. If that is close to the average of my posts, that would give 2,000,000 hits a year for my 2,000+ posts. Huh?

Alec

That has a problem for {1,1}, which is not a pair,

RelativePrime(1,2);

                            {{1}, {1, 2}}

Alec

That has a problem for {1,1}, which is not a pair,

RelativePrime(1,2);

                            {{1}, {1, 2}}

Alec