perplexus.info :: Sequences : LCM Sequence

LCM Sequence (Posted on 2006-08-19)

Let's look at the sequence with terms a₁=19, a₂=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₄₀₉₆ and a₄₀₉₇.

No Solution Yet Submitted by atheron

Rating: 4.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Answer

Comment 7 of 7 |

The required GCD of terms a_4096 and a_4097 is 19.

Posted by K Sengupta on 2008-10-30 23:37:24

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info