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 a4096 and a4097.
(In reply to
re: Just a guess... -- proof by Charlie)
I'm sorry to be so thick-headed, 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 2006-08-19 18:18:09 |