In part 'b' of the question we are asked to write a function that decides for every 'n' if the aliquot sequence that starts with this number is of type 1 or type 2. It's not hard to check if the sequence ends with a prime number or terminates to a sequence of perfect/ amicable numbers. It is hard though to know if it treminates to a sequence of sociable numbers, for the sequence to be sociable, it must be cyclic and return to its starting point after a cycle greater than 3. I can't find a way to get this checked so I can decide the type of the sequence. Am I in the right direction or maybe I'm just complicating things ?
Date: 22 Nov 2014 10:03
Number of posts: 4
RSS: New posts
what if the sum of the divisors just getting bigger? , try this input 22204 "I randomly tried it"