Sequence
Generate a sequence where the N+1 term is the product of all previous terms +1 and the t(N+1) is divisible byp(N+1) ie the Nth prime.
SO t(1) divisible by 1
t(2)=t(1)+1 and divisble by 2
t(3)=t(2)*t(1)+1 and divisble by 3
t(4)=t(3)*t(2)*t(1)+1 and divisble by 5.
and so on...
Good luck this is a hard problem, lets see who can generate the longest sequence.
Can you find a algorithm to generate this sequence to some prime p?
Citrix
