|
First you need all the prime numbers.
Next you need multiples and sums of the prime numbers.
2 * 3,
2 * 5, 3 * 5,
2 * 7, 3 * 7, 5 * 7,
2 * 11, 3 * 11, 5 * 11, 7 * 11,
2 * 13, 3 * 13, 5 * 13, 7 * 13, 11 * 13
2 * 3 * 5, 2 * 3 * 7, 2 * 3 * 11, 2 * 3 * 13,
2 * 5 * 7, 2 * 5 * 11, 2 * 5 * 13,
2 * 7 * 11, 2 * 7 * 13,
2 * 11 * 13
3 * 5 * 7, 3 * 5 * 11, 3 * 5 * 13,
3 * 7 * 11, 3 * 7 * 13,
3 * 11 * 13,
5 * 7 * 11, 5 * 7 * 13
5 * 11 * 13
7 * 11 * 13
2 * 3 * 5 * 7, 2 * 3 * 5 * 11, 2 * 3 * 5 * 13,
2 * 5 * 7 * 11, 2 * 5 * 7 * 13,
2 * 7 * 11 * 13,
3 * 5 * 7 * 11, 3 * 5 * 7 * 13,
3 * 7 * 11 * 13,
5 * 7 * 11 * 13,
2 * 3 * 5 * 7 * 11, 2 * 3 * 5 * 7 * 13,
3 * 5 * 7 * 11 * 13,
2 * 3 * 5 * 7, 2 * 3 * 5 * 11
1. Place all prime numbers in an array or vector
2. Use a for loop to compare sums and factors
|
| 