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: ( You must be logged in to post comments.)
  Subject Author Date
AnswerK Sengupta2008-10-30 23:37:24
SolutionReductionGamer2006-08-19 21:55:03
re(4): Just a guess... -- proofRichard2006-08-19 21:54:57
re(3): Just a guess... -- proofCharlie2006-08-19 19:18:23
re(2): Just a guess... -- proofRichard2006-08-19 18:18:09
Solutionre: Just a guess... -- proofCharlie2006-08-19 16:21:41
Some ThoughtsJust a guess...Dej Mar2006-08-19 14:01:30
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 (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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