Project Euler Problem #21
It took me a few adjustments – namely having to eliminate numbers those numbers whose summed divisors equalled the original (6, 28, 496, etc.). I reduced my workload by eliminating primes. using System; public class TwentyOne { static void Main() { int a = 1; int b = 0; for (int i = 1; i [...]