@brian bovril 

The command for that is

map(`>`, {a,b,c,d}, 0);

Note that the quotes are back quotes, not aposthropes. What the above means is

1. `>` is an operator that takes two arguments,
2. the first argument is taken iteratively from {a,b,c,d},
3. the second argument is always 0.

Another command that does the same thing is

{seq(x>0, x= {a,b,c,d})};

@ecterrab I am using Maple 17.01, Standard GUI, 64-bit, Windows 8. The given macro command fixes the problem for me.

@Kitonum This last piece of code is very impressive.

@Kitonum This last piece of code is very impressive.

@ecrkae You need to give values for A, c_3k, etc.

@ecrkae You need to give values for A, c_3k, etc.

You are assuming that the letters represent distinct digits. That may be the default assumption in such problems; I don't know.

It is immediately obvious that C=9, K=1, and R is even. Applying essentially your technique, I get 94 solutions in about a half second.

restart: st:= time():
S:={$0..9}:  L:= table():  C:= 9:  K:= 1:
for N in S do
for R in {0,2,4,6,8} do
for P in S do
for H in S do
for M in S do
for E in S do
     a:=C*10^3+N*10^2+R*10+P:
     b:=C*10^2+P*10+P:  
     c:=K*10^4+H*10^3+M*10^2+E*10+R:
     if a + b = c  then  L[CNRP=a, CPP=b, KHMER=c]:= [][]  fi:
od: od: od: od: od: od:
time()-st;
nops([indices(L)]);
                             0.547
                               94

You are assuming that the letters represent distinct digits. That may be the default assumption in such problems; I don't know.

It is immediately obvious that C=9, K=1, and R is even. Applying essentially your technique, I get 94 solutions in about a half second.

restart: st:= time():
S:={$0..9}:  L:= table():  C:= 9:  K:= 1:
for N in S do
for R in {0,2,4,6,8} do
for P in S do
for H in S do
for M in S do
for E in S do
     a:=C*10^3+N*10^2+R*10+P:
     b:=C*10^2+P*10+P:  
     c:=K*10^4+H*10^3+M*10^2+E*10+R:
     if a + b = c  then  L[CNRP=a, CPP=b, KHMER=c]:= [][]  fi:
od: od: od: od: od: od:
time()-st;
nops([indices(L)]);
                             0.547
                               94

Why do you want to use C when those things can be done in Maple?

Do you mean that p is the conjugate of z?

@brian bovril To change the prompt, use interface(prompt= "(**)").

Where is my sequence wrong? I tested it up to the 1000th Fibonacci.

@brian bovril To change the prompt, use interface(prompt= "(**)").

Where is my sequence wrong? I tested it up to the 1000th Fibonacci.

@wolfman29 Yes, you can do double (and higher dimension) numeric integrals. There are basically two syntaxes:

Int(Int(x^2+y^2, x= 0..y), y= 0..1);  evalf(%);

or

Int(x^2+y^2, [x= 0..y, y= 0..1]);  evalf(%);

@wolfman29 Yes, you can do double (and higher dimension) numeric integrals. There are basically two syntaxes:

Int(Int(x^2+y^2, x= 0..y), y= 0..1);  evalf(%);

or

Int(x^2+y^2, [x= 0..y, y= 0..1]);  evalf(%);

Why do you say "possible"? It's clear to me that your code covers all the cases.