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

Home > Numbers > Sequences
Ducks in a row (Posted on 2003-08-04) Difficulty: 3 of 5
Given an integer n (n≠0), there are a finite number of sequences of consecutive integers whose terms add up to n (If n=25, then 3+4+5+6+7=25 is one such sequence with 5 terms).

a. Find an equation for the number of terms of the longest such sequence for any positive integer n.

b. Find equations for the bounds (the first and last terms) of the longest such sequence for any positive integer n.

Hint: Once you have an equation for the number of terms, and for the first term of the sequence, the last term is simply one less than their sum.

Hint 2: Ducks have absolutely nothing to do with the problem.

See The Solution Submitted by DJ    
Rating: 4.4167 (12 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionMy solutionH2003-08-04 16:43:28
re: Some hintsGamer2003-08-04 15:36:13
Hints/TipsSome hintsFederico Kereki2003-08-04 10:00:49
Solutionre: Picky of me....leads to solution?Brian Wainscott2003-08-04 07:21:23
Some ThoughtsPicky of me....Brian Wainscott2003-08-04 06:59:21
re: Queue problemsDJ2003-08-04 06:45:22
QuestionQueue problemsGamer2003-08-04 06:36:11
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:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information