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
)
The sequence {S(n)} is defined by the relationship: S(n) = 100 + n
2
, 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.
)
re(2): Generalised approach - tying up the loose ends.
Comment 5 of 5 |
(In reply to
re: Generalised approach - tying up the loose ends.
by broll)
Nice example of a team work.
Like.
Posted by
Ady TZIDON
on 2014-10-13 00:04:20
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 (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002 - 2024 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information