There appears to me to be more emphasis in the new Mapleprimes on personal reputation, as opposed to ranking of posts & replies.

I'd prefer to see more emphasis by the admins on ways to disseminate the best tips and answers than on automated reputation marking.

It looks like hubris. To paraphrase Carly Simon's great song, "you're so vain, you probably think this post is about you..."

A lot of people want to do very large computations which require a lot of RAM.  But above a certain threshold, the cost of memory explodes.  We had this idea but no excuse to try it.  Buy a good SSD and use it for a swap partition.  I suggest the Intel X25-M.  Make sure you have at least 1/10th of its size in RAM, i.e. 8GB of RAM for an 80GB drive, but of course more is better.  The RAM should act as a massive cache for the SSD, giving you another...

Does anyone see the Maple 2D Math output in the replies to this post?  What I see is a lot of Maple Equation markers.

Quite a few of the Questions under the "Unanswered" tab on the Mapleprimes main page, down around the end of the first page worth of results, do actually contain Comments.

It looks like such responses were not migrated properly as Answers.

Joe Riel once posted a very nice post about a package named "tine" that he wrote to measure performance in Maple.

It is cached here by google.

The page

 

If a function is differentiable at some point c of its domain, then it is also continuous at c. However here we extend the notion of differentiability to be valid for individual points on the real number line, specifically positive integers.

 f(n)=(-1)^n* n^(1/n)

THEOREM MRBK 8.0

f=f' / (I*Pi+(1-ln(n))/n^2)| n ∈ {1,2,3,...}

By THEOREM MRBK 4.0, When n is in the set of (positive) integers the derivative of f is exactly I*Pi*f+(1-ln(n))*f/n^2.

So f' = I*Pi*f+(1-ln(n))*f/n^2| n ∈ {1,2,3,...}

Solving for f, we have the following:

f' = I*Pi*f+(1-ln(n))*f/n^2

f' = f*(I*Pi+(1-ln(n))/n^2)

f=f' / (I*Pi+(1-ln(n))/n^2)

 

For more on this click here (W/A).

I'm not sure if this happens in Maple 13 and up. But in the standard interface, if you hold your cursor over the maple tab at the bottom of Windows or the maple help tab at the bottom until the flyout (only takes a half second or so) and leave it, while it is there your typing in Maple will lag. Just checked the classic interface and it is not affected by this. Can anyone check this in Maple 13 and 14?

The following 2 sums are equal,

Recently, Markiyan Hirnyk asked how to find all Hamiltonian cycles in a graph using Maple.

Here is a procedure using Ham Cycle unix tool (which is GPLed) in Windows.

First, one has to download it from the link above and put in his/her cygwin home directory, /cyg/home/Alec for me. Then start cygwin shell, extract the downloaded archive and cd to the extracted directory,

Is there any other good way to get better Quality Assurance on the items on the Application Center?

It seems that community ratings just aren't adequate. I don't mind that lots of items are a bit thin in the content aspect. But bad advice is a problem.

Take this example, where Matrix-Matrix multiplication is suggested primarily in the following...

Could the Student:-Calculus1:-Hint routine detect that its answer(s) will result in an endless cycle (even if only cycles of length 2)? Maybe it could check, and not make such hints?

Below is just one example. Sure, its hint is not great here, due to which this is not a fantastic example. But I'm still wondering about cycling prevention for Rule&Hint in general.

This is Maple 13.01.

> restart:
> with(Student:-Calculus1):

> Int((x^2+a...

Since the MRB constant is an alternating sum of positive integers to their own roots, f(n)=(-1)^n* n^(1/n); a thorough understanding of the changes in f, as n changes, is important.
In this blog we will begin to explore the derivative of f at integer values of n, and as n-> infinity. I am not sure weather this will help us in computing more digits of the MRB constant since we already know so many,

At the end of the blog MRB constant 

Maple has been able to solve linear programnming (LP) problems since Release 9 with Optimization[LPSolve]. This is a very important feature for people who are interested in optimization applications. However, as far as I know, LPSolve only provides the final optimal solution, but does not give any sensitivity analysis results.

I believe that LP solutions without sensitivity analysis are not very useful since one needs to compute the dual prices for resources, optimality ranges for objective function coefficients, etc.

It's funny that multiplication of a single number works on a list for each element but addition does not work the same way.

a:=[1,2,3]

3*a;
       [3,6,9]

3+a;
 error

You have to use zip(`+`,3,a) for it to work.  Is there not a simple way.  Why is that?