5. Suppose you wrote a different integer on each face of cube ABCDEFGH. Then a is the
sum of the integers on the faces that meet at
vertex A, b is the sum of the integers on the
faces that meet at vertex B, and so on.
Suppose N = a + b + c + d + e + f + g + h.
What is the greatest number by which N must
be divisible?

The answer is c. 7 (i think) i’m almost sure though

The question is kind of confusing. if it's asking how many variations of answers can you give. then do 4^5 for your answer.this would be something like the first question could be a and the 2nd c or first b next c etc. if you can, ask the teacher for a better confirmation of what it's asking. if i'm assuming correctly what it's asking, it's 625 different variations.