perplexus.info :: Sequences : Greatest GCD

Greatest GCD (Posted on 2014-10-12)

The sequence {S(n)} is defined by the relationship: S(n) = 100 + n², 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: ( You must be logged in to post comments.)

Subject	Author	Date
re(2): Generalised approach - tying up the loose ends.	Ady TZIDON	2014-10-13 00:04:20
re: Generalised approach - tying up the loose ends.	broll	2014-10-12 23:17:54
Generalised approach	broll	2014-10-12 21:57:18
re: computer exploration	Ady TZIDON	2014-10-12 21:33:00
computer exploration	Charlie	2014-10-12 14:17:06

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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info