Advanced Search

Question: Algorithm

Question:Algorithm

beanchief 12 Maple
format
February 26 2006
0
Hi. Many thanks for your time. I'm just trying to get some help on getting maple to calculate the values in an algorithm. Can you suggest where I can access some help pages? The algorithm consists of 3 interacting elements; alpha(i), gamma(i) and epsi(i). The object is to compute the first however many (say 1000) iterations of epsi(i). To do this you need the first however many iterations of alpha(i) and gamma(i). Each value 'p' represents a different algorithm. (ie. a different set of the algorithms alpha (i), gamma (i), epsi (i). I put the *** around the information which is redundant for my purposes but which may be useful in terms of programming. Could you give me an indication of how difficult it would be to write a program. (Or write one and e-mail it to me if there is a very kind soul out there who would enjoy this kind of thing.) I'm a complete novice and I want to use the algorithm to test a conjecture relating to the collatz conjecture for my undergraduate maths project. Many, many thanks. Here it is: Initial values: eps(i) = 0 if i=2k where k is a natural number less than or equal to p eps(i) = 1 if i=2k-1 where k is a natiural number and i is less than or equal to p alpha (1) = 0 ***alpha (2) = 1*** ***gamma (i) = 0 for i less than or equal to p**** Recursive relationships gamma(i) = epsi(n-p) epsi(i) = gamma(i) - epsi(i-1) - alpha(i) (mod 2) epsi(i+1)=epsi(i) alpha (i)= 0 if alpha(i-1) + epsi (i-1) +epsi (i-2) is less than or equal to 1 and = 1 if alpha(i-1) + epsi (i-1) +epsi (i-2) is greater than 1
Please Wait...