These kinds of questions seem good to start with a programming approach. Maybe that's gauche, but call me gauche! This Java snippet loops through all 3-tuple and uses the uniqueness constraint of HashMaps to find the unique answers:
public static void main(String [] args) {
int [] array = {13,10,23,28,33,36,43,48};
HashMap<Integer, Integer> uniques = new HashMap<Integer, Integer>();
for (int i = 0; i < array.length -2; i++) {
for (int j = i + 1; j < array.length -1; j++) {
for (int k = j + 1; k < array.length; k++) {
int sum = array[i] + array[j] + array[k];
uniques.put(sum, sum);
}
}
}
ArrayList<Integer> values = new ArrayList<Integer>(uniques.values());
Collections.sort(values);
for (Integer unique: values) {
System.out.print(unique + ",");
}
System.out.println("\nThe number of unique sums is: " + uniques.size());
}
This prints:
46,51,56,59,61,64,66,69,71,72,74,76,77,79,81,82,84,86,87,89,91,92,94,97,99,101,102,104,107,109,112,114,117,119,124,127
The number of unique sums is: 36