All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 LCM Sequence (Posted on 2006-08-19)
Let's look at the sequence with terms a1=19, a2=95, and an+2=LCM(an+1,an)+an

LCM stands for Least Common Multiple, and n is a positive integer.

Find the Greatest Common Divisor (GCD) of terms a4096 and a4097.

 No Solution Yet Submitted by atheron Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 Just a guess... | Comment 1 of 7

As the numbers get progressively larger, one can see that there is a pattern of primes exponetially increasing and multiplied by new primes. For example:

a1 = 19
a3 = 19*21*31
a5 = 19*23*33
a7 = 19*24*34*2111
and
a2 = 95
a4 = 95*71
a6 = 95*72*311
a8 = 95*73*312*75611

It is possible that in the progression an and an+1 will eventually share a common prime other than 19. Yet without the aid of a computer program, I woud find it difficult to find these common factors.  Thus, my initial guess for the GCD is the known common factor between 19 and 95 [95=19*5] -- that is, 19.

Edited on August 20, 2006, 5:25 am
 Posted by Dej Mar on 2006-08-19 14:01:30

 Search: Search body:
Forums (0)