Joe, I couldn't get the code to work in M16. maybe I copied it incorrecty....

element_16.mw

 This is the effect I was trying to achieve (bolding the elements)

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

Possibly bolding/enlarding a random element per word. eg "cat", would radomly bold either the C, the Ca, or the At.

Joe, I couldn't get the code to work in M16. maybe I copied it incorrecty....

element_16.mw

 This is the effect I was trying to achieve (bolding the elements)

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

Possibly bolding/enlarding a random element per word. eg "cat", would radomly bold either the C, the Ca, or the At.

Kitonum, I salute you

Kitonum, I salute you

How do you do it Kitonum, writing these programs. Who taught you?

How do I obtain all the factors of 36?

(1,1, 36), (1,2,18), (1,3,12), (1,4,9), (1,6,6), (2,2,9), (2,3,6), and (3,3,4).

you've done it again Kitonum!

thanks Adri!

thanks Adri!

thx Joerg and Markiyan Hirnyk

thx Joerg and Markiyan Hirnyk

For most applications I prefer Maple, its more intuative than Mma. The only real reason i use Mma is for its superior simplify expression function. I havn't got Mma 9 but in the past I've found Mma "fiddly" to use: shift-enter to execute expressions, the need for capitalisation of the first letter of freqently used commands, eg Sin

Thats it Acer! So ultimately heads will be at square positions.

Just one more question:

what command do i need to generate the series after each flip? 

eg

F0=0000000000000....

F1=0101010101010....

F2=011100011100....

F3=......

thx

Thats it Acer! So ultimately heads will be at square positions.

Just one more question:

what command do i need to generate the series after each flip? 

eg

F0=0000000000000....

F1=0101010101010....

F2=011100011100....

F3=......

thx

thanks Kitonum.

I agree Acer, I didn't frame the question well. Bearing in mind your comments I thought i could have a go, using my patented "sledgehammer approach" .

restart;
with(combinat);
DartSum := proc (Darts, Total)
local L, N, S, x;
 L := choose([seq(10, i = 1 .. Darts), seq(20, i = 1 .. Darts), seq(30, i = 1 .. Darts), seq(40, i = 1 .. Darts), seq(50, i = 1 .. Darts)], Darts):
N := nops(L);
 for x to N do
 S := add(i, i = L[x]);
if S <> Total
then next
else print(L[x])
 end if
 end do;
print("does not exist")
 end proc:

 
> DartSum(3, 150);

                                [50, 50, 50]
                              "does not exist"
> DartSum(4, 150);
                              [10, 40, 50, 50]
                              [20, 30, 50, 50]
                              [20, 40, 40, 50]
                              [30, 30, 40, 50]
                              [30, 40, 40, 40]
                              "does not exist"
> DartSum(5, 150);

                            [10, 10, 30, 50, 50]
                            [10, 10, 40, 40, 50]
                            [10, 20, 20, 50, 50]
                            [10, 20, 30, 40, 50]
                            [10, 20, 40, 40, 40]
                            [10, 30, 30, 30, 50]
                            [10, 30, 30, 40, 40]
                            [20, 20, 20, 40, 50]
                            [20, 20, 30, 30, 50]
                            [20, 20, 30, 40, 40]
                            [20, 30, 30, 30, 40]
                            [30, 30, 30, 30, 30]
                              "does not exist"

annoyingly  "does not exist" get printed when solutions clearly do exist