A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.

A number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.

As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.

Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

I wrote the code bellow, but its returning 395465626 everytime, I changed many things and Im still getting this answer, I cant figure out where the problem is, is it in the numbersWrittenByAbundant Array? or is it in the final for loop?

what this code does is

1) find all abundant numbers between 1 and 28123 and puts them in an array

2) subtract each abundant number from anther abundant number to find all the numbers that can be found by adding 2 abundant numbers and puts them in another array

3) loops from 1 to 28123 checking if each number is in the 2nd array (ie. can be written as a sum of 2 abundant numbers) if no adds it to the total of numbers

still im getting the wrong answer...

help please.