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

Home > Numbers > Sequences
LCM Sequence (Posted on 2006-08-19) Difficulty: 3 of 5
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.)
re(2): Just a guess... -- proof | Comment 3 of 7 |
(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

Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information