Every year my extended family does a "secret santa" gift exchange. Each person draws another person at random and then gets a gift for them. At first, none of my siblings were married, and so the draw was completely random. Then, as people got married, we added the restriction that spouses should not draw each others names. This restriction meant that we moved from using slips of paper on a hat to using a simple computer program to choose names. Then people began to complain when they would get the same person two years in a row, so the program was modified to keep some history and avoid giving anyone a name in their recent history. This year, not everyone was participating, and so after removing names, and limiting the number of exclusions to four per person, I had data something like this:

Corless & Davenport provide a whole bestiarium of rules. This is a small part of the most simple cases, which I sampled more or less for 'all day use' as reference. They are based on the 'unwinding number' (which is a sheet number of according Riemannian surfaces). It turns out, that Maple can 'proof' the identities, if one does not use the definition, but uses the version given in the help pages (= version 2 in the following).

While running Maple (13.0 and 13.02) on a Linux system that has IPv6 enabled (Debian Sid AMD64 as of December 8, 2009) I found that the xmaple interface was unable to connect to the Maple kernel.  Command line maple worked fine with a simple test of 2 + 2.  Xmaple had some odd behavior as the kernel connection issue is not reported until running a calculation.  Aslo I found the many of the menu items were dimmed out such as "Help" -> "About" and "Help" -> "Maple Help."  Further selection of the "Tools" menu caused t

I am studying the Julia sets and Mandelbrot. I know how to generate them. I know how to animate a simple function in the real field but until now not able to animate the Julia sets and the Mandelbrot. Is there any user guide or examples that explaines how to animate these two things in 2-D or 3-D?  I already have the user manual guide and the advanced programming guide downloaded from maplesoft but they do not contain any information or examples about what I am looking for.

The program mint, bundled with Maple, is a very useful syntax checker and program analyzer.

As provided, `mint` works best with Maple program source when contained in plaintext files. Inside Maple itself there is a command maplemint which does some of the same tasks as the stand-alone program `mint`. Unfortunately `maplemint` is quite a bit weaker than `mint` is, for quite a selection of procedures. Also, `maplemint` doesn't have the sort of flexible control that `mint` provides through its optional calling parameters.

I had previously posted a Maple language procedure for the purpose of calling out to `mint` while inside Maple (Standard GUI, or other). Here it is below, cleaned up a little. Hopefully it now works better across multiple operating systems, and also provides its optional parameters better.

Atomic operations are CPU instructions that are guaranteed to execute in a single CPU cycle. This means that the operation is guaranteed to complete without being interrupted by the actions of another thread. Although this may not sound too exciting, careful programming using these instructions can lead to algorithms and data structures that can be used in parallel without needing locks. Maple currently does not support atomic operations, however they are an interesting tool and are used in the kernel to help improve Maple's parallelism in general.

I solved IVP of ODE with solutions x(t),y(t),z(t) numerically.x(0)=y(0)=0,z(0)=0.25

How can I get the coefficients of the initial values in x(t)

i.e  assume the solution

x(t)=e1(t)x(0)+e2(t)y(0)+e3(t)z(0)+e4(t)

how can we get :

e1(t),e2(t),e3(t) and e4(t)

 

I recieved this comment on an older post of mine, and I was going to post a reply, but I noticed my reply was pretty long, and I was also missing a post for last friday, so I figured I'd cheat and make the reply a blog post of its own.

Very few people would ever need this, I think, even while programming. But sometimes the details of the call stack are just what one wants.

So, for example,...

> h:=proc(x)
>   debugopts('callstack');
> end proc:

> m:=module() export f; local g;
>   f:=proc(x)
>     g(x^2);
>   end proc:
>   g:=proc(x)
>     global h;
>     h(x^3);
>   end proc:
> end module:

> m:-f(a);
[DEBUGSTACK, h, `debugopts('callstack')`, [a^6...

I've been working with fsolve and I'm having the following issue: fsolve({dif_Fliq=((nFsol-nFliq)/(psi_sol-psi_liq)),dif_Fliq=dif_Fsol},{psi_sol=0.1..0.9,psi_liq=0.1..0.9}); {psi_liq = 0.4447971078, psi_sol = 0.3459845910} how do I get the value of psi_liq and psi_sol and assign them to a different variable without having to copy the whole thing? i.e. if I use the following command assign(result_liq,psi_liq); I get result_liq=psi_liq = 0.4447971078 not what I want result_liq = 0.4447971078 I also tried: result_liq:=psi_liq and I ended up with the same result

An attempt at question 2 of the xkcd Velociraptor Math problem (mentioned on this blog post). The parameters and events facilities of

There is no released Classic interface to accompany the 64 bit version of Maple (12, 13) for the 64 bit Windows XP64 operating system. Personally, I prefer running the Standard over the Classic interface, although sometimes I miss common subexpression display for lengthy symbolic output.
 
The Maple Classic interface appears to talk to the Maple kernel only over a socket (or similar), and the...

In this post I'll take a closer look at the ways in which Maple code can be thread unsafe. If you have not already seen my post on Thread Safety, consider reading that post first. As a brief review, a procedure is thread safe if it works correctly when run in parallel.

The most obvious way in which procedures can be thread unsafe is if they share data without synchronizing access (using a Mutex, for example). So how can two threads share data?

I am going to wander away from parallel programming in Maple, to talk about GPU programming. However I will show an example of connecting Maple to a CUDA accelerated external library, so that's close enough.  This post is not intended to be a tutorial on CUDA or OpenCL programming, but an introduction to how the technology works.

Download 10597_asymp.mws
View file details

Hi
I am facing problem with maple. I try to get a asymptotic series of a transcendental equation but I get failed again and again. If You people could help me.

I am waiting for ur kind responce.

Thanks