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

Home > Numbers > Sequences
Greatest GCD (Posted on 2014-10-12) Difficulty: 3 of 5
The sequence {S(n)} is defined by the relationship: S(n) = 100 + n2, whenever n is a positive integer.

If G(n) = gcd(S(n), S(n+1)), then find the maximum value of G(n).

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts Generalised approach | Comment 3 of 5 |

If G(n) = gcd(S(n), S(n+1)), then it divides their difference, which is simply (2n+1).

So, in the example given, (n^2+100)/(2n+1) is an integer.

Generalising: (n^2+k)/(2n+1) must also be an integer.

We can always make the substitution: ((2k)^2+k)/(2*(2k)+1) to return the integer, k. Since in the example given, k=100, the prime 401 must divide all solutions {S(n), S(n+1)}

And so on.


  Posted by broll on 2014-10-12 21:57:18
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information