1.You can use ab/g to compute the least common multiple of two integers, a and b, where g is the greatest common divisor of a and b. For example, the least common multiple of 4 and 6 is 12. Write a maple procedure, LCM, which take as input n>0 integers a1,a2,...an and computes their least common multiple. By convention, the least common multiple of zero and any other number is zero.
2.Please write a maple procedure called Position which returns the first position i of an element x in a list of values L. That is, Position(x,L) should return an integer i>0 such that L[i]=x. If x is not in list L,0 is returned.
Please use 5 very different examples to check various possibilities.
3. Please use Maple to verify de Morgan's laws.
show less...