Let s(n) be the sum of the

*proper*factors of a positive integer n; this is the sum of all the factors of n, including 1 but excluding n itself. Let s

_{0}=n, s

_{1}=s(n), s

_{2}=s(s(n)) and so on, thereby creating the sequence {s

_{0}, s

_{1}, s

_{2}, ...}.

If n is a prime number p, then s(p)=1 and s(s(p))=0, thus terminating the sequence. As most such sequences terminate in this way, it is normal to terminate the sequence at the first prime number.

a) Calculate the terminating prime number for the starting value of n=12.

b) Find all possible sequences such that s

_{6}=7.

c) Prove that it is not possible for a sequence to terminate with a 5, unless s

_{0}=5.

These types of sequences are still being researched and they do not all terminate in the manner described above. Try n=276 and see what happens. Have fun!

**Feel free to comment, ask questions and even check your answer in the comments box below powered by**~~Disqus~~ Google+.

**}**

**This space is here to avoid seeing the answers before trying the problem!**

*}*

**If you enjoy using this website then please consider making a donation - every little helps :-)**

**You can receive these questions directly to your email box or read them in an RSS reader. Subscribe using the links on the right.**

**Don’t forget to follow Gifted Mathematics on Google+, Facebook or Twitter. You may add your own interesting questions on our Google+ Community and Facebook..**

You can also subscribe to our Bookmarks on StumbleUpon and Pinterest. Many resources never make it onto the pages of Gifted Mathematics but are stored in these bookmarking websites to share with you.You can also subscribe to our Bookmarks on StumbleUpon and Pinterest. Many resources never make it onto the pages of Gifted Mathematics but are stored in these bookmarking websites to share with you.