I am trying to take a list of prime numbers that I already generated with the following:
for i from 2 to 50 do
if nops(ifactor(i))=1 then L4:=L4,i end if:
This gives me the primes bewteen 2-50, [2,3,5,7,11,13,17,23,29,31,37,43,47]. I want to write something that takes the products of my list like this
and so on through the whole list. Any ideas? I figured out how to take the product of 2*3, 2*5, 2*7 and so on, but I cant figure how to make it do 2*3, 2*3*7 and so on.
I am doing a presentation on Euclids infinite prime proof and thought it would be cool to write a maple program that will show his proof for a certain amount of prime numbers.