kill(all)$
load ("functs")$

van=facebook.com/LearningCalculus;

      Consider two fractions, u and v:

[u:2/3, v:3/5];

      Least Common Multiple

lcm(3,5);

      Greatest Common Divisor

gcd(u,v);

      Symbolic Problem

lcm(a-3,a+3);

gcd(a-3,a+3);

num(u)/denom(u);

num(u)/next_prime(num(u));

van=facebook.com/LearningCalculus$

is(equal(u,num(u)/next_prime(num(u))));

      We define q to be a random list of numbers

q: [u, v, u+v, u-v, u*v, u/v, (a-3),(a+3)];

n: length(q)$

sqrt(q);

LCM:create_list(lcm(q[i],q[i+1]), i, 1, n-1);

GCD:create_list(gcd(q[i],q[i+1]), i, 1, n-1);

PRIME_NUMERATOR:create_list(next_prime(num(q[i])), i, 1, n-2);

PRIME_DENOMINATOR:create_list(next_prime(denom(q[i])), i, 1, n-2);

F:create_list([q[i]/gcd(q[i],q[i+1]), q[i+1]/gcd(q[i],q[i+1])], i, 1, n-1);

¦¦