phone_code_mprime.mw

given 2 pools of letters, i need a procedure to select from the list of 2 letter permutations the appropriate candidates (that are in the correct order).

permute produces a lot of candidates, but i need an english word formed in the correct order.

attached file should explain

thanks

Hi

I have this sequence which I would like to find an equation f(n) (using RSolve?).

the independant variable is n.

n=4,5,6....inf (incrementing by 1)

f(n)=2,3,3,3,4,5,5,5,6,7,7,7,8,9,9,9,10,11,11,11,12...etc

(an even number followed by three subsequent odds and so forth)

thanks!

Hi

I want to simplify sin(x)/cos(x) to tan(x).

i have tried command simplify(sin(x)/cos(x),trig);

and

trigsubs(tan(x))[4] = sin(x)/cos(x)

(wrong way round)

rgds

Hello

I need a procedure, or command, which will identify the unique sets which sum to 1 (from a permuted list).

by way of explanation:

> with(combinat);

>A := permute([1, 1, 0, 0, 0, 0, 0, 0], 8);

[[1, 1, 0, 0, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 0, 0], [1, 0, 0, 1, 0, 0, 0, 0],

  [1, 0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 0, 1, 0, 0],

  [1, 0, 0, 0, 0, 0, 1, 0], [1, 0, 0, 0, 0, 0, 0, 1],

  [0, 1, 1, 0, 0, 0, 0, 0], [0, 1, 0, 1, 0, 0, 0, 0],

View 2735_add.mw on MapleNet or Download 2735_add.mw
View file details

Hi

what i want is a procedure to do the following:

given an integer input, add the digits together. if the no. of digits resulting is >1 repeat until a single digit remains.