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

Home > Numbers > Sequences
Two related sequences (Posted on 2015-12-30) Difficulty: 2 of 5
a(n)=0,2,1,5,7,3,10,4,13...

Rules for a(n):
No number appears more than once in the sequence.
The first term (0) is divisible by 1
Each additional term is the smallest positive integer available that makes the sum of the first n terms divisible by n.

Create a new sequence b(n) by the same rules but beginning with b(1)=1.

[1] Prove b(n)=a(n)+1 for all n.

[2] Prove if b(n)=m then b(m)=n

No Solution Yet Submitted by Jer    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
There are no comments yet.
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 (13)
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