Hi, I have a table of tables like the following one.

fss:= [{a, b, c}, table([e4 = table([a = .4, b = .7, c = 1]), e1 = table([a = .2, b = 0, c = .1]), e2 = table([a = .1, b = 1, c = .4])]), {e1, e2, e3, e4}];
 

Now I want to compute fss[2][e4][b]/2.0 but Maple does not recognize table entry as a number. What I should do? What is the reason for this behaviour?

This is it… the big one: the nomination period is now open for the Maple Mentor of the Year.  The winner of this prestigious title will receive among other things, a trip to Maplesoft HQ in beautiful Waterloo.  Nominations will be accepted for the month of September, and the recipient will be announced in mid-October.

Does anyone remember (or have) that album?  Anyway, school has started, so summer is officially gone in the eyes of most.  With one more month gone, it’s time for another Mentor Award to be given out.  The recipient of the title Maple Mentor for the month of August, and all the riches and glory that accompany it, is Joe Riel.  Way to go Joe.
 

Keep on posting!

Maple says that the limit of sqrt(x), as x goes to 0, is 0, but Edwards of Larson et al. says that it isn't because "f(x) = sqrt(x) is not defined on an open interval containing 0 because the domain of f is x > = 0." 

 Comments?
 

Alla

Here is some standard alternative to Newton's method (and
thus may safe some homework ... so what). 

It will find a root of f (I think it must be continuous C^1)
in the interval ax ... bx, if it has different signs at the
boundaries.

The code is more or less translated from netlib C library
(or similar).

Usage:

  Digits:=16;

  f:= x -> exp(x)-Pi;
  zBrent( f, 0.0, 2.0);
  'f(%)': '%'= evalf(%);

If F is a quadratic function on a n-dimensional vector space,
then F(x) is affine equivalent to one of the following:

  Sum( epsilon[j]*x[j]^2, j=1 ..r  ), 
  Sum( epsilon[j]*x[j]^2, j=1 ..r  ) + alpha,

The help page ?type/protected states:

The set of protected names in Maple can be computed with select(type, {unames(), anames(anything)}, protected).

However, the result of this computation is "time dependent". I.e. repeated execution of this command produce different sets. E.g. executed in a fresh session:

In this previous post, an example is shown that demonstrates the potential problems that can arise following symbolic conversions such as from sqrt(x^2)  to x^(1/2).

This provides a Maple solution to compute the bivariate normal distribution by recursions for numerical inputs. It works even for extreme cases and handles situations, where usual integration with Maple has serious problems (even after reducing to dimension 1), it seems to be reliable and fast and works in 'arbitrary' precision.

To use it call N2_as_sum(1.0, 2.0, 0.8,  200) to compute the BVN for x = 1.0, y = 2.0 and correlation rho = 0.8 with at most 200 recursion steps (it will stop earlier, if no more improvements can be seen).

The calling sequence in ?complex states only the two argument form 'Complex(x, y)', but later in the section "Description", in a bit confusing way, two rules for the single argument form are stated: