Aliquot sequences are defined thus :
The aliquot sequence starting with a positive integer k can be defined formally in terms of the sum-of-divisors function Ļ1 or the aliquot sum function s in the following way:
s0 = k
sn = s(snā1) = Ļ1(snā1) ā snā1 if snā1 > 0
sn = 0 if snā1 = 0
(if we add this condition, then the terms after 0 are all 0, and all aliquot sequences would be infinite sequence, and we can conjecture that all aliquot sequences are convergent, the limit of these sequences are usually 0 or 6) and s(0) is undefined.
Source : Wikipedia
It's conjectured - but not yet proved - that all aliquot sequences will eventually terminate.
All sequences so far tested do terminate - but it nevertheless remains unknown if all examples will.
Ideas for new topics, and suggested additions / corrections for older ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)
You are currently viewing an auto-translated version of Wikenigma
Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.
Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.