Press the flag and let your computer run. The more active users on the project, the faster it can search. Comment if you find one! 6 - @MallardTV 28 - @MallardTV 496 - @Catzcute4 8128 - @JamalTryon
-EXPLANATION- In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding itself), and 1 + 2 + 3 = 6, so 6 is a perfect number. The next perfect number is 28, since 1 + 2 + 4 + 7 + 14 = 28. -CODE- As the counter goes up, the program lists out each factor of the current number, and then deletes the factor that is identical to the given number. Once this deletion has been completed, the program will check if the sum of the remaining factors is equal to the current number. If the sum is indeed equal, a perfect number will have been found. Once this number is found, it is encoded and added to the cloud list of perfect numbers that have been found thus far. The program has checked 10000 numbers and found 4 perfect numbers within that set of 1-10000 at the time of this writing. These numbers are as follows: 6, 28, 496, and 8128. The next number that this program will record is 33550336, and then 8589869056, 137438691328, and 2305843008139952128 respectively. Thanks to @suhalo_351 for the encoder/decoder/split engine(s). https://scratch.mit.edu/projects/463151913/
