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

Home > Numbers > Sequences
Powered Greatest Root (Posted on 2011-02-03) Difficulty: 3 of 5
The sequence {An, n ≥ 0} is defined by:

A0 = 0, and:

An+1 = [3√(An + n)]3

Determine an explicit formula representing An in terms of n.

Hence, or otherwise, determine all n such that An = n

Note: [x] represents the greatest integer ≤ x

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Question? | Comment 2 of 4 |
(In reply to Question? by broll)

Note there is a floor function there. The square brackets are not there to provide visual distinction from the internal parentheses, but rather, as the note explains, indicate the floor of their contents, which, for the positive numbers involved here, amounts to truncating to an integer.
  Posted by Charlie on 2011-02-03 14:01:57

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 (6)
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