Howdy

would like to know how to generate alternating series.

eg, we have an infinite (large number) number of coins all Heads up.

seq(H,i=100)=HHHHHHHHH.......

Now we flip every 2nd coin (to tails), eg HTHTHT.......

then flip every 3rd coin, eg HTTTHH........

what does it coverge to or does it....?

How to simulate this in maple?

I guess we could also use binary code.

hi,

is there a procedure to convert a number (or list of numbers) into its english equivalent?

eg

 1 = "one", 2= "two", ......, 100 = "one hundred"

Darts.mw

I think it was Acer who did the coding for a similar previous problem. I modified it to find the components of a set which sum to 150.

Why is it that it doesn't find all the solutions with {assume=nonnegint}. eg i have to run a additional pgm {assume=binary} to catch all solutions.

1. is there a procedure to catch all?

2. is there a way i can put the list and the desired sum in the input: eg SSP(...

numeric_de.mw

hello boffins

if my de was soluble analytically, I would get an expression of time in terms of the other variables (V,theta,x) easily, but because it is only numerically solvable, i get an expression x(t)=proc(t)...,- the variables V and theta are mixed up in it-. Is there anyway they can appear?

I know I can put numerical values on V and Theta (and x) and solve for time (using parameters...

I'm not sure if u have seen this website http://mathproblems.info/working.php#s99 but i wonder if there is a better way to solve this problem using maple:

#99

It is your task to deliever as much grain as possible from city A to city B. The cities are 1,000 miles apart. You initially have 10,000 pounds of grain. Your camel may carry up to 1,000 pounds and eats 1 pound of grain per mile traveled. You...