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

Home > Numbers > Sequences
Geometric Sequence Settlement (Posted on 2013-08-07) Difficulty: 3 of 5
Determine the total number of ways in which 111 can be written as a sum of three distinct nonzero integers which are in geometric sequence.

Prove that there are no others.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: solution with proofSteve Herman2013-08-08 13:18:48
solution with proofDaniel2013-08-08 10:55:54
Some Thoughtsexpanded list; no proof of completenessCharlie2013-08-07 12:45:22
Some Thoughtscomputer partial solutionCharlie2013-08-07 12:28:09
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