Let's look at the sequence with terms
a
_{1}=19,
a
_{2}=95, and a
_{n+2}=LCM(a
_{n+1},a
_{n})+a
_{n}
LCM stands for Least Common Multiple, and n is a positive integer.
Find the Greatest Common Divisor (GCD) of terms a_{4096} and a_{4097}.
(In reply to
re: Just a guess...  proof by Charlie)
I'm sorry to be so thickheaded, but I don't understand your argument,
Charlie. Are you saying that any factor of both a(n+2) and a(n+1)
must also be a factor of a(n)? That would certainly clinch the
19. I just don't see that you have shown that, or maybe that
isn't what you are driving at after all.

Posted by Richard
on 20060819 18:18:09 