This post is an index page for reading the Parallel Programming blog posts.

Greetings to all.

The multiplicative partition function is defined here at Wikipedia and was recently the subject of a discussion at Math Stackexchange.

I posted two solutions to the task of computing this function at the above page that use Maple code. One of them employs the Polya Enumeration Theorem and is of mostly theoretical interest as it cannot be used to effectively compute the function for n with many factors. I posted two additional implementations in order to remedy this defect, one of them in Maple and the other in Perl. I think the Maple implementation is easy enough to read not to require additional commentary. Note, however, that even though the Maple code and the Perl code implement the same algorithm (dynamic programming), the Maple version is dramatically slower than the Perl version and consumes a lot of memory. E.g. Maple takes 58 seconds for the value for 9! and Perl takes 1.5 seconds.

My question is, can someone explain this difference? Note that both are interpreted languages so there is no gain due to potential compilations.

Your commentary is appreciated.

This is with Maple 15 (X86 64 LINUX).

Best regards,

Marko Riedel

I made 3 years ago a SOKOBAN game using Maple for my Math/Programming class.

Here is a video of the application:

http://www.youtube.com/watch?v=l00l82_LK2Y

Have a nice day!

Everyone knows that Maple combines a smart user interface with a highly sophisticated mathematical engine, where common tasks are performed quickly and seamlessly with point, click and drag operations. Of equal importance, however, is the fact that Maple is also backed by a comprehensive programming language. Also called "Maple", this language combines elements from procedural languages (like C), functional languages (like Lisp) as well as object oriented languages (like C++...

hey friends I have solved linear equation numerically and in the end i have ploted pointplot graph where every point in graph is taken maunally. Please help me how to write code that at specific values of x required points from

Solution := backsub(S)

should automatically be ploted where x=i*h and h=1/32 where i varies from 0 to m.

Hi, how can I make a prodecure in Maple 16 that takes a function as a paremter and then manipulates with it?e.gTest := proc(f)return f(10):end proc And I can then run Test(f(x)) and get f(10) back?Thanks

Hello,

After we solved two equations we want to plot them with two sliders. I am trying to have two sliders for k and mu. I followed what this link suggested:

http://www.mapleprimes.com/questions/119732-How-To-Code-Sliders-To-Make-It-Easy

But I get this warning:

Warning, `p1` is implicitly declared local to procedure `myplot`

Hi,

What is the command to have a programming loop record a piece of data everytime the loop runs? I want to record the components of a vector each time.

Thanks for any help.

This is for a code that analyzes composite laminates with many plys of varying orientation stacked on top of each other, and this is the first semester I've used Maple.

I'm solving for the roots of an equation which will always have a positive and a negative root, and I do this for each ply (could be 100 plies in a laminate). I want to collect the positive root for each ply, put them in a list or array, and then pick out the smallest value of all the plies ...

I've used the "unapply" command to calculate the several separarte transformation matrices (working a classical lamination theory problem in mechanics of composite laminates). I'm now having a problem using these values to perform further calculations. I've uploaded my file. Basically, I;ve got to calculate some matrices and use those to calcuate other matrices. Would anyone mind taking a look at it and letting me know if you have any suggestions...

Hi everyone, I'm new to the forum and also new to Maple.

I am trying to do the following:

"Write a procedure, marks, to take a student’s mark and output the appropriate grade, based on the following table:"

Mark

0 – 39.99

I am new to Maple. I need to measure the time complexity of computing the GCD for a set of 1024-bit numbers. I have an equation as:

O(nm × log^2 m × log log m). Where n is the number of bits in the numbers in my set (say, 1024-bit) and m is the number of times I am going to do a computation. How can I perform this computation in Maple ?

Start with the numbers 1, 1/2, 1/3, ... , 1/100. Choose any two numbers M and N from this list and replace them by the single number M + N + M x N. Repeat the process until only one number is left.

eq, take pair (1,1/2)-->1+1/2+1*1/2=2

then (2,1/3)-->3 and so on .... and you obtain 100.

Can someone show me procedure to accomplish this, because when i try to do it i get into a tiz

How to programmatically insert the signs +, −, ×, /, (, ) into 123456789 to make it equal to 100 ? Of course, with Maple. I understand more or less how to produce that by using formal grammars(see http://en.wikipedia.org/wiki/Formal_grammar ).

You must be logged into your Facebook account in order to share via Facebook.

Click the button below to share this on Google+. A new window will open.

You must be logged in to your Twitter account in order to share. Click the button below to login (a new window will open.)

Please log-in to your MaplePrimes account.

Wrong Email/Password. Please try again.